/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1232a.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:40:58,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:40:58,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:40:58,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:40:58,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:40:58,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:40:58,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:40:58,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:40:58,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:40:58,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:40:58,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:40:58,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:40:58,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:40:58,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:40:58,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:40:58,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:40:58,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:40:58,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:40:58,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:40:58,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:40:58,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:40:58,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:40:58,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:40:58,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:40:58,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:40:58,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:40:58,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:40:58,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:40:58,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:40:58,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:40:58,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:40:58,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:40:58,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:40:58,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:40:58,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:40:58,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:40:58,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:40:58,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:40:58,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:40:58,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:40:58,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:40:58,706 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:40:58,729 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:40:58,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:40:58,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:40:58,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:40:58,733 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:40:58,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:40:58,733 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:40:58,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:40:58,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:40:58,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:40:58,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:40:58,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:40:58,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:40:58,736 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:40:58,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:40:58,736 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:40:58,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:40:58,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:40:58,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:40:58,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:40:58,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:40:58,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:40:58,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:40:58,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:40:58,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:40:58,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:40:58,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:40:58,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:40:58,739 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:40:58,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:40:59,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:40:59,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:40:59,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:40:59,050 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:40:59,050 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:40:59,051 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1232a.c [2020-07-10 14:40:59,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0cbd624/14ccd3744fa744c789236758d305bb4c/FLAG9aa150d99 [2020-07-10 14:40:59,634 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:40:59,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1232a.c [2020-07-10 14:40:59,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0cbd624/14ccd3744fa744c789236758d305bb4c/FLAG9aa150d99 [2020-07-10 14:40:59,996 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a0cbd624/14ccd3744fa744c789236758d305bb4c [2020-07-10 14:41:00,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:41:00,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:41:00,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:41:00,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:41:00,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:41:00,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:40:59" (1/1) ... [2020-07-10 14:41:00,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51390d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:00, skipping insertion in model container [2020-07-10 14:41:00,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:40:59" (1/1) ... [2020-07-10 14:41:00,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:41:00,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:41:00,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:41:00,252 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:41:00,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:41:00,416 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:41:00,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:00 WrapperNode [2020-07-10 14:41:00,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:41:00,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:41:00,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:41:00,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:41:00,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:00" (1/1) ... [2020-07-10 14:41:00,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:00" (1/1) ... [2020-07-10 14:41:00,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:00" (1/1) ... [2020-07-10 14:41:00,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:00" (1/1) ... [2020-07-10 14:41:00,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:00" (1/1) ... [2020-07-10 14:41:00,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:00" (1/1) ... [2020-07-10 14:41:00,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:00" (1/1) ... [2020-07-10 14:41:00,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:41:00,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:41:00,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:41:00,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:41:00,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:41:00,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:41:00,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:41:00,566 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-10 14:41:00,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-10 14:41:00,567 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2020-07-10 14:41:00,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2020-07-10 14:41:00,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:41:00,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:41:00,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-10 14:41:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-10 14:41:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-10 14:41:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:41:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:41:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:41:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:41:00,568 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2020-07-10 14:41:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2020-07-10 14:41:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:41:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:41:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:41:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:41:00,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:41:01,099 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:41:01,099 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 14:41:01,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:41:01 BoogieIcfgContainer [2020-07-10 14:41:01,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:41:01,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:41:01,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:41:01,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:41:01,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:40:59" (1/3) ... [2020-07-10 14:41:01,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2a25d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:41:01, skipping insertion in model container [2020-07-10 14:41:01,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:41:00" (2/3) ... [2020-07-10 14:41:01,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2a25d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:41:01, skipping insertion in model container [2020-07-10 14:41:01,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:41:01" (3/3) ... [2020-07-10 14:41:01,113 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2020-07-10 14:41:01,124 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:41:01,133 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:41:01,148 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:41:01,170 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:41:01,170 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:41:01,170 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:41:01,171 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:41:01,171 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:41:01,171 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:41:01,171 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:41:01,171 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:41:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-10 14:41:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 14:41:01,197 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:01,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:41:01,199 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:01,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:01,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1786760399, now seen corresponding path program 1 times [2020-07-10 14:41:01,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:01,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500664640] [2020-07-10 14:41:01,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:01,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {47#true} is VALID [2020-07-10 14:41:01,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 14:41:01,551 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #96#return; {47#true} is VALID [2020-07-10 14:41:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:01,653 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {47#true} is VALID [2020-07-10 14:41:01,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:41:01,655 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {48#false} is VALID [2020-07-10 14:41:01,656 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:01,656 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#false} {47#true} #100#return; {48#false} is VALID [2020-07-10 14:41:01,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {47#true} is VALID [2020-07-10 14:41:01,659 INFO L263 TraceCheckUtils]: 1: Hoare triple {47#true} call #t~ret4 := __fpclassify_double(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:01,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {47#true} is VALID [2020-07-10 14:41:01,661 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:41:01,662 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {48#false} is VALID [2020-07-10 14:41:01,662 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:01,662 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {48#false} {47#true} #100#return; {48#false} is VALID [2020-07-10 14:41:01,663 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {48#false} is VALID [2020-07-10 14:41:01,663 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {48#false} is VALID [2020-07-10 14:41:01,664 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:01,664 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#false} {47#true} #92#return; {48#false} is VALID [2020-07-10 14:41:01,668 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {63#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:41:01,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {63#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {47#true} is VALID [2020-07-10 14:41:01,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 14:41:01,670 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #96#return; {47#true} is VALID [2020-07-10 14:41:01,670 INFO L263 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret12 := main(); {47#true} is VALID [2020-07-10 14:41:01,671 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~x~0 := 0.0;~y~0 := ~someUnaryDOUBLEoperation(0.0); {47#true} is VALID [2020-07-10 14:41:01,673 INFO L263 TraceCheckUtils]: 6: Hoare triple {47#true} call #t~ret9 := fmin_double(~x~0, ~y~0); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:01,674 INFO L280 TraceCheckUtils]: 7: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {47#true} is VALID [2020-07-10 14:41:01,676 INFO L263 TraceCheckUtils]: 8: Hoare triple {47#true} call #t~ret4 := __fpclassify_double(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:01,677 INFO L280 TraceCheckUtils]: 9: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {47#true} is VALID [2020-07-10 14:41:01,678 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:41:01,678 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {48#false} is VALID [2020-07-10 14:41:01,679 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:01,679 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {48#false} {47#true} #100#return; {48#false} is VALID [2020-07-10 14:41:01,680 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {48#false} is VALID [2020-07-10 14:41:01,680 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {48#false} is VALID [2020-07-10 14:41:01,681 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:41:01,681 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {48#false} {47#true} #92#return; {48#false} is VALID [2020-07-10 14:41:01,681 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#false} ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); {48#false} is VALID [2020-07-10 14:41:01,682 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !#t~short11; {48#false} is VALID [2020-07-10 14:41:01,682 INFO L280 TraceCheckUtils]: 20: Hoare triple {48#false} assume !#t~short11;havoc #t~short11;havoc #t~ret10; {48#false} is VALID [2020-07-10 14:41:01,682 INFO L280 TraceCheckUtils]: 21: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-10 14:41:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:41:01,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500664640] [2020-07-10 14:41:01,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:01,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:41:01,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549353363] [2020-07-10 14:41:01,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 14:41:01,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:01,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:41:01,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:41:01,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:41:01,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:01,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:41:01,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:41:01,764 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-07-10 14:41:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:02,275 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2020-07-10 14:41:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:41:02,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 14:41:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:41:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-10 14:41:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:41:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-10 14:41:02,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2020-07-10 14:41:02,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:41:02,493 INFO L225 Difference]: With dead ends: 79 [2020-07-10 14:41:02,494 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 14:41:02,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:41:02,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 14:41:02,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-10 14:41:02,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:02,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:02,570 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:02,571 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:02,577 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:41:02,577 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:02,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:02,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:02,578 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:02,578 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:41:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:02,584 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:41:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:02,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:02,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:02,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:02,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:41:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:41:02,591 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2020-07-10 14:41:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:02,591 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:41:02,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:41:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:41:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 14:41:02,593 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:02,593 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:41:02,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:41:02,594 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:02,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:02,595 INFO L82 PathProgramCache]: Analyzing trace with hash -952976765, now seen corresponding path program 1 times [2020-07-10 14:41:02,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:02,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332404013] [2020-07-10 14:41:02,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:02,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {306#true} is VALID [2020-07-10 14:41:02,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-10 14:41:02,680 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {306#true} {306#true} #96#return; {306#true} is VALID [2020-07-10 14:41:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:02,827 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {306#true} is VALID [2020-07-10 14:41:02,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {306#true} is VALID [2020-07-10 14:41:02,828 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:41:02,829 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:02,831 INFO L280 TraceCheckUtils]: 4: Hoare triple {332#(<= 2 |__fpclassify_double_#res|)} assume true; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:02,832 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {332#(<= 2 |__fpclassify_double_#res|)} {306#true} #100#return; {331#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:02,832 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {306#true} is VALID [2020-07-10 14:41:02,834 INFO L263 TraceCheckUtils]: 1: Hoare triple {306#true} call #t~ret4 := __fpclassify_double(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:02,835 INFO L280 TraceCheckUtils]: 2: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {306#true} is VALID [2020-07-10 14:41:02,835 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {306#true} is VALID [2020-07-10 14:41:02,835 INFO L280 TraceCheckUtils]: 4: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:41:02,836 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:02,838 INFO L280 TraceCheckUtils]: 6: Hoare triple {332#(<= 2 |__fpclassify_double_#res|)} assume true; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:02,839 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {332#(<= 2 |__fpclassify_double_#res|)} {306#true} #100#return; {331#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:02,841 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {331#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:02,842 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {307#false} is VALID [2020-07-10 14:41:02,843 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-10 14:41:02,843 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {307#false} {306#true} #92#return; {307#false} is VALID [2020-07-10 14:41:02,844 INFO L263 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:41:02,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {306#true} is VALID [2020-07-10 14:41:02,845 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-10 14:41:02,845 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #96#return; {306#true} is VALID [2020-07-10 14:41:02,846 INFO L263 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret12 := main(); {306#true} is VALID [2020-07-10 14:41:02,846 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} ~x~0 := 0.0;~y~0 := ~someUnaryDOUBLEoperation(0.0); {306#true} is VALID [2020-07-10 14:41:02,848 INFO L263 TraceCheckUtils]: 6: Hoare triple {306#true} call #t~ret9 := fmin_double(~x~0, ~y~0); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:02,848 INFO L280 TraceCheckUtils]: 7: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {306#true} is VALID [2020-07-10 14:41:02,850 INFO L263 TraceCheckUtils]: 8: Hoare triple {306#true} call #t~ret4 := __fpclassify_double(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:02,851 INFO L280 TraceCheckUtils]: 9: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {306#true} is VALID [2020-07-10 14:41:02,851 INFO L280 TraceCheckUtils]: 10: Hoare triple {306#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {306#true} is VALID [2020-07-10 14:41:02,851 INFO L280 TraceCheckUtils]: 11: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:41:02,852 INFO L280 TraceCheckUtils]: 12: Hoare triple {306#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:02,854 INFO L280 TraceCheckUtils]: 13: Hoare triple {332#(<= 2 |__fpclassify_double_#res|)} assume true; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:02,855 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {332#(<= 2 |__fpclassify_double_#res|)} {306#true} #100#return; {331#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:02,857 INFO L280 TraceCheckUtils]: 15: Hoare triple {331#(<= 2 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {331#(<= 2 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:02,858 INFO L280 TraceCheckUtils]: 16: Hoare triple {331#(<= 2 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {307#false} is VALID [2020-07-10 14:41:02,859 INFO L280 TraceCheckUtils]: 17: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-10 14:41:02,859 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {307#false} {306#true} #92#return; {307#false} is VALID [2020-07-10 14:41:02,860 INFO L280 TraceCheckUtils]: 19: Hoare triple {307#false} ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); {307#false} is VALID [2020-07-10 14:41:02,860 INFO L280 TraceCheckUtils]: 20: Hoare triple {307#false} assume !#t~short11; {307#false} is VALID [2020-07-10 14:41:02,860 INFO L280 TraceCheckUtils]: 21: Hoare triple {307#false} assume !#t~short11;havoc #t~short11;havoc #t~ret10; {307#false} is VALID [2020-07-10 14:41:02,861 INFO L280 TraceCheckUtils]: 22: Hoare triple {307#false} assume !false; {307#false} is VALID [2020-07-10 14:41:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:41:02,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332404013] [2020-07-10 14:41:02,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:02,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:41:02,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703482872] [2020-07-10 14:41:02,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:41:02,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:02,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:41:02,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:41:02,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:41:02,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:02,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:41:02,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:41:02,901 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-10 14:41:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:03,627 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-07-10 14:41:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:41:03,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:41:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:41:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:41:03,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-10 14:41:03,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:41:03,751 INFO L225 Difference]: With dead ends: 59 [2020-07-10 14:41:03,751 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 14:41:03,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:41:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 14:41:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-10 14:41:03,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:03,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:03,798 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:03,798 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:03,801 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:41:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:03,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:03,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:03,803 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:03,803 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:41:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:03,807 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:41:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:03,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:03,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:03,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:03,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:41:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 14:41:03,812 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2020-07-10 14:41:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:03,813 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 14:41:03,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:41:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:41:03,814 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:03,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:41:03,815 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:41:03,815 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:03,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1944362408, now seen corresponding path program 1 times [2020-07-10 14:41:03,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:03,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109234890] [2020-07-10 14:41:03,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:03,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {582#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {562#true} is VALID [2020-07-10 14:41:03,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-10 14:41:03,909 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {562#true} {562#true} #96#return; {562#true} is VALID [2020-07-10 14:41:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:41:04,088 INFO L280 TraceCheckUtils]: 0: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {562#true} is VALID [2020-07-10 14:41:04,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {562#true} is VALID [2020-07-10 14:41:04,089 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:41:04,089 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {562#true} is VALID [2020-07-10 14:41:04,089 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {562#true} is VALID [2020-07-10 14:41:04,090 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {562#true} is VALID [2020-07-10 14:41:04,091 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:04,092 INFO L280 TraceCheckUtils]: 7: Hoare triple {594#(<= 1 |__fpclassify_double_#res|)} assume true; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:04,093 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {594#(<= 1 |__fpclassify_double_#res|)} {562#true} #100#return; {593#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:04,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {562#true} is VALID [2020-07-10 14:41:04,095 INFO L263 TraceCheckUtils]: 1: Hoare triple {562#true} call #t~ret4 := __fpclassify_double(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:04,096 INFO L280 TraceCheckUtils]: 2: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {562#true} is VALID [2020-07-10 14:41:04,096 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {562#true} is VALID [2020-07-10 14:41:04,096 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:41:04,097 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {562#true} is VALID [2020-07-10 14:41:04,097 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {562#true} is VALID [2020-07-10 14:41:04,097 INFO L280 TraceCheckUtils]: 7: Hoare triple {562#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {562#true} is VALID [2020-07-10 14:41:04,099 INFO L280 TraceCheckUtils]: 8: Hoare triple {562#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:04,100 INFO L280 TraceCheckUtils]: 9: Hoare triple {594#(<= 1 |__fpclassify_double_#res|)} assume true; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:04,101 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {594#(<= 1 |__fpclassify_double_#res|)} {562#true} #100#return; {593#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:04,102 INFO L280 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {593#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:04,103 INFO L280 TraceCheckUtils]: 12: Hoare triple {593#(<= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {563#false} is VALID [2020-07-10 14:41:04,104 INFO L280 TraceCheckUtils]: 13: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-10 14:41:04,104 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {563#false} {562#true} #92#return; {563#false} is VALID [2020-07-10 14:41:04,106 INFO L263 TraceCheckUtils]: 0: Hoare triple {562#true} call ULTIMATE.init(); {582#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 14:41:04,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {582#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {562#true} is VALID [2020-07-10 14:41:04,107 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-10 14:41:04,107 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {562#true} {562#true} #96#return; {562#true} is VALID [2020-07-10 14:41:04,107 INFO L263 TraceCheckUtils]: 4: Hoare triple {562#true} call #t~ret12 := main(); {562#true} is VALID [2020-07-10 14:41:04,107 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} ~x~0 := 0.0;~y~0 := ~someUnaryDOUBLEoperation(0.0); {562#true} is VALID [2020-07-10 14:41:04,109 INFO L263 TraceCheckUtils]: 6: Hoare triple {562#true} call #t~ret9 := fmin_double(~x~0, ~y~0); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:04,109 INFO L280 TraceCheckUtils]: 7: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {562#true} is VALID [2020-07-10 14:41:04,111 INFO L263 TraceCheckUtils]: 8: Hoare triple {562#true} call #t~ret4 := __fpclassify_double(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:41:04,112 INFO L280 TraceCheckUtils]: 9: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {562#true} is VALID [2020-07-10 14:41:04,112 INFO L280 TraceCheckUtils]: 10: Hoare triple {562#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {562#true} is VALID [2020-07-10 14:41:04,112 INFO L280 TraceCheckUtils]: 11: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:41:04,113 INFO L280 TraceCheckUtils]: 12: Hoare triple {562#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {562#true} is VALID [2020-07-10 14:41:04,113 INFO L280 TraceCheckUtils]: 13: Hoare triple {562#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {562#true} is VALID [2020-07-10 14:41:04,113 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {562#true} is VALID [2020-07-10 14:41:04,114 INFO L280 TraceCheckUtils]: 15: Hoare triple {562#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:04,115 INFO L280 TraceCheckUtils]: 16: Hoare triple {594#(<= 1 |__fpclassify_double_#res|)} assume true; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 14:41:04,117 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {594#(<= 1 |__fpclassify_double_#res|)} {562#true} #100#return; {593#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:04,119 INFO L280 TraceCheckUtils]: 18: Hoare triple {593#(<= 1 |fmin_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {593#(<= 1 |fmin_double_#t~ret4|)} is VALID [2020-07-10 14:41:04,120 INFO L280 TraceCheckUtils]: 19: Hoare triple {593#(<= 1 |fmin_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {563#false} is VALID [2020-07-10 14:41:04,121 INFO L280 TraceCheckUtils]: 20: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-10 14:41:04,121 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {563#false} {562#true} #92#return; {563#false} is VALID [2020-07-10 14:41:04,121 INFO L280 TraceCheckUtils]: 22: Hoare triple {563#false} ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); {563#false} is VALID [2020-07-10 14:41:04,122 INFO L280 TraceCheckUtils]: 23: Hoare triple {563#false} assume !#t~short11; {563#false} is VALID [2020-07-10 14:41:04,122 INFO L280 TraceCheckUtils]: 24: Hoare triple {563#false} assume !#t~short11;havoc #t~short11;havoc #t~ret10; {563#false} is VALID [2020-07-10 14:41:04,122 INFO L280 TraceCheckUtils]: 25: Hoare triple {563#false} assume !false; {563#false} is VALID [2020-07-10 14:41:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:41:04,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109234890] [2020-07-10 14:41:04,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:41:04,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:41:04,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658644129] [2020-07-10 14:41:04,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 14:41:04,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:41:04,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:41:04,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:41:04,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:41:04,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:41:04,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:41:04,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:41:04,175 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2020-07-10 14:41:04,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:04,774 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2020-07-10 14:41:04,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:41:04,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 14:41:04,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:41:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:41:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:41:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:41:04,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-10 14:41:04,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:41:04,891 INFO L225 Difference]: With dead ends: 63 [2020-07-10 14:41:04,891 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 14:41:04,892 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:41:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 14:41:04,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2020-07-10 14:41:04,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:41:04,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2020-07-10 14:41:04,937 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2020-07-10 14:41:04,937 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2020-07-10 14:41:04,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:04,942 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:41:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 14:41:04,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:04,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:04,943 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2020-07-10 14:41:04,944 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2020-07-10 14:41:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:41:04,948 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:41:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 14:41:04,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:41:04,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:41:04,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:41:04,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:41:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:41:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 14:41:04,953 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2020-07-10 14:41:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:41:04,953 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 14:41:04,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:41:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:41:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:41:04,955 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:41:04,955 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:41:04,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:41:04,955 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:41:04,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:41:04,956 INFO L82 PathProgramCache]: Analyzing trace with hash 553653529, now seen corresponding path program 1 times [2020-07-10 14:41:04,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:41:04,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917384629] [2020-07-10 14:41:04,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:41:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:41:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:41:05,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:41:05,146 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:407) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:390) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 14:41:05,156 INFO L168 Benchmark]: Toolchain (without parser) took 5145.51 ms. Allocated memory was 137.9 MB in the beginning and 288.9 MB in the end (delta: 151.0 MB). Free memory was 102.7 MB in the beginning and 251.0 MB in the end (delta: -148.3 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:05,158 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 14:41:05,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.89 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 178.8 MB in the end (delta: -76.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:05,167 INFO L168 Benchmark]: Boogie Preprocessor took 74.13 ms. Allocated memory is still 201.9 MB. Free memory was 178.8 MB in the beginning and 176.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:05,168 INFO L168 Benchmark]: RCFGBuilder took 607.43 ms. Allocated memory is still 201.9 MB. Free memory was 176.8 MB in the beginning and 144.4 MB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:41:05,174 INFO L168 Benchmark]: TraceAbstraction took 4046.57 ms. Allocated memory was 201.9 MB in the beginning and 288.9 MB in the end (delta: 87.0 MB). Free memory was 143.7 MB in the beginning and 251.0 MB in the end (delta: -107.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 14:41:05,182 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 406.89 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 178.8 MB in the end (delta: -76.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.13 ms. Allocated memory is still 201.9 MB. Free memory was 178.8 MB in the beginning and 176.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 607.43 ms. Allocated memory is still 201.9 MB. Free memory was 176.8 MB in the beginning and 144.4 MB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4046.57 ms. Allocated memory was 201.9 MB in the beginning and 288.9 MB in the end (delta: 87.0 MB). Free memory was 143.7 MB in the beginning and 251.0 MB in the end (delta: -107.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...