/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:35:11,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:35:11,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:35:11,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:35:11,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:35:11,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:35:11,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:35:11,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:35:11,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:35:11,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:35:11,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:35:11,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:35:11,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:35:11,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:35:11,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:35:11,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:35:11,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:35:11,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:35:11,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:35:11,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:35:11,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:35:11,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:35:11,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:35:11,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:35:11,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:35:11,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:35:11,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:35:11,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:35:11,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:35:11,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:35:11,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:35:11,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:35:11,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:35:11,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:35:11,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:35:11,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:35:11,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:35:11,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:35:11,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:35:11,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:35:11,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:35:11,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:35:11,794 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:35:11,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:35:11,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:35:11,796 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:35:11,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:35:11,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:35:11,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:35:11,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:35:11,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:35:11,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:35:11,797 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:35:11,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:35:11,798 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:35:11,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:35:11,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:35:11,800 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:35:11,800 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:35:11,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:35:11,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:35:11,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:35:11,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:35:11,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:35:11,802 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:35:12,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:35:12,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:35:12,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:35:12,101 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:35:12,101 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:35:12,102 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252b.c [2020-07-10 18:35:12,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9bde338/1fd746f9f0f143b9a7ada21b65733326/FLAG48550e5c7 [2020-07-10 18:35:12,616 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:35:12,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1252b.c [2020-07-10 18:35:12,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9bde338/1fd746f9f0f143b9a7ada21b65733326/FLAG48550e5c7 [2020-07-10 18:35:12,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9bde338/1fd746f9f0f143b9a7ada21b65733326 [2020-07-10 18:35:13,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:35:13,006 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:35:13,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:35:13,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:35:13,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:35:13,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:35:12" (1/1) ... [2020-07-10 18:35:13,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f860e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:13, skipping insertion in model container [2020-07-10 18:35:13,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:35:12" (1/1) ... [2020-07-10 18:35:13,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:35:13,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:35:13,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:35:13,295 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:35:13,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:35:13,443 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:35:13,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:13 WrapperNode [2020-07-10 18:35:13,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:35:13,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:35:13,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:35:13,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:35:13,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:13" (1/1) ... [2020-07-10 18:35:13,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:13" (1/1) ... [2020-07-10 18:35:13,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:13" (1/1) ... [2020-07-10 18:35:13,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:13" (1/1) ... [2020-07-10 18:35:13,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:13" (1/1) ... [2020-07-10 18:35:13,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:13" (1/1) ... [2020-07-10 18:35:13,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:13" (1/1) ... [2020-07-10 18:35:13,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:35:13,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:35:13,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:35:13,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:35:13,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:13" (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 18:35:13,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:35:13,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:35:13,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-10 18:35:13,563 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2020-07-10 18:35:13,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2020-07-10 18:35:13,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:35:13,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:35:13,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-10 18:35:13,563 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-10 18:35:13,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 18:35:13,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 18:35:13,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 18:35:13,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 18:35:13,564 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2020-07-10 18:35:13,564 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2020-07-10 18:35:13,564 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:35:13,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:35:13,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:35:13,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 18:35:13,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 18:35:14,120 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:35:14,121 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 18:35:14,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:35:14 BoogieIcfgContainer [2020-07-10 18:35:14,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:35:14,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:35:14,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:35:14,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:35:14,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:35:12" (1/3) ... [2020-07-10 18:35:14,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdadf3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:35:14, skipping insertion in model container [2020-07-10 18:35:14,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:35:13" (2/3) ... [2020-07-10 18:35:14,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cdadf3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:35:14, skipping insertion in model container [2020-07-10 18:35:14,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:35:14" (3/3) ... [2020-07-10 18:35:14,135 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252b.c [2020-07-10 18:35:14,146 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:35:14,154 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:35:14,169 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:35:14,191 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:35:14,191 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:35:14,191 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:35:14,192 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:35:14,192 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:35:14,192 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:35:14,192 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:35:14,193 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:35:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2020-07-10 18:35:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 18:35:14,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:14,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:35:14,225 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:14,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1930633076, now seen corresponding path program 1 times [2020-07-10 18:35:14,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:14,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1352617078] [2020-07-10 18:35:14,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:14,467 INFO L280 TraceCheckUtils]: 0: Hoare triple {122#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {98#true} is VALID [2020-07-10 18:35:14,468 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} #valid := #valid[0 := 0]; {98#true} is VALID [2020-07-10 18:35:14,468 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume 0 < #StackHeapBarrier; {98#true} is VALID [2020-07-10 18:35:14,469 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-10 18:35:14,470 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {98#true} {98#true} #149#return; {98#true} is VALID [2020-07-10 18:35:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:14,517 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-10 18:35:14,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} havoc ~msw~0; {98#true} is VALID [2020-07-10 18:35:14,518 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} havoc ~lsw~0; {98#true} is VALID [2020-07-10 18:35:14,519 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume !true; {99#false} is VALID [2020-07-10 18:35:14,520 INFO L280 TraceCheckUtils]: 4: Hoare triple {99#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {99#false} is VALID [2020-07-10 18:35:14,520 INFO L280 TraceCheckUtils]: 5: Hoare triple {99#false} #res := 2; {99#false} is VALID [2020-07-10 18:35:14,520 INFO L280 TraceCheckUtils]: 6: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-10 18:35:14,521 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {99#false} {98#true} #145#return; {99#false} is VALID [2020-07-10 18:35:14,522 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-10 18:35:14,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} ~y := #in~y; {98#true} is VALID [2020-07-10 18:35:14,524 INFO L263 TraceCheckUtils]: 2: Hoare triple {98#true} call #t~ret4 := __fpclassify_double(~x); {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:14,524 INFO L280 TraceCheckUtils]: 3: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-10 18:35:14,525 INFO L280 TraceCheckUtils]: 4: Hoare triple {98#true} havoc ~msw~0; {98#true} is VALID [2020-07-10 18:35:14,525 INFO L280 TraceCheckUtils]: 5: Hoare triple {98#true} havoc ~lsw~0; {98#true} is VALID [2020-07-10 18:35:14,526 INFO L280 TraceCheckUtils]: 6: Hoare triple {98#true} assume !true; {99#false} is VALID [2020-07-10 18:35:14,526 INFO L280 TraceCheckUtils]: 7: Hoare triple {99#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {99#false} is VALID [2020-07-10 18:35:14,527 INFO L280 TraceCheckUtils]: 8: Hoare triple {99#false} #res := 2; {99#false} is VALID [2020-07-10 18:35:14,527 INFO L280 TraceCheckUtils]: 9: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-10 18:35:14,528 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {99#false} {98#true} #145#return; {99#false} is VALID [2020-07-10 18:35:14,528 INFO L280 TraceCheckUtils]: 11: Hoare triple {99#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {99#false} is VALID [2020-07-10 18:35:14,528 INFO L280 TraceCheckUtils]: 12: Hoare triple {99#false} assume 0 == #t~ret4; {99#false} is VALID [2020-07-10 18:35:14,529 INFO L280 TraceCheckUtils]: 13: Hoare triple {99#false} havoc #t~ret4; {99#false} is VALID [2020-07-10 18:35:14,529 INFO L280 TraceCheckUtils]: 14: Hoare triple {99#false} #res := ~y; {99#false} is VALID [2020-07-10 18:35:14,529 INFO L280 TraceCheckUtils]: 15: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-10 18:35:14,530 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {99#false} {98#true} #141#return; {99#false} is VALID [2020-07-10 18:35:14,533 INFO L263 TraceCheckUtils]: 0: Hoare triple {98#true} call ULTIMATE.init(); {122#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:14,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {122#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {98#true} is VALID [2020-07-10 18:35:14,534 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} #valid := #valid[0 := 0]; {98#true} is VALID [2020-07-10 18:35:14,534 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#true} assume 0 < #StackHeapBarrier; {98#true} is VALID [2020-07-10 18:35:14,535 INFO L280 TraceCheckUtils]: 4: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-10 18:35:14,535 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {98#true} {98#true} #149#return; {98#true} is VALID [2020-07-10 18:35:14,535 INFO L263 TraceCheckUtils]: 6: Hoare triple {98#true} call #t~ret12 := main(); {98#true} is VALID [2020-07-10 18:35:14,536 INFO L280 TraceCheckUtils]: 7: Hoare triple {98#true} ~x~0 := 0.0; {98#true} is VALID [2020-07-10 18:35:14,536 INFO L280 TraceCheckUtils]: 8: Hoare triple {98#true} ~y~0 := ~someUnaryDOUBLEoperation(0.0); {98#true} is VALID [2020-07-10 18:35:14,538 INFO L263 TraceCheckUtils]: 9: Hoare triple {98#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:14,539 INFO L280 TraceCheckUtils]: 10: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-10 18:35:14,539 INFO L280 TraceCheckUtils]: 11: Hoare triple {98#true} ~y := #in~y; {98#true} is VALID [2020-07-10 18:35:14,541 INFO L263 TraceCheckUtils]: 12: Hoare triple {98#true} call #t~ret4 := __fpclassify_double(~x); {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:14,541 INFO L280 TraceCheckUtils]: 13: Hoare triple {123#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {98#true} is VALID [2020-07-10 18:35:14,541 INFO L280 TraceCheckUtils]: 14: Hoare triple {98#true} havoc ~msw~0; {98#true} is VALID [2020-07-10 18:35:14,542 INFO L280 TraceCheckUtils]: 15: Hoare triple {98#true} havoc ~lsw~0; {98#true} is VALID [2020-07-10 18:35:14,543 INFO L280 TraceCheckUtils]: 16: Hoare triple {98#true} assume !true; {99#false} is VALID [2020-07-10 18:35:14,543 INFO L280 TraceCheckUtils]: 17: Hoare triple {99#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {99#false} is VALID [2020-07-10 18:35:14,543 INFO L280 TraceCheckUtils]: 18: Hoare triple {99#false} #res := 2; {99#false} is VALID [2020-07-10 18:35:14,544 INFO L280 TraceCheckUtils]: 19: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-10 18:35:14,544 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {99#false} {98#true} #145#return; {99#false} is VALID [2020-07-10 18:35:14,544 INFO L280 TraceCheckUtils]: 21: Hoare triple {99#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {99#false} is VALID [2020-07-10 18:35:14,545 INFO L280 TraceCheckUtils]: 22: Hoare triple {99#false} assume 0 == #t~ret4; {99#false} is VALID [2020-07-10 18:35:14,545 INFO L280 TraceCheckUtils]: 23: Hoare triple {99#false} havoc #t~ret4; {99#false} is VALID [2020-07-10 18:35:14,545 INFO L280 TraceCheckUtils]: 24: Hoare triple {99#false} #res := ~y; {99#false} is VALID [2020-07-10 18:35:14,546 INFO L280 TraceCheckUtils]: 25: Hoare triple {99#false} assume true; {99#false} is VALID [2020-07-10 18:35:14,546 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {99#false} {98#true} #141#return; {99#false} is VALID [2020-07-10 18:35:14,546 INFO L280 TraceCheckUtils]: 27: Hoare triple {99#false} ~res~0 := #t~ret9; {99#false} is VALID [2020-07-10 18:35:14,547 INFO L280 TraceCheckUtils]: 28: Hoare triple {99#false} havoc #t~ret9; {99#false} is VALID [2020-07-10 18:35:14,547 INFO L280 TraceCheckUtils]: 29: Hoare triple {99#false} #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {99#false} is VALID [2020-07-10 18:35:14,547 INFO L280 TraceCheckUtils]: 30: Hoare triple {99#false} assume !#t~short11; {99#false} is VALID [2020-07-10 18:35:14,548 INFO L280 TraceCheckUtils]: 31: Hoare triple {99#false} assume !#t~short11; {99#false} is VALID [2020-07-10 18:35:14,548 INFO L280 TraceCheckUtils]: 32: Hoare triple {99#false} havoc #t~ret10; {99#false} is VALID [2020-07-10 18:35:14,549 INFO L280 TraceCheckUtils]: 33: Hoare triple {99#false} havoc #t~short11; {99#false} is VALID [2020-07-10 18:35:14,549 INFO L280 TraceCheckUtils]: 34: Hoare triple {99#false} assume !false; {99#false} is VALID [2020-07-10 18:35:14,553 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 18:35:14,554 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:14,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1352617078] [2020-07-10 18:35:14,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:14,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 18:35:14,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270731529] [2020-07-10 18:35:14,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-07-10 18:35:14,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:14,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 18:35:14,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:14,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 18:35:14,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 18:35:14,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 18:35:14,653 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 4 states. [2020-07-10 18:35:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:15,411 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2020-07-10 18:35:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 18:35:15,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-07-10 18:35:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:35:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2020-07-10 18:35:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 18:35:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2020-07-10 18:35:15,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2020-07-10 18:35:15,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:15,716 INFO L225 Difference]: With dead ends: 176 [2020-07-10 18:35:15,717 INFO L226 Difference]: Without dead ends: 87 [2020-07-10 18:35:15,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 18:35:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-10 18:35:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-07-10 18:35:15,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:15,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 87 states. [2020-07-10 18:35:15,852 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2020-07-10 18:35:15,852 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2020-07-10 18:35:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:15,861 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-10 18:35:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-07-10 18:35:15,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:15,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:15,863 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2020-07-10 18:35:15,863 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2020-07-10 18:35:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:15,870 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2020-07-10 18:35:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-07-10 18:35:15,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:15,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:15,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:15,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-10 18:35:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2020-07-10 18:35:15,879 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 35 [2020-07-10 18:35:15,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:15,880 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2020-07-10 18:35:15,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 18:35:15,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 87 states and 95 transitions. [2020-07-10 18:35:15,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2020-07-10 18:35:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 18:35:15,994 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:15,995 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, 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 18:35:15,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:35:15,995 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash -330335414, now seen corresponding path program 1 times [2020-07-10 18:35:15,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:15,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [242328673] [2020-07-10 18:35:15,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:16,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {875#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {837#true} is VALID [2020-07-10 18:35:16,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} #valid := #valid[0 := 0]; {837#true} is VALID [2020-07-10 18:35:16,139 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} assume 0 < #StackHeapBarrier; {837#true} is VALID [2020-07-10 18:35:16,139 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 18:35:16,140 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {837#true} {837#true} #149#return; {837#true} is VALID [2020-07-10 18:35:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:16,248 INFO L280 TraceCheckUtils]: 0: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-10 18:35:16,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} havoc ~msw~0; {837#true} is VALID [2020-07-10 18:35:16,249 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} havoc ~lsw~0; {837#true} is VALID [2020-07-10 18:35:16,249 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {837#true} is VALID [2020-07-10 18:35:16,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {837#true} is VALID [2020-07-10 18:35:16,250 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {837#true} is VALID [2020-07-10 18:35:16,250 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#true} ~msw~0 := #t~mem0; {837#true} is VALID [2020-07-10 18:35:16,251 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {837#true} is VALID [2020-07-10 18:35:16,251 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#true} havoc #t~union1; {837#true} is VALID [2020-07-10 18:35:16,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {837#true} havoc #t~mem0; {837#true} is VALID [2020-07-10 18:35:16,252 INFO L280 TraceCheckUtils]: 10: Hoare triple {837#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {837#true} is VALID [2020-07-10 18:35:16,252 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} ~lsw~0 := #t~mem2; {837#true} is VALID [2020-07-10 18:35:16,252 INFO L280 TraceCheckUtils]: 12: Hoare triple {837#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {837#true} is VALID [2020-07-10 18:35:16,252 INFO L280 TraceCheckUtils]: 13: Hoare triple {837#true} havoc #t~mem2; {837#true} is VALID [2020-07-10 18:35:16,253 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} havoc #t~union3; {837#true} is VALID [2020-07-10 18:35:16,253 INFO L280 TraceCheckUtils]: 15: Hoare triple {837#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {837#true} is VALID [2020-07-10 18:35:16,253 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {837#true} is VALID [2020-07-10 18:35:16,253 INFO L280 TraceCheckUtils]: 17: Hoare triple {837#true} goto; {837#true} is VALID [2020-07-10 18:35:16,253 INFO L280 TraceCheckUtils]: 18: Hoare triple {837#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {837#true} is VALID [2020-07-10 18:35:16,257 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} #res := 2; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:16,257 INFO L280 TraceCheckUtils]: 20: Hoare triple {900#(<= 2 |__fpclassify_double_#res|)} assume true; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:16,258 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {900#(<= 2 |__fpclassify_double_#res|)} {837#true} #145#return; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:16,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-10 18:35:16,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {837#true} ~y := #in~y; {837#true} is VALID [2020-07-10 18:35:16,260 INFO L263 TraceCheckUtils]: 2: Hoare triple {837#true} call #t~ret4 := __fpclassify_double(~x); {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:16,261 INFO L280 TraceCheckUtils]: 3: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-10 18:35:16,261 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#true} havoc ~msw~0; {837#true} is VALID [2020-07-10 18:35:16,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {837#true} havoc ~lsw~0; {837#true} is VALID [2020-07-10 18:35:16,262 INFO L280 TraceCheckUtils]: 6: Hoare triple {837#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {837#true} is VALID [2020-07-10 18:35:16,262 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {837#true} is VALID [2020-07-10 18:35:16,262 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {837#true} is VALID [2020-07-10 18:35:16,263 INFO L280 TraceCheckUtils]: 9: Hoare triple {837#true} ~msw~0 := #t~mem0; {837#true} is VALID [2020-07-10 18:35:16,263 INFO L280 TraceCheckUtils]: 10: Hoare triple {837#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {837#true} is VALID [2020-07-10 18:35:16,263 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} havoc #t~union1; {837#true} is VALID [2020-07-10 18:35:16,264 INFO L280 TraceCheckUtils]: 12: Hoare triple {837#true} havoc #t~mem0; {837#true} is VALID [2020-07-10 18:35:16,264 INFO L280 TraceCheckUtils]: 13: Hoare triple {837#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {837#true} is VALID [2020-07-10 18:35:16,264 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} ~lsw~0 := #t~mem2; {837#true} is VALID [2020-07-10 18:35:16,264 INFO L280 TraceCheckUtils]: 15: Hoare triple {837#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {837#true} is VALID [2020-07-10 18:35:16,265 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} havoc #t~mem2; {837#true} is VALID [2020-07-10 18:35:16,265 INFO L280 TraceCheckUtils]: 17: Hoare triple {837#true} havoc #t~union3; {837#true} is VALID [2020-07-10 18:35:16,265 INFO L280 TraceCheckUtils]: 18: Hoare triple {837#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {837#true} is VALID [2020-07-10 18:35:16,266 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {837#true} is VALID [2020-07-10 18:35:16,266 INFO L280 TraceCheckUtils]: 20: Hoare triple {837#true} goto; {837#true} is VALID [2020-07-10 18:35:16,266 INFO L280 TraceCheckUtils]: 21: Hoare triple {837#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {837#true} is VALID [2020-07-10 18:35:16,267 INFO L280 TraceCheckUtils]: 22: Hoare triple {837#true} #res := 2; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:16,269 INFO L280 TraceCheckUtils]: 23: Hoare triple {900#(<= 2 |__fpclassify_double_#res|)} assume true; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:16,272 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {900#(<= 2 |__fpclassify_double_#res|)} {837#true} #145#return; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:16,273 INFO L280 TraceCheckUtils]: 25: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:16,274 INFO L280 TraceCheckUtils]: 26: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {838#false} is VALID [2020-07-10 18:35:16,275 INFO L280 TraceCheckUtils]: 27: Hoare triple {838#false} havoc #t~ret4; {838#false} is VALID [2020-07-10 18:35:16,275 INFO L280 TraceCheckUtils]: 28: Hoare triple {838#false} #res := ~y; {838#false} is VALID [2020-07-10 18:35:16,275 INFO L280 TraceCheckUtils]: 29: Hoare triple {838#false} assume true; {838#false} is VALID [2020-07-10 18:35:16,276 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {838#false} {837#true} #141#return; {838#false} is VALID [2020-07-10 18:35:16,278 INFO L263 TraceCheckUtils]: 0: Hoare triple {837#true} call ULTIMATE.init(); {875#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:16,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {875#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {837#true} is VALID [2020-07-10 18:35:16,279 INFO L280 TraceCheckUtils]: 2: Hoare triple {837#true} #valid := #valid[0 := 0]; {837#true} is VALID [2020-07-10 18:35:16,279 INFO L280 TraceCheckUtils]: 3: Hoare triple {837#true} assume 0 < #StackHeapBarrier; {837#true} is VALID [2020-07-10 18:35:16,279 INFO L280 TraceCheckUtils]: 4: Hoare triple {837#true} assume true; {837#true} is VALID [2020-07-10 18:35:16,279 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {837#true} {837#true} #149#return; {837#true} is VALID [2020-07-10 18:35:16,280 INFO L263 TraceCheckUtils]: 6: Hoare triple {837#true} call #t~ret12 := main(); {837#true} is VALID [2020-07-10 18:35:16,280 INFO L280 TraceCheckUtils]: 7: Hoare triple {837#true} ~x~0 := 0.0; {837#true} is VALID [2020-07-10 18:35:16,280 INFO L280 TraceCheckUtils]: 8: Hoare triple {837#true} ~y~0 := ~someUnaryDOUBLEoperation(0.0); {837#true} is VALID [2020-07-10 18:35:16,282 INFO L263 TraceCheckUtils]: 9: Hoare triple {837#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:16,282 INFO L280 TraceCheckUtils]: 10: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-10 18:35:16,282 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#true} ~y := #in~y; {837#true} is VALID [2020-07-10 18:35:16,283 INFO L263 TraceCheckUtils]: 12: Hoare triple {837#true} call #t~ret4 := __fpclassify_double(~x); {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:16,284 INFO L280 TraceCheckUtils]: 13: Hoare triple {876#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {837#true} is VALID [2020-07-10 18:35:16,284 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#true} havoc ~msw~0; {837#true} is VALID [2020-07-10 18:35:16,284 INFO L280 TraceCheckUtils]: 15: Hoare triple {837#true} havoc ~lsw~0; {837#true} is VALID [2020-07-10 18:35:16,285 INFO L280 TraceCheckUtils]: 16: Hoare triple {837#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {837#true} is VALID [2020-07-10 18:35:16,285 INFO L280 TraceCheckUtils]: 17: Hoare triple {837#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {837#true} is VALID [2020-07-10 18:35:16,285 INFO L280 TraceCheckUtils]: 18: Hoare triple {837#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {837#true} is VALID [2020-07-10 18:35:16,286 INFO L280 TraceCheckUtils]: 19: Hoare triple {837#true} ~msw~0 := #t~mem0; {837#true} is VALID [2020-07-10 18:35:16,286 INFO L280 TraceCheckUtils]: 20: Hoare triple {837#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {837#true} is VALID [2020-07-10 18:35:16,286 INFO L280 TraceCheckUtils]: 21: Hoare triple {837#true} havoc #t~union1; {837#true} is VALID [2020-07-10 18:35:16,286 INFO L280 TraceCheckUtils]: 22: Hoare triple {837#true} havoc #t~mem0; {837#true} is VALID [2020-07-10 18:35:16,287 INFO L280 TraceCheckUtils]: 23: Hoare triple {837#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {837#true} is VALID [2020-07-10 18:35:16,287 INFO L280 TraceCheckUtils]: 24: Hoare triple {837#true} ~lsw~0 := #t~mem2; {837#true} is VALID [2020-07-10 18:35:16,287 INFO L280 TraceCheckUtils]: 25: Hoare triple {837#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {837#true} is VALID [2020-07-10 18:35:16,288 INFO L280 TraceCheckUtils]: 26: Hoare triple {837#true} havoc #t~mem2; {837#true} is VALID [2020-07-10 18:35:16,288 INFO L280 TraceCheckUtils]: 27: Hoare triple {837#true} havoc #t~union3; {837#true} is VALID [2020-07-10 18:35:16,288 INFO L280 TraceCheckUtils]: 28: Hoare triple {837#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {837#true} is VALID [2020-07-10 18:35:16,288 INFO L280 TraceCheckUtils]: 29: Hoare triple {837#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {837#true} is VALID [2020-07-10 18:35:16,289 INFO L280 TraceCheckUtils]: 30: Hoare triple {837#true} goto; {837#true} is VALID [2020-07-10 18:35:16,289 INFO L280 TraceCheckUtils]: 31: Hoare triple {837#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {837#true} is VALID [2020-07-10 18:35:16,291 INFO L280 TraceCheckUtils]: 32: Hoare triple {837#true} #res := 2; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:16,294 INFO L280 TraceCheckUtils]: 33: Hoare triple {900#(<= 2 |__fpclassify_double_#res|)} assume true; {900#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:16,295 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {900#(<= 2 |__fpclassify_double_#res|)} {837#true} #145#return; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:16,296 INFO L280 TraceCheckUtils]: 35: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {899#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-10 18:35:16,296 INFO L280 TraceCheckUtils]: 36: Hoare triple {899#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4; {838#false} is VALID [2020-07-10 18:35:16,297 INFO L280 TraceCheckUtils]: 37: Hoare triple {838#false} havoc #t~ret4; {838#false} is VALID [2020-07-10 18:35:16,297 INFO L280 TraceCheckUtils]: 38: Hoare triple {838#false} #res := ~y; {838#false} is VALID [2020-07-10 18:35:16,297 INFO L280 TraceCheckUtils]: 39: Hoare triple {838#false} assume true; {838#false} is VALID [2020-07-10 18:35:16,297 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {838#false} {837#true} #141#return; {838#false} is VALID [2020-07-10 18:35:16,298 INFO L280 TraceCheckUtils]: 41: Hoare triple {838#false} ~res~0 := #t~ret9; {838#false} is VALID [2020-07-10 18:35:16,298 INFO L280 TraceCheckUtils]: 42: Hoare triple {838#false} havoc #t~ret9; {838#false} is VALID [2020-07-10 18:35:16,298 INFO L280 TraceCheckUtils]: 43: Hoare triple {838#false} #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {838#false} is VALID [2020-07-10 18:35:16,299 INFO L280 TraceCheckUtils]: 44: Hoare triple {838#false} assume !#t~short11; {838#false} is VALID [2020-07-10 18:35:16,299 INFO L280 TraceCheckUtils]: 45: Hoare triple {838#false} assume !#t~short11; {838#false} is VALID [2020-07-10 18:35:16,299 INFO L280 TraceCheckUtils]: 46: Hoare triple {838#false} havoc #t~ret10; {838#false} is VALID [2020-07-10 18:35:16,299 INFO L280 TraceCheckUtils]: 47: Hoare triple {838#false} havoc #t~short11; {838#false} is VALID [2020-07-10 18:35:16,300 INFO L280 TraceCheckUtils]: 48: Hoare triple {838#false} assume !false; {838#false} is VALID [2020-07-10 18:35:16,303 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 18:35:16,303 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:16,303 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [242328673] [2020-07-10 18:35:16,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:16,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:35:16,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027445601] [2020-07-10 18:35:16,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-10 18:35:16,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:16,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:35:16,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:16,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:35:16,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:16,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:35:16,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:35:16,356 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 6 states. [2020-07-10 18:35:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:17,043 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2020-07-10 18:35:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:35:17,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-10 18:35:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-10 18:35:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-10 18:35:17,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 133 transitions. [2020-07-10 18:35:17,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:17,213 INFO L225 Difference]: With dead ends: 123 [2020-07-10 18:35:17,213 INFO L226 Difference]: Without dead ends: 92 [2020-07-10 18:35:17,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:35:17,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-10 18:35:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2020-07-10 18:35:17,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:17,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 91 states. [2020-07-10 18:35:17,298 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 91 states. [2020-07-10 18:35:17,298 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 91 states. [2020-07-10 18:35:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:17,311 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-10 18:35:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-07-10 18:35:17,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:17,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:17,313 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 92 states. [2020-07-10 18:35:17,313 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 92 states. [2020-07-10 18:35:17,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:17,328 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2020-07-10 18:35:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2020-07-10 18:35:17,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:17,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:17,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:17,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-10 18:35:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2020-07-10 18:35:17,342 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 49 [2020-07-10 18:35:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:17,342 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2020-07-10 18:35:17,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:35:17,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states and 100 transitions. [2020-07-10 18:35:17,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2020-07-10 18:35:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 18:35:17,464 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:17,465 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, 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 18:35:17,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:35:17,465 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:17,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:17,466 INFO L82 PathProgramCache]: Analyzing trace with hash -389367439, now seen corresponding path program 1 times [2020-07-10 18:35:17,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:17,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404906415] [2020-07-10 18:35:17,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:17,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1518#true} is VALID [2020-07-10 18:35:17,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {1518#true} #valid := #valid[0 := 0]; {1518#true} is VALID [2020-07-10 18:35:17,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {1518#true} assume 0 < #StackHeapBarrier; {1518#true} is VALID [2020-07-10 18:35:17,569 INFO L280 TraceCheckUtils]: 3: Hoare triple {1518#true} assume true; {1518#true} is VALID [2020-07-10 18:35:17,569 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1518#true} {1518#true} #149#return; {1518#true} is VALID [2020-07-10 18:35:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:35:17,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-10 18:35:17,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {1518#true} havoc ~msw~0; {1518#true} is VALID [2020-07-10 18:35:17,683 INFO L280 TraceCheckUtils]: 2: Hoare triple {1518#true} havoc ~lsw~0; {1518#true} is VALID [2020-07-10 18:35:17,684 INFO L280 TraceCheckUtils]: 3: Hoare triple {1518#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {1518#true} is VALID [2020-07-10 18:35:17,684 INFO L280 TraceCheckUtils]: 4: Hoare triple {1518#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {1518#true} is VALID [2020-07-10 18:35:17,684 INFO L280 TraceCheckUtils]: 5: Hoare triple {1518#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {1518#true} is VALID [2020-07-10 18:35:17,684 INFO L280 TraceCheckUtils]: 6: Hoare triple {1518#true} ~msw~0 := #t~mem0; {1518#true} is VALID [2020-07-10 18:35:17,685 INFO L280 TraceCheckUtils]: 7: Hoare triple {1518#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {1518#true} is VALID [2020-07-10 18:35:17,685 INFO L280 TraceCheckUtils]: 8: Hoare triple {1518#true} havoc #t~union1; {1518#true} is VALID [2020-07-10 18:35:17,685 INFO L280 TraceCheckUtils]: 9: Hoare triple {1518#true} havoc #t~mem0; {1518#true} is VALID [2020-07-10 18:35:17,686 INFO L280 TraceCheckUtils]: 10: Hoare triple {1518#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {1518#true} is VALID [2020-07-10 18:35:17,686 INFO L280 TraceCheckUtils]: 11: Hoare triple {1518#true} ~lsw~0 := #t~mem2; {1518#true} is VALID [2020-07-10 18:35:17,686 INFO L280 TraceCheckUtils]: 12: Hoare triple {1518#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {1518#true} is VALID [2020-07-10 18:35:17,687 INFO L280 TraceCheckUtils]: 13: Hoare triple {1518#true} havoc #t~mem2; {1518#true} is VALID [2020-07-10 18:35:17,687 INFO L280 TraceCheckUtils]: 14: Hoare triple {1518#true} havoc #t~union3; {1518#true} is VALID [2020-07-10 18:35:17,687 INFO L280 TraceCheckUtils]: 15: Hoare triple {1518#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {1518#true} is VALID [2020-07-10 18:35:17,687 INFO L280 TraceCheckUtils]: 16: Hoare triple {1518#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1518#true} is VALID [2020-07-10 18:35:17,688 INFO L280 TraceCheckUtils]: 17: Hoare triple {1518#true} goto; {1518#true} is VALID [2020-07-10 18:35:17,688 INFO L280 TraceCheckUtils]: 18: Hoare triple {1518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1518#true} is VALID [2020-07-10 18:35:17,688 INFO L280 TraceCheckUtils]: 19: Hoare triple {1518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1518#true} is VALID [2020-07-10 18:35:17,689 INFO L280 TraceCheckUtils]: 20: Hoare triple {1518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1518#true} is VALID [2020-07-10 18:35:17,689 INFO L280 TraceCheckUtils]: 21: Hoare triple {1518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1518#true} is VALID [2020-07-10 18:35:17,690 INFO L280 TraceCheckUtils]: 22: Hoare triple {1518#true} #res := 1; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:17,691 INFO L280 TraceCheckUtils]: 23: Hoare triple {1587#(= 1 |__fpclassify_double_#res|)} assume true; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:17,692 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1587#(= 1 |__fpclassify_double_#res|)} {1518#true} #145#return; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:17,693 INFO L280 TraceCheckUtils]: 0: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-10 18:35:17,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {1518#true} ~y := #in~y; {1518#true} is VALID [2020-07-10 18:35:17,694 INFO L263 TraceCheckUtils]: 2: Hoare triple {1518#true} call #t~ret4 := __fpclassify_double(~x); {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:17,694 INFO L280 TraceCheckUtils]: 3: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-10 18:35:17,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {1518#true} havoc ~msw~0; {1518#true} is VALID [2020-07-10 18:35:17,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {1518#true} havoc ~lsw~0; {1518#true} is VALID [2020-07-10 18:35:17,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {1518#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {1518#true} is VALID [2020-07-10 18:35:17,696 INFO L280 TraceCheckUtils]: 7: Hoare triple {1518#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {1518#true} is VALID [2020-07-10 18:35:17,696 INFO L280 TraceCheckUtils]: 8: Hoare triple {1518#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {1518#true} is VALID [2020-07-10 18:35:17,696 INFO L280 TraceCheckUtils]: 9: Hoare triple {1518#true} ~msw~0 := #t~mem0; {1518#true} is VALID [2020-07-10 18:35:17,696 INFO L280 TraceCheckUtils]: 10: Hoare triple {1518#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {1518#true} is VALID [2020-07-10 18:35:17,697 INFO L280 TraceCheckUtils]: 11: Hoare triple {1518#true} havoc #t~union1; {1518#true} is VALID [2020-07-10 18:35:17,697 INFO L280 TraceCheckUtils]: 12: Hoare triple {1518#true} havoc #t~mem0; {1518#true} is VALID [2020-07-10 18:35:17,697 INFO L280 TraceCheckUtils]: 13: Hoare triple {1518#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {1518#true} is VALID [2020-07-10 18:35:17,698 INFO L280 TraceCheckUtils]: 14: Hoare triple {1518#true} ~lsw~0 := #t~mem2; {1518#true} is VALID [2020-07-10 18:35:17,698 INFO L280 TraceCheckUtils]: 15: Hoare triple {1518#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {1518#true} is VALID [2020-07-10 18:35:17,698 INFO L280 TraceCheckUtils]: 16: Hoare triple {1518#true} havoc #t~mem2; {1518#true} is VALID [2020-07-10 18:35:17,698 INFO L280 TraceCheckUtils]: 17: Hoare triple {1518#true} havoc #t~union3; {1518#true} is VALID [2020-07-10 18:35:17,699 INFO L280 TraceCheckUtils]: 18: Hoare triple {1518#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {1518#true} is VALID [2020-07-10 18:35:17,699 INFO L280 TraceCheckUtils]: 19: Hoare triple {1518#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1518#true} is VALID [2020-07-10 18:35:17,699 INFO L280 TraceCheckUtils]: 20: Hoare triple {1518#true} goto; {1518#true} is VALID [2020-07-10 18:35:17,699 INFO L280 TraceCheckUtils]: 21: Hoare triple {1518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1518#true} is VALID [2020-07-10 18:35:17,700 INFO L280 TraceCheckUtils]: 22: Hoare triple {1518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1518#true} is VALID [2020-07-10 18:35:17,700 INFO L280 TraceCheckUtils]: 23: Hoare triple {1518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1518#true} is VALID [2020-07-10 18:35:17,700 INFO L280 TraceCheckUtils]: 24: Hoare triple {1518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1518#true} is VALID [2020-07-10 18:35:17,701 INFO L280 TraceCheckUtils]: 25: Hoare triple {1518#true} #res := 1; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:17,702 INFO L280 TraceCheckUtils]: 26: Hoare triple {1587#(= 1 |__fpclassify_double_#res|)} assume true; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:17,703 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1587#(= 1 |__fpclassify_double_#res|)} {1518#true} #145#return; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:17,703 INFO L280 TraceCheckUtils]: 28: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:17,704 INFO L280 TraceCheckUtils]: 29: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1519#false} is VALID [2020-07-10 18:35:17,704 INFO L280 TraceCheckUtils]: 30: Hoare triple {1519#false} havoc #t~ret4; {1519#false} is VALID [2020-07-10 18:35:17,705 INFO L280 TraceCheckUtils]: 31: Hoare triple {1519#false} #res := ~y; {1519#false} is VALID [2020-07-10 18:35:17,705 INFO L280 TraceCheckUtils]: 32: Hoare triple {1519#false} assume true; {1519#false} is VALID [2020-07-10 18:35:17,705 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1519#false} {1518#true} #141#return; {1519#false} is VALID [2020-07-10 18:35:17,707 INFO L263 TraceCheckUtils]: 0: Hoare triple {1518#true} call ULTIMATE.init(); {1559#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 18:35:17,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1518#true} is VALID [2020-07-10 18:35:17,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {1518#true} #valid := #valid[0 := 0]; {1518#true} is VALID [2020-07-10 18:35:17,708 INFO L280 TraceCheckUtils]: 3: Hoare triple {1518#true} assume 0 < #StackHeapBarrier; {1518#true} is VALID [2020-07-10 18:35:17,709 INFO L280 TraceCheckUtils]: 4: Hoare triple {1518#true} assume true; {1518#true} is VALID [2020-07-10 18:35:17,709 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1518#true} {1518#true} #149#return; {1518#true} is VALID [2020-07-10 18:35:17,709 INFO L263 TraceCheckUtils]: 6: Hoare triple {1518#true} call #t~ret12 := main(); {1518#true} is VALID [2020-07-10 18:35:17,709 INFO L280 TraceCheckUtils]: 7: Hoare triple {1518#true} ~x~0 := 0.0; {1518#true} is VALID [2020-07-10 18:35:17,710 INFO L280 TraceCheckUtils]: 8: Hoare triple {1518#true} ~y~0 := ~someUnaryDOUBLEoperation(0.0); {1518#true} is VALID [2020-07-10 18:35:17,711 INFO L263 TraceCheckUtils]: 9: Hoare triple {1518#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:17,711 INFO L280 TraceCheckUtils]: 10: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-10 18:35:17,711 INFO L280 TraceCheckUtils]: 11: Hoare triple {1518#true} ~y := #in~y; {1518#true} is VALID [2020-07-10 18:35:17,712 INFO L263 TraceCheckUtils]: 12: Hoare triple {1518#true} call #t~ret4 := __fpclassify_double(~x); {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 18:35:17,713 INFO L280 TraceCheckUtils]: 13: Hoare triple {1560#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1518#true} is VALID [2020-07-10 18:35:17,713 INFO L280 TraceCheckUtils]: 14: Hoare triple {1518#true} havoc ~msw~0; {1518#true} is VALID [2020-07-10 18:35:17,713 INFO L280 TraceCheckUtils]: 15: Hoare triple {1518#true} havoc ~lsw~0; {1518#true} is VALID [2020-07-10 18:35:17,714 INFO L280 TraceCheckUtils]: 16: Hoare triple {1518#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L26-2 {1518#true} is VALID [2020-07-10 18:35:17,714 INFO L280 TraceCheckUtils]: 17: Hoare triple {1518#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L27 {1518#true} is VALID [2020-07-10 18:35:17,714 INFO L280 TraceCheckUtils]: 18: Hoare triple {1518#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L28 {1518#true} is VALID [2020-07-10 18:35:17,714 INFO L280 TraceCheckUtils]: 19: Hoare triple {1518#true} ~msw~0 := #t~mem0; {1518#true} is VALID [2020-07-10 18:35:17,715 INFO L280 TraceCheckUtils]: 20: Hoare triple {1518#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L29-1 {1518#true} is VALID [2020-07-10 18:35:17,715 INFO L280 TraceCheckUtils]: 21: Hoare triple {1518#true} havoc #t~union1; {1518#true} is VALID [2020-07-10 18:35:17,715 INFO L280 TraceCheckUtils]: 22: Hoare triple {1518#true} havoc #t~mem0; {1518#true} is VALID [2020-07-10 18:35:17,716 INFO L280 TraceCheckUtils]: 23: Hoare triple {1518#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L30 {1518#true} is VALID [2020-07-10 18:35:17,716 INFO L280 TraceCheckUtils]: 24: Hoare triple {1518#true} ~lsw~0 := #t~mem2; {1518#true} is VALID [2020-07-10 18:35:17,716 INFO L280 TraceCheckUtils]: 25: Hoare triple {1518#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L30-2 {1518#true} is VALID [2020-07-10 18:35:17,716 INFO L280 TraceCheckUtils]: 26: Hoare triple {1518#true} havoc #t~mem2; {1518#true} is VALID [2020-07-10 18:35:17,717 INFO L280 TraceCheckUtils]: 27: Hoare triple {1518#true} havoc #t~union3; {1518#true} is VALID [2020-07-10 18:35:17,717 INFO L280 TraceCheckUtils]: 28: Hoare triple {1518#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L27-1 {1518#true} is VALID [2020-07-10 18:35:17,717 INFO L280 TraceCheckUtils]: 29: Hoare triple {1518#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1518#true} is VALID [2020-07-10 18:35:17,717 INFO L280 TraceCheckUtils]: 30: Hoare triple {1518#true} goto; {1518#true} is VALID [2020-07-10 18:35:17,718 INFO L280 TraceCheckUtils]: 31: Hoare triple {1518#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {1518#true} is VALID [2020-07-10 18:35:17,718 INFO L280 TraceCheckUtils]: 32: Hoare triple {1518#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {1518#true} is VALID [2020-07-10 18:35:17,718 INFO L280 TraceCheckUtils]: 33: Hoare triple {1518#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {1518#true} is VALID [2020-07-10 18:35:17,718 INFO L280 TraceCheckUtils]: 34: Hoare triple {1518#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296); {1518#true} is VALID [2020-07-10 18:35:17,719 INFO L280 TraceCheckUtils]: 35: Hoare triple {1518#true} #res := 1; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:17,720 INFO L280 TraceCheckUtils]: 36: Hoare triple {1587#(= 1 |__fpclassify_double_#res|)} assume true; {1587#(= 1 |__fpclassify_double_#res|)} is VALID [2020-07-10 18:35:17,721 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1587#(= 1 |__fpclassify_double_#res|)} {1518#true} #145#return; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:17,722 INFO L280 TraceCheckUtils]: 38: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1586#(= |fmax_double_#t~ret4| 1)} is VALID [2020-07-10 18:35:17,722 INFO L280 TraceCheckUtils]: 39: Hoare triple {1586#(= |fmax_double_#t~ret4| 1)} assume 0 == #t~ret4; {1519#false} is VALID [2020-07-10 18:35:17,723 INFO L280 TraceCheckUtils]: 40: Hoare triple {1519#false} havoc #t~ret4; {1519#false} is VALID [2020-07-10 18:35:17,723 INFO L280 TraceCheckUtils]: 41: Hoare triple {1519#false} #res := ~y; {1519#false} is VALID [2020-07-10 18:35:17,723 INFO L280 TraceCheckUtils]: 42: Hoare triple {1519#false} assume true; {1519#false} is VALID [2020-07-10 18:35:17,723 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1519#false} {1518#true} #141#return; {1519#false} is VALID [2020-07-10 18:35:17,724 INFO L280 TraceCheckUtils]: 44: Hoare triple {1519#false} ~res~0 := #t~ret9; {1519#false} is VALID [2020-07-10 18:35:17,724 INFO L280 TraceCheckUtils]: 45: Hoare triple {1519#false} havoc #t~ret9; {1519#false} is VALID [2020-07-10 18:35:17,724 INFO L280 TraceCheckUtils]: 46: Hoare triple {1519#false} #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {1519#false} is VALID [2020-07-10 18:35:17,724 INFO L280 TraceCheckUtils]: 47: Hoare triple {1519#false} assume !#t~short11; {1519#false} is VALID [2020-07-10 18:35:17,725 INFO L280 TraceCheckUtils]: 48: Hoare triple {1519#false} assume !#t~short11; {1519#false} is VALID [2020-07-10 18:35:17,725 INFO L280 TraceCheckUtils]: 49: Hoare triple {1519#false} havoc #t~ret10; {1519#false} is VALID [2020-07-10 18:35:17,725 INFO L280 TraceCheckUtils]: 50: Hoare triple {1519#false} havoc #t~short11; {1519#false} is VALID [2020-07-10 18:35:17,725 INFO L280 TraceCheckUtils]: 51: Hoare triple {1519#false} assume !false; {1519#false} is VALID [2020-07-10 18:35:17,728 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 18:35:17,728 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:35:17,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404906415] [2020-07-10 18:35:17,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:35:17,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 18:35:17,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669799007] [2020-07-10 18:35:17,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-10 18:35:17,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:35:17,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 18:35:17,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:17,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 18:35:17,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:35:17,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 18:35:17,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 18:35:17,785 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 6 states. [2020-07-10 18:35:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:18,424 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2020-07-10 18:35:18,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 18:35:18,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2020-07-10 18:35:18,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:35:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-10 18:35:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 18:35:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2020-07-10 18:35:18,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 133 transitions. [2020-07-10 18:35:18,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:18,597 INFO L225 Difference]: With dead ends: 127 [2020-07-10 18:35:18,597 INFO L226 Difference]: Without dead ends: 96 [2020-07-10 18:35:18,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 18:35:18,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-10 18:35:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2020-07-10 18:35:18,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:35:18,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 91 states. [2020-07-10 18:35:18,678 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 91 states. [2020-07-10 18:35:18,678 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 91 states. [2020-07-10 18:35:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:18,683 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-07-10 18:35:18,684 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-07-10 18:35:18,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:18,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:18,685 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 96 states. [2020-07-10 18:35:18,685 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 96 states. [2020-07-10 18:35:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:35:18,689 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2020-07-10 18:35:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2020-07-10 18:35:18,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:35:18,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:35:18,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:35:18,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:35:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-10 18:35:18,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2020-07-10 18:35:18,695 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 52 [2020-07-10 18:35:18,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:35:18,695 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2020-07-10 18:35:18,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 18:35:18,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states and 100 transitions. [2020-07-10 18:35:18,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:35:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2020-07-10 18:35:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 18:35:18,809 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:35:18,810 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, 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 18:35:18,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:35:18,810 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:35:18,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:35:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash 323107249, now seen corresponding path program 1 times [2020-07-10 18:35:18,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:35:18,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1636542539] [2020-07-10 18:35:18,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:35:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:35:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 18:35:19,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 18:35:19,046 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.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:266) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) 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 18:35:19,053 INFO L168 Benchmark]: Toolchain (without parser) took 6045.93 ms. Allocated memory was 144.7 MB in the beginning and 285.2 MB in the end (delta: 140.5 MB). Free memory was 103.3 MB in the beginning and 180.1 MB in the end (delta: -76.8 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:19,054 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 18:35:19,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.37 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 103.1 MB in the beginning and 180.9 MB in the end (delta: -77.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:19,062 INFO L168 Benchmark]: Boogie Preprocessor took 57.25 ms. Allocated memory is still 201.9 MB. Free memory was 180.9 MB in the beginning and 178.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:19,063 INFO L168 Benchmark]: RCFGBuilder took 622.25 ms. Allocated memory is still 201.9 MB. Free memory was 178.4 MB in the beginning and 138.6 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:19,066 INFO L168 Benchmark]: TraceAbstraction took 4921.58 ms. Allocated memory was 201.9 MB in the beginning and 285.2 MB in the end (delta: 83.4 MB). Free memory was 137.9 MB in the beginning and 180.1 MB in the end (delta: -42.2 MB). Peak memory consumption was 41.1 MB. Max. memory is 7.1 GB. [2020-07-10 18:35:19,069 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.26 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 432.37 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 103.1 MB in the beginning and 180.9 MB in the end (delta: -77.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.25 ms. Allocated memory is still 201.9 MB. Free memory was 180.9 MB in the beginning and 178.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 622.25 ms. Allocated memory is still 201.9 MB. Free memory was 178.4 MB in the beginning and 138.6 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4921.58 ms. Allocated memory was 201.9 MB in the beginning and 285.2 MB in the end (delta: 83.4 MB). Free memory was 137.9 MB in the beginning and 180.1 MB in the end (delta: -42.2 MB). Peak memory consumption was 41.1 MB. 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...