/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1232a.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:33:24,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:33:24,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:33:24,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:33:24,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:33:24,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:33:24,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:33:24,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:33:24,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:33:24,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:33:24,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:33:24,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:33:24,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:33:24,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:33:24,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:33:24,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:33:24,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:33:24,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:33:24,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:33:24,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:33:24,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:33:24,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:33:24,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:33:24,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:33:24,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:33:24,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:33:24,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:33:24,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:33:24,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:33:24,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:33:24,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:33:24,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:33:24,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:33:24,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:33:24,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:33:24,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:33:24,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:33:24,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:33:24,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:33:24,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:33:24,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:33:24,271 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:33:24,280 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:33:24,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:33:24,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:33:24,282 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:33:24,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:33:24,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:33:24,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:33:24,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:33:24,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:33:24,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:33:24,284 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:33:24,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:33:24,285 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:33:24,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:33:24,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:33:24,285 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:33:24,286 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:33:24,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:33:24,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:24,287 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:33:24,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:33:24,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:33:24,287 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:33:24,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:33:24,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:33:24,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:33:24,609 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:33:24,609 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:33:24,610 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1232a.c [2020-07-11 00:33:24,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42cb7763e/992b76f4911f472e9a5c86d4add101d8/FLAGebe0ae658 [2020-07-11 00:33:25,195 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:25,196 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1232a.c [2020-07-11 00:33:25,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42cb7763e/992b76f4911f472e9a5c86d4add101d8/FLAGebe0ae658 [2020-07-11 00:33:25,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42cb7763e/992b76f4911f472e9a5c86d4add101d8 [2020-07-11 00:33:25,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:25,533 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:25,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:25,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:25,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:25,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1510d935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25, skipping insertion in model container [2020-07-11 00:33:25,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:25,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:25,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:25,789 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:25,845 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:25,867 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:25,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25 WrapperNode [2020-07-11 00:33:25,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:25,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:25,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:25,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:25,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:25,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:26,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:26,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (1/1) ... [2020-07-11 00:33:26,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:26,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:26,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:26,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:26,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (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-11 00:33:26,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:26,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:26,076 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-11 00:33:26,076 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2020-07-11 00:33:26,076 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2020-07-11 00:33:26,076 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:26,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:26,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2020-07-11 00:33:26,077 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-11 00:33:26,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 00:33:26,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-11 00:33:26,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 00:33:26,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 00:33:26,078 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2020-07-11 00:33:26,078 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2020-07-11 00:33:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:26,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 00:33:26,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-11 00:33:26,667 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:26,667 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-11 00:33:26,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:26 BoogieIcfgContainer [2020-07-11 00:33:26,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:26,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:26,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:26,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:26,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:25" (1/3) ... [2020-07-11 00:33:26,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24267c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:26, skipping insertion in model container [2020-07-11 00:33:26,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:25" (2/3) ... [2020-07-11 00:33:26,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24267c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:26, skipping insertion in model container [2020-07-11 00:33:26,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:26" (3/3) ... [2020-07-11 00:33:26,682 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2020-07-11 00:33:26,694 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:26,702 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:26,718 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:33:26,742 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:33:26,742 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:33:26,742 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:33:26,742 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:33:26,743 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:33:26,743 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:33:26,743 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:33:26,743 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:33:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2020-07-11 00:33:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 00:33:26,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:26,777 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] [2020-07-11 00:33:26,778 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:26,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:26,785 INFO L82 PathProgramCache]: Analyzing trace with hash -380814032, now seen corresponding path program 1 times [2020-07-11 00:33:26,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:26,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1095456618] [2020-07-11 00:33:26,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:27,021 INFO L280 TraceCheckUtils]: 0: Hoare triple {115#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {92#true} is VALID [2020-07-11 00:33:27,022 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} #valid := #valid[0 := 0]; {92#true} is VALID [2020-07-11 00:33:27,022 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume 0 < #StackHeapBarrier; {92#true} is VALID [2020-07-11 00:33:27,023 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-11 00:33:27,024 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {92#true} {92#true} #143#return; {92#true} is VALID [2020-07-11 00:33:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:27,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {116#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {92#true} is VALID [2020-07-11 00:33:27,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} havoc ~w~0; {92#true} is VALID [2020-07-11 00:33:27,079 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-11 00:33:27,079 INFO L280 TraceCheckUtils]: 3: Hoare triple {93#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {93#false} is VALID [2020-07-11 00:33:27,079 INFO L280 TraceCheckUtils]: 4: Hoare triple {93#false} #res := 2; {93#false} is VALID [2020-07-11 00:33:27,080 INFO L280 TraceCheckUtils]: 5: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-11 00:33:27,080 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {93#false} {92#true} #139#return; {93#false} is VALID [2020-07-11 00:33:27,081 INFO L280 TraceCheckUtils]: 0: Hoare triple {116#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {92#true} is VALID [2020-07-11 00:33:27,081 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} ~y := #in~y; {92#true} is VALID [2020-07-11 00:33:27,083 INFO L263 TraceCheckUtils]: 2: Hoare triple {92#true} call #t~ret2 := __fpclassify_float(~x); {116#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:27,084 INFO L280 TraceCheckUtils]: 3: Hoare triple {116#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {92#true} is VALID [2020-07-11 00:33:27,084 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} havoc ~w~0; {92#true} is VALID [2020-07-11 00:33:27,085 INFO L280 TraceCheckUtils]: 5: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-11 00:33:27,086 INFO L280 TraceCheckUtils]: 6: Hoare triple {93#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {93#false} is VALID [2020-07-11 00:33:27,086 INFO L280 TraceCheckUtils]: 7: Hoare triple {93#false} #res := 2; {93#false} is VALID [2020-07-11 00:33:27,086 INFO L280 TraceCheckUtils]: 8: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-11 00:33:27,087 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {93#false} {92#true} #139#return; {93#false} is VALID [2020-07-11 00:33:27,087 INFO L280 TraceCheckUtils]: 10: Hoare triple {93#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {93#false} is VALID [2020-07-11 00:33:27,087 INFO L280 TraceCheckUtils]: 11: Hoare triple {93#false} assume 0 == #t~ret2; {93#false} is VALID [2020-07-11 00:33:27,088 INFO L280 TraceCheckUtils]: 12: Hoare triple {93#false} havoc #t~ret2; {93#false} is VALID [2020-07-11 00:33:27,088 INFO L280 TraceCheckUtils]: 13: Hoare triple {93#false} #res := ~y; {93#false} is VALID [2020-07-11 00:33:27,089 INFO L280 TraceCheckUtils]: 14: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-11 00:33:27,089 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {93#false} {92#true} #135#return; {93#false} is VALID [2020-07-11 00:33:27,098 INFO L263 TraceCheckUtils]: 0: Hoare triple {92#true} call ULTIMATE.init(); {115#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:33:27,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {115#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {92#true} is VALID [2020-07-11 00:33:27,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} #valid := #valid[0 := 0]; {92#true} is VALID [2020-07-11 00:33:27,099 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} assume 0 < #StackHeapBarrier; {92#true} is VALID [2020-07-11 00:33:27,099 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-11 00:33:27,100 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {92#true} {92#true} #143#return; {92#true} is VALID [2020-07-11 00:33:27,100 INFO L263 TraceCheckUtils]: 6: Hoare triple {92#true} call #t~ret10 := main(); {92#true} is VALID [2020-07-11 00:33:27,101 INFO L280 TraceCheckUtils]: 7: Hoare triple {92#true} ~x~0 := 0.0; {92#true} is VALID [2020-07-11 00:33:27,101 INFO L280 TraceCheckUtils]: 8: Hoare triple {92#true} ~y~0 := ~someUnaryFLOAToperation(0.0); {92#true} is VALID [2020-07-11 00:33:27,103 INFO L263 TraceCheckUtils]: 9: Hoare triple {92#true} call #t~ret7 := fmin_float(~x~0, ~y~0); {116#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:27,103 INFO L280 TraceCheckUtils]: 10: Hoare triple {116#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {92#true} is VALID [2020-07-11 00:33:27,104 INFO L280 TraceCheckUtils]: 11: Hoare triple {92#true} ~y := #in~y; {92#true} is VALID [2020-07-11 00:33:27,105 INFO L263 TraceCheckUtils]: 12: Hoare triple {92#true} call #t~ret2 := __fpclassify_float(~x); {116#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:27,106 INFO L280 TraceCheckUtils]: 13: Hoare triple {116#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {92#true} is VALID [2020-07-11 00:33:27,106 INFO L280 TraceCheckUtils]: 14: Hoare triple {92#true} havoc ~w~0; {92#true} is VALID [2020-07-11 00:33:27,107 INFO L280 TraceCheckUtils]: 15: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-11 00:33:27,108 INFO L280 TraceCheckUtils]: 16: Hoare triple {93#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {93#false} is VALID [2020-07-11 00:33:27,108 INFO L280 TraceCheckUtils]: 17: Hoare triple {93#false} #res := 2; {93#false} is VALID [2020-07-11 00:33:27,108 INFO L280 TraceCheckUtils]: 18: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-11 00:33:27,109 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {93#false} {92#true} #139#return; {93#false} is VALID [2020-07-11 00:33:27,109 INFO L280 TraceCheckUtils]: 20: Hoare triple {93#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {93#false} is VALID [2020-07-11 00:33:27,109 INFO L280 TraceCheckUtils]: 21: Hoare triple {93#false} assume 0 == #t~ret2; {93#false} is VALID [2020-07-11 00:33:27,110 INFO L280 TraceCheckUtils]: 22: Hoare triple {93#false} havoc #t~ret2; {93#false} is VALID [2020-07-11 00:33:27,110 INFO L280 TraceCheckUtils]: 23: Hoare triple {93#false} #res := ~y; {93#false} is VALID [2020-07-11 00:33:27,110 INFO L280 TraceCheckUtils]: 24: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-11 00:33:27,111 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {93#false} {92#true} #135#return; {93#false} is VALID [2020-07-11 00:33:27,111 INFO L280 TraceCheckUtils]: 26: Hoare triple {93#false} ~res~0 := #t~ret7; {93#false} is VALID [2020-07-11 00:33:27,111 INFO L280 TraceCheckUtils]: 27: Hoare triple {93#false} havoc #t~ret7; {93#false} is VALID [2020-07-11 00:33:27,112 INFO L280 TraceCheckUtils]: 28: Hoare triple {93#false} #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); {93#false} is VALID [2020-07-11 00:33:27,112 INFO L280 TraceCheckUtils]: 29: Hoare triple {93#false} assume !#t~short9; {93#false} is VALID [2020-07-11 00:33:27,112 INFO L280 TraceCheckUtils]: 30: Hoare triple {93#false} assume !#t~short9; {93#false} is VALID [2020-07-11 00:33:27,113 INFO L280 TraceCheckUtils]: 31: Hoare triple {93#false} havoc #t~short9; {93#false} is VALID [2020-07-11 00:33:27,113 INFO L280 TraceCheckUtils]: 32: Hoare triple {93#false} havoc #t~ret8; {93#false} is VALID [2020-07-11 00:33:27,113 INFO L280 TraceCheckUtils]: 33: Hoare triple {93#false} assume !false; {93#false} is VALID [2020-07-11 00:33:27,120 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-11 00:33:27,121 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1095456618] [2020-07-11 00:33:27,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:27,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 00:33:27,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649057539] [2020-07-11 00:33:27,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-07-11 00:33:27,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:27,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 00:33:27,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:27,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 00:33:27,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:27,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 00:33:27,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 00:33:27,214 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 4 states. [2020-07-11 00:33:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:27,995 INFO L93 Difference]: Finished difference Result 164 states and 192 transitions. [2020-07-11 00:33:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 00:33:27,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-07-11 00:33:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2020-07-11 00:33:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2020-07-11 00:33:28,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2020-07-11 00:33:28,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:28,376 INFO L225 Difference]: With dead ends: 164 [2020-07-11 00:33:28,376 INFO L226 Difference]: Without dead ends: 81 [2020-07-11 00:33:28,381 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-11 00:33:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-11 00:33:28,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-11 00:33:28,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:28,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:28,517 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:28,517 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:28,527 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-11 00:33:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-11 00:33:28,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:28,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:28,529 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:28,529 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:28,538 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-11 00:33:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-11 00:33:28,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:28,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:28,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:28,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-11 00:33:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-07-11 00:33:28,549 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 34 [2020-07-11 00:33:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:28,549 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-07-11 00:33:28,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 00:33:28,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 89 transitions. [2020-07-11 00:33:28,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-11 00:33:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-11 00:33:28,703 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:28,704 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] [2020-07-11 00:33:28,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:33:28,704 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:28,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:28,705 INFO L82 PathProgramCache]: Analyzing trace with hash 133434162, now seen corresponding path program 1 times [2020-07-11 00:33:28,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:28,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1198461051] [2020-07-11 00:33:28,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:28,804 INFO L280 TraceCheckUtils]: 0: Hoare triple {813#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {781#true} is VALID [2020-07-11 00:33:28,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#true} #valid := #valid[0 := 0]; {781#true} is VALID [2020-07-11 00:33:28,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {781#true} assume 0 < #StackHeapBarrier; {781#true} is VALID [2020-07-11 00:33:28,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {781#true} assume true; {781#true} is VALID [2020-07-11 00:33:28,806 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {781#true} {781#true} #143#return; {781#true} is VALID [2020-07-11 00:33:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:28,963 INFO L280 TraceCheckUtils]: 0: Hoare triple {814#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {781#true} is VALID [2020-07-11 00:33:28,963 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#true} havoc ~w~0; {781#true} is VALID [2020-07-11 00:33:28,964 INFO L280 TraceCheckUtils]: 2: Hoare triple {781#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L15-2 {781#true} is VALID [2020-07-11 00:33:28,964 INFO L280 TraceCheckUtils]: 3: Hoare triple {781#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L16 {781#true} is VALID [2020-07-11 00:33:28,964 INFO L280 TraceCheckUtils]: 4: Hoare triple {781#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17 {781#true} is VALID [2020-07-11 00:33:28,965 INFO L280 TraceCheckUtils]: 5: Hoare triple {781#true} ~w~0 := #t~mem0; {781#true} is VALID [2020-07-11 00:33:28,965 INFO L280 TraceCheckUtils]: 6: Hoare triple {781#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L18-1 {781#true} is VALID [2020-07-11 00:33:28,965 INFO L280 TraceCheckUtils]: 7: Hoare triple {781#true} havoc #t~union1; {781#true} is VALID [2020-07-11 00:33:28,966 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#true} havoc #t~mem0; {781#true} is VALID [2020-07-11 00:33:28,966 INFO L280 TraceCheckUtils]: 9: Hoare triple {781#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L16-1 {781#true} is VALID [2020-07-11 00:33:28,971 INFO L280 TraceCheckUtils]: 10: Hoare triple {781#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {781#true} is VALID [2020-07-11 00:33:28,972 INFO L280 TraceCheckUtils]: 11: Hoare triple {781#true} goto; {781#true} is VALID [2020-07-11 00:33:28,972 INFO L280 TraceCheckUtils]: 12: Hoare triple {781#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {781#true} is VALID [2020-07-11 00:33:28,974 INFO L280 TraceCheckUtils]: 13: Hoare triple {781#true} #res := 2; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:28,975 INFO L280 TraceCheckUtils]: 14: Hoare triple {832#(<= 2 |__fpclassify_float_#res|)} assume true; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:28,977 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {832#(<= 2 |__fpclassify_float_#res|)} {781#true} #139#return; {831#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:28,978 INFO L280 TraceCheckUtils]: 0: Hoare triple {814#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {781#true} is VALID [2020-07-11 00:33:28,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#true} ~y := #in~y; {781#true} is VALID [2020-07-11 00:33:28,979 INFO L263 TraceCheckUtils]: 2: Hoare triple {781#true} call #t~ret2 := __fpclassify_float(~x); {814#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:28,980 INFO L280 TraceCheckUtils]: 3: Hoare triple {814#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {781#true} is VALID [2020-07-11 00:33:28,980 INFO L280 TraceCheckUtils]: 4: Hoare triple {781#true} havoc ~w~0; {781#true} is VALID [2020-07-11 00:33:28,980 INFO L280 TraceCheckUtils]: 5: Hoare triple {781#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L15-2 {781#true} is VALID [2020-07-11 00:33:28,981 INFO L280 TraceCheckUtils]: 6: Hoare triple {781#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L16 {781#true} is VALID [2020-07-11 00:33:28,981 INFO L280 TraceCheckUtils]: 7: Hoare triple {781#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17 {781#true} is VALID [2020-07-11 00:33:28,981 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#true} ~w~0 := #t~mem0; {781#true} is VALID [2020-07-11 00:33:28,981 INFO L280 TraceCheckUtils]: 9: Hoare triple {781#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L18-1 {781#true} is VALID [2020-07-11 00:33:28,982 INFO L280 TraceCheckUtils]: 10: Hoare triple {781#true} havoc #t~union1; {781#true} is VALID [2020-07-11 00:33:28,982 INFO L280 TraceCheckUtils]: 11: Hoare triple {781#true} havoc #t~mem0; {781#true} is VALID [2020-07-11 00:33:28,982 INFO L280 TraceCheckUtils]: 12: Hoare triple {781#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L16-1 {781#true} is VALID [2020-07-11 00:33:28,983 INFO L280 TraceCheckUtils]: 13: Hoare triple {781#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {781#true} is VALID [2020-07-11 00:33:28,983 INFO L280 TraceCheckUtils]: 14: Hoare triple {781#true} goto; {781#true} is VALID [2020-07-11 00:33:28,985 INFO L280 TraceCheckUtils]: 15: Hoare triple {781#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {781#true} is VALID [2020-07-11 00:33:28,986 INFO L280 TraceCheckUtils]: 16: Hoare triple {781#true} #res := 2; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:28,987 INFO L280 TraceCheckUtils]: 17: Hoare triple {832#(<= 2 |__fpclassify_float_#res|)} assume true; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:28,988 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {832#(<= 2 |__fpclassify_float_#res|)} {781#true} #139#return; {831#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:28,989 INFO L280 TraceCheckUtils]: 19: Hoare triple {831#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {831#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:28,990 INFO L280 TraceCheckUtils]: 20: Hoare triple {831#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2; {782#false} is VALID [2020-07-11 00:33:28,990 INFO L280 TraceCheckUtils]: 21: Hoare triple {782#false} havoc #t~ret2; {782#false} is VALID [2020-07-11 00:33:28,991 INFO L280 TraceCheckUtils]: 22: Hoare triple {782#false} #res := ~y; {782#false} is VALID [2020-07-11 00:33:28,991 INFO L280 TraceCheckUtils]: 23: Hoare triple {782#false} assume true; {782#false} is VALID [2020-07-11 00:33:28,994 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {782#false} {781#true} #135#return; {782#false} is VALID [2020-07-11 00:33:28,998 INFO L263 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {813#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:33:28,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {813#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {781#true} is VALID [2020-07-11 00:33:28,999 INFO L280 TraceCheckUtils]: 2: Hoare triple {781#true} #valid := #valid[0 := 0]; {781#true} is VALID [2020-07-11 00:33:28,999 INFO L280 TraceCheckUtils]: 3: Hoare triple {781#true} assume 0 < #StackHeapBarrier; {781#true} is VALID [2020-07-11 00:33:29,000 INFO L280 TraceCheckUtils]: 4: Hoare triple {781#true} assume true; {781#true} is VALID [2020-07-11 00:33:29,000 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {781#true} {781#true} #143#return; {781#true} is VALID [2020-07-11 00:33:29,000 INFO L263 TraceCheckUtils]: 6: Hoare triple {781#true} call #t~ret10 := main(); {781#true} is VALID [2020-07-11 00:33:29,001 INFO L280 TraceCheckUtils]: 7: Hoare triple {781#true} ~x~0 := 0.0; {781#true} is VALID [2020-07-11 00:33:29,001 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#true} ~y~0 := ~someUnaryFLOAToperation(0.0); {781#true} is VALID [2020-07-11 00:33:29,002 INFO L263 TraceCheckUtils]: 9: Hoare triple {781#true} call #t~ret7 := fmin_float(~x~0, ~y~0); {814#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:29,003 INFO L280 TraceCheckUtils]: 10: Hoare triple {814#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {781#true} is VALID [2020-07-11 00:33:29,003 INFO L280 TraceCheckUtils]: 11: Hoare triple {781#true} ~y := #in~y; {781#true} is VALID [2020-07-11 00:33:29,005 INFO L263 TraceCheckUtils]: 12: Hoare triple {781#true} call #t~ret2 := __fpclassify_float(~x); {814#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:29,005 INFO L280 TraceCheckUtils]: 13: Hoare triple {814#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {781#true} is VALID [2020-07-11 00:33:29,006 INFO L280 TraceCheckUtils]: 14: Hoare triple {781#true} havoc ~w~0; {781#true} is VALID [2020-07-11 00:33:29,006 INFO L280 TraceCheckUtils]: 15: Hoare triple {781#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L15-2 {781#true} is VALID [2020-07-11 00:33:29,009 INFO L280 TraceCheckUtils]: 16: Hoare triple {781#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L16 {781#true} is VALID [2020-07-11 00:33:29,010 INFO L280 TraceCheckUtils]: 17: Hoare triple {781#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17 {781#true} is VALID [2020-07-11 00:33:29,010 INFO L280 TraceCheckUtils]: 18: Hoare triple {781#true} ~w~0 := #t~mem0; {781#true} is VALID [2020-07-11 00:33:29,010 INFO L280 TraceCheckUtils]: 19: Hoare triple {781#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L18-1 {781#true} is VALID [2020-07-11 00:33:29,011 INFO L280 TraceCheckUtils]: 20: Hoare triple {781#true} havoc #t~union1; {781#true} is VALID [2020-07-11 00:33:29,011 INFO L280 TraceCheckUtils]: 21: Hoare triple {781#true} havoc #t~mem0; {781#true} is VALID [2020-07-11 00:33:29,013 INFO L280 TraceCheckUtils]: 22: Hoare triple {781#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L16-1 {781#true} is VALID [2020-07-11 00:33:29,014 INFO L280 TraceCheckUtils]: 23: Hoare triple {781#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {781#true} is VALID [2020-07-11 00:33:29,014 INFO L280 TraceCheckUtils]: 24: Hoare triple {781#true} goto; {781#true} is VALID [2020-07-11 00:33:29,014 INFO L280 TraceCheckUtils]: 25: Hoare triple {781#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {781#true} is VALID [2020-07-11 00:33:29,022 INFO L280 TraceCheckUtils]: 26: Hoare triple {781#true} #res := 2; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:29,022 INFO L280 TraceCheckUtils]: 27: Hoare triple {832#(<= 2 |__fpclassify_float_#res|)} assume true; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:29,024 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {832#(<= 2 |__fpclassify_float_#res|)} {781#true} #139#return; {831#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:29,025 INFO L280 TraceCheckUtils]: 29: Hoare triple {831#(<= 2 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {831#(<= 2 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:29,027 INFO L280 TraceCheckUtils]: 30: Hoare triple {831#(<= 2 |fmin_float_#t~ret2|)} assume 0 == #t~ret2; {782#false} is VALID [2020-07-11 00:33:29,028 INFO L280 TraceCheckUtils]: 31: Hoare triple {782#false} havoc #t~ret2; {782#false} is VALID [2020-07-11 00:33:29,028 INFO L280 TraceCheckUtils]: 32: Hoare triple {782#false} #res := ~y; {782#false} is VALID [2020-07-11 00:33:29,029 INFO L280 TraceCheckUtils]: 33: Hoare triple {782#false} assume true; {782#false} is VALID [2020-07-11 00:33:29,029 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {782#false} {781#true} #135#return; {782#false} is VALID [2020-07-11 00:33:29,029 INFO L280 TraceCheckUtils]: 35: Hoare triple {782#false} ~res~0 := #t~ret7; {782#false} is VALID [2020-07-11 00:33:29,030 INFO L280 TraceCheckUtils]: 36: Hoare triple {782#false} havoc #t~ret7; {782#false} is VALID [2020-07-11 00:33:29,030 INFO L280 TraceCheckUtils]: 37: Hoare triple {782#false} #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); {782#false} is VALID [2020-07-11 00:33:29,030 INFO L280 TraceCheckUtils]: 38: Hoare triple {782#false} assume !#t~short9; {782#false} is VALID [2020-07-11 00:33:29,034 INFO L280 TraceCheckUtils]: 39: Hoare triple {782#false} assume !#t~short9; {782#false} is VALID [2020-07-11 00:33:29,034 INFO L280 TraceCheckUtils]: 40: Hoare triple {782#false} havoc #t~short9; {782#false} is VALID [2020-07-11 00:33:29,034 INFO L280 TraceCheckUtils]: 41: Hoare triple {782#false} havoc #t~ret8; {782#false} is VALID [2020-07-11 00:33:29,034 INFO L280 TraceCheckUtils]: 42: Hoare triple {782#false} assume !false; {782#false} is VALID [2020-07-11 00:33:29,038 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-11 00:33:29,038 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1198461051] [2020-07-11 00:33:29,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:29,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:33:29,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022204518] [2020-07-11 00:33:29,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-11 00:33:29,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:29,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:33:29,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:29,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:33:29,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:29,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:33:29,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:29,090 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2020-07-11 00:33:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:29,785 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2020-07-11 00:33:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:33:29,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-11 00:33:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-11 00:33:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-11 00:33:29,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2020-07-11 00:33:29,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:29,942 INFO L225 Difference]: With dead ends: 117 [2020-07-11 00:33:29,943 INFO L226 Difference]: Without dead ends: 86 [2020-07-11 00:33:29,944 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-11 00:33:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-11 00:33:30,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2020-07-11 00:33:30,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:30,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 85 states. [2020-07-11 00:33:30,027 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 85 states. [2020-07-11 00:33:30,027 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 85 states. [2020-07-11 00:33:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:30,033 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-07-11 00:33:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-07-11 00:33:30,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:30,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:30,034 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 86 states. [2020-07-11 00:33:30,034 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 86 states. [2020-07-11 00:33:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:30,039 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-07-11 00:33:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-07-11 00:33:30,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:30,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:30,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:30,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-11 00:33:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2020-07-11 00:33:30,046 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 43 [2020-07-11 00:33:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:30,046 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-07-11 00:33:30,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:30,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 94 transitions. [2020-07-11 00:33:30,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2020-07-11 00:33:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-11 00:33:30,156 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:30,156 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] [2020-07-11 00:33:30,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:30,157 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:30,157 INFO L82 PathProgramCache]: Analyzing trace with hash 619089939, now seen corresponding path program 1 times [2020-07-11 00:33:30,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:30,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [501429487] [2020-07-11 00:33:30,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:30,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {1449#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1414#true} is VALID [2020-07-11 00:33:30,274 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} #valid := #valid[0 := 0]; {1414#true} is VALID [2020-07-11 00:33:30,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#true} assume 0 < #StackHeapBarrier; {1414#true} is VALID [2020-07-11 00:33:30,275 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} assume true; {1414#true} is VALID [2020-07-11 00:33:30,275 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1414#true} {1414#true} #143#return; {1414#true} is VALID [2020-07-11 00:33:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:30,377 INFO L280 TraceCheckUtils]: 0: Hoare triple {1450#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:33:30,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} havoc ~w~0; {1414#true} is VALID [2020-07-11 00:33:30,378 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L15-2 {1414#true} is VALID [2020-07-11 00:33:30,378 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L16 {1414#true} is VALID [2020-07-11 00:33:30,378 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17 {1414#true} is VALID [2020-07-11 00:33:30,378 INFO L280 TraceCheckUtils]: 5: Hoare triple {1414#true} ~w~0 := #t~mem0; {1414#true} is VALID [2020-07-11 00:33:30,378 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L18-1 {1414#true} is VALID [2020-07-11 00:33:30,379 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} havoc #t~union1; {1414#true} is VALID [2020-07-11 00:33:30,379 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} havoc #t~mem0; {1414#true} is VALID [2020-07-11 00:33:30,379 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L16-1 {1414#true} is VALID [2020-07-11 00:33:30,379 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1414#true} is VALID [2020-07-11 00:33:30,379 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} goto; {1414#true} is VALID [2020-07-11 00:33:30,380 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1414#true} is VALID [2020-07-11 00:33:30,380 INFO L280 TraceCheckUtils]: 13: Hoare triple {1414#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {1414#true} is VALID [2020-07-11 00:33:30,380 INFO L280 TraceCheckUtils]: 14: Hoare triple {1414#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {1414#true} is VALID [2020-07-11 00:33:30,380 INFO L280 TraceCheckUtils]: 15: Hoare triple {1414#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1414#true} is VALID [2020-07-11 00:33:30,381 INFO L280 TraceCheckUtils]: 16: Hoare triple {1414#true} #res := 1; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:30,381 INFO L280 TraceCheckUtils]: 17: Hoare triple {1471#(= 1 |__fpclassify_float_#res|)} assume true; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:30,382 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1471#(= 1 |__fpclassify_float_#res|)} {1414#true} #139#return; {1470#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:30,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {1450#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:33:30,384 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} ~y := #in~y; {1414#true} is VALID [2020-07-11 00:33:30,389 INFO L263 TraceCheckUtils]: 2: Hoare triple {1414#true} call #t~ret2 := __fpclassify_float(~x); {1450#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:30,389 INFO L280 TraceCheckUtils]: 3: Hoare triple {1450#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:33:30,389 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} havoc ~w~0; {1414#true} is VALID [2020-07-11 00:33:30,390 INFO L280 TraceCheckUtils]: 5: Hoare triple {1414#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L15-2 {1414#true} is VALID [2020-07-11 00:33:30,390 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L16 {1414#true} is VALID [2020-07-11 00:33:30,390 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17 {1414#true} is VALID [2020-07-11 00:33:30,390 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} ~w~0 := #t~mem0; {1414#true} is VALID [2020-07-11 00:33:30,391 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L18-1 {1414#true} is VALID [2020-07-11 00:33:30,391 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} havoc #t~union1; {1414#true} is VALID [2020-07-11 00:33:30,391 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} havoc #t~mem0; {1414#true} is VALID [2020-07-11 00:33:30,391 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L16-1 {1414#true} is VALID [2020-07-11 00:33:30,392 INFO L280 TraceCheckUtils]: 13: Hoare triple {1414#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1414#true} is VALID [2020-07-11 00:33:30,392 INFO L280 TraceCheckUtils]: 14: Hoare triple {1414#true} goto; {1414#true} is VALID [2020-07-11 00:33:30,392 INFO L280 TraceCheckUtils]: 15: Hoare triple {1414#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1414#true} is VALID [2020-07-11 00:33:30,392 INFO L280 TraceCheckUtils]: 16: Hoare triple {1414#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {1414#true} is VALID [2020-07-11 00:33:30,393 INFO L280 TraceCheckUtils]: 17: Hoare triple {1414#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {1414#true} is VALID [2020-07-11 00:33:30,393 INFO L280 TraceCheckUtils]: 18: Hoare triple {1414#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1414#true} is VALID [2020-07-11 00:33:30,395 INFO L280 TraceCheckUtils]: 19: Hoare triple {1414#true} #res := 1; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:30,396 INFO L280 TraceCheckUtils]: 20: Hoare triple {1471#(= 1 |__fpclassify_float_#res|)} assume true; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:30,397 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1471#(= 1 |__fpclassify_float_#res|)} {1414#true} #139#return; {1470#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:30,398 INFO L280 TraceCheckUtils]: 22: Hoare triple {1470#(= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1470#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:30,399 INFO L280 TraceCheckUtils]: 23: Hoare triple {1470#(= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2; {1415#false} is VALID [2020-07-11 00:33:30,399 INFO L280 TraceCheckUtils]: 24: Hoare triple {1415#false} havoc #t~ret2; {1415#false} is VALID [2020-07-11 00:33:30,399 INFO L280 TraceCheckUtils]: 25: Hoare triple {1415#false} #res := ~y; {1415#false} is VALID [2020-07-11 00:33:30,399 INFO L280 TraceCheckUtils]: 26: Hoare triple {1415#false} assume true; {1415#false} is VALID [2020-07-11 00:33:30,400 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1415#false} {1414#true} #135#return; {1415#false} is VALID [2020-07-11 00:33:30,401 INFO L263 TraceCheckUtils]: 0: Hoare triple {1414#true} call ULTIMATE.init(); {1449#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:33:30,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {1449#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1414#true} is VALID [2020-07-11 00:33:30,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#true} #valid := #valid[0 := 0]; {1414#true} is VALID [2020-07-11 00:33:30,402 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} assume 0 < #StackHeapBarrier; {1414#true} is VALID [2020-07-11 00:33:30,403 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume true; {1414#true} is VALID [2020-07-11 00:33:30,403 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1414#true} {1414#true} #143#return; {1414#true} is VALID [2020-07-11 00:33:30,403 INFO L263 TraceCheckUtils]: 6: Hoare triple {1414#true} call #t~ret10 := main(); {1414#true} is VALID [2020-07-11 00:33:30,403 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} ~x~0 := 0.0; {1414#true} is VALID [2020-07-11 00:33:30,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} ~y~0 := ~someUnaryFLOAToperation(0.0); {1414#true} is VALID [2020-07-11 00:33:30,405 INFO L263 TraceCheckUtils]: 9: Hoare triple {1414#true} call #t~ret7 := fmin_float(~x~0, ~y~0); {1450#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:30,405 INFO L280 TraceCheckUtils]: 10: Hoare triple {1450#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:33:30,405 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} ~y := #in~y; {1414#true} is VALID [2020-07-11 00:33:30,406 INFO L263 TraceCheckUtils]: 12: Hoare triple {1414#true} call #t~ret2 := __fpclassify_float(~x); {1450#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:30,407 INFO L280 TraceCheckUtils]: 13: Hoare triple {1450#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1414#true} is VALID [2020-07-11 00:33:30,407 INFO L280 TraceCheckUtils]: 14: Hoare triple {1414#true} havoc ~w~0; {1414#true} is VALID [2020-07-11 00:33:30,407 INFO L280 TraceCheckUtils]: 15: Hoare triple {1414#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L15-2 {1414#true} is VALID [2020-07-11 00:33:30,407 INFO L280 TraceCheckUtils]: 16: Hoare triple {1414#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L16 {1414#true} is VALID [2020-07-11 00:33:30,408 INFO L280 TraceCheckUtils]: 17: Hoare triple {1414#true} SUMMARY for call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L17 {1414#true} is VALID [2020-07-11 00:33:30,408 INFO L280 TraceCheckUtils]: 18: Hoare triple {1414#true} ~w~0 := #t~mem0; {1414#true} is VALID [2020-07-11 00:33:30,408 INFO L280 TraceCheckUtils]: 19: Hoare triple {1414#true} SUMMARY for call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L18-1 {1414#true} is VALID [2020-07-11 00:33:30,408 INFO L280 TraceCheckUtils]: 20: Hoare triple {1414#true} havoc #t~union1; {1414#true} is VALID [2020-07-11 00:33:30,408 INFO L280 TraceCheckUtils]: 21: Hoare triple {1414#true} havoc #t~mem0; {1414#true} is VALID [2020-07-11 00:33:30,409 INFO L280 TraceCheckUtils]: 22: Hoare triple {1414#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L16-1 {1414#true} is VALID [2020-07-11 00:33:30,409 INFO L280 TraceCheckUtils]: 23: Hoare triple {1414#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1414#true} is VALID [2020-07-11 00:33:30,409 INFO L280 TraceCheckUtils]: 24: Hoare triple {1414#true} goto; {1414#true} is VALID [2020-07-11 00:33:30,409 INFO L280 TraceCheckUtils]: 25: Hoare triple {1414#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1414#true} is VALID [2020-07-11 00:33:30,410 INFO L280 TraceCheckUtils]: 26: Hoare triple {1414#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {1414#true} is VALID [2020-07-11 00:33:30,410 INFO L280 TraceCheckUtils]: 27: Hoare triple {1414#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {1414#true} is VALID [2020-07-11 00:33:30,410 INFO L280 TraceCheckUtils]: 28: Hoare triple {1414#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1414#true} is VALID [2020-07-11 00:33:30,411 INFO L280 TraceCheckUtils]: 29: Hoare triple {1414#true} #res := 1; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:30,411 INFO L280 TraceCheckUtils]: 30: Hoare triple {1471#(= 1 |__fpclassify_float_#res|)} assume true; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:30,412 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1471#(= 1 |__fpclassify_float_#res|)} {1414#true} #139#return; {1470#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:30,413 INFO L280 TraceCheckUtils]: 32: Hoare triple {1470#(= 1 |fmin_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1470#(= 1 |fmin_float_#t~ret2|)} is VALID [2020-07-11 00:33:30,414 INFO L280 TraceCheckUtils]: 33: Hoare triple {1470#(= 1 |fmin_float_#t~ret2|)} assume 0 == #t~ret2; {1415#false} is VALID [2020-07-11 00:33:30,414 INFO L280 TraceCheckUtils]: 34: Hoare triple {1415#false} havoc #t~ret2; {1415#false} is VALID [2020-07-11 00:33:30,414 INFO L280 TraceCheckUtils]: 35: Hoare triple {1415#false} #res := ~y; {1415#false} is VALID [2020-07-11 00:33:30,414 INFO L280 TraceCheckUtils]: 36: Hoare triple {1415#false} assume true; {1415#false} is VALID [2020-07-11 00:33:30,414 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1415#false} {1414#true} #135#return; {1415#false} is VALID [2020-07-11 00:33:30,415 INFO L280 TraceCheckUtils]: 38: Hoare triple {1415#false} ~res~0 := #t~ret7; {1415#false} is VALID [2020-07-11 00:33:30,415 INFO L280 TraceCheckUtils]: 39: Hoare triple {1415#false} havoc #t~ret7; {1415#false} is VALID [2020-07-11 00:33:30,415 INFO L280 TraceCheckUtils]: 40: Hoare triple {1415#false} #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, ~someUnaryFLOAToperation(0.0)); {1415#false} is VALID [2020-07-11 00:33:30,415 INFO L280 TraceCheckUtils]: 41: Hoare triple {1415#false} assume !#t~short9; {1415#false} is VALID [2020-07-11 00:33:30,416 INFO L280 TraceCheckUtils]: 42: Hoare triple {1415#false} assume !#t~short9; {1415#false} is VALID [2020-07-11 00:33:30,416 INFO L280 TraceCheckUtils]: 43: Hoare triple {1415#false} havoc #t~short9; {1415#false} is VALID [2020-07-11 00:33:30,416 INFO L280 TraceCheckUtils]: 44: Hoare triple {1415#false} havoc #t~ret8; {1415#false} is VALID [2020-07-11 00:33:30,416 INFO L280 TraceCheckUtils]: 45: Hoare triple {1415#false} assume !false; {1415#false} is VALID [2020-07-11 00:33:30,419 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-11 00:33:30,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [501429487] [2020-07-11 00:33:30,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:30,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:33:30,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822926081] [2020-07-11 00:33:30,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-11 00:33:30,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:30,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:33:30,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:30,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:33:30,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:30,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:33:30,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:30,478 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 6 states. [2020-07-11 00:33:31,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:31,119 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2020-07-11 00:33:31,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:33:31,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-11 00:33:31,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-11 00:33:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-11 00:33:31,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2020-07-11 00:33:31,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:31,276 INFO L225 Difference]: With dead ends: 121 [2020-07-11 00:33:31,276 INFO L226 Difference]: Without dead ends: 90 [2020-07-11 00:33:31,277 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-11 00:33:31,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-11 00:33:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2020-07-11 00:33:31,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:31,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 85 states. [2020-07-11 00:33:31,342 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 85 states. [2020-07-11 00:33:31,342 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 85 states. [2020-07-11 00:33:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:31,347 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2020-07-11 00:33:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2020-07-11 00:33:31,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:31,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:31,349 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 90 states. [2020-07-11 00:33:31,349 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 90 states. [2020-07-11 00:33:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:31,354 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2020-07-11 00:33:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2020-07-11 00:33:31,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:31,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:31,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:31,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-11 00:33:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2020-07-11 00:33:31,360 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 46 [2020-07-11 00:33:31,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:31,361 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-07-11 00:33:31,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:31,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 94 transitions. [2020-07-11 00:33:31,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2020-07-11 00:33:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-11 00:33:31,498 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:31,498 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] [2020-07-11 00:33:31,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:33:31,499 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:31,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:31,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1331564627, now seen corresponding path program 1 times [2020-07-11 00:33:31,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:31,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219406546] [2020-07-11 00:33:31,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:31,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:33:31,769 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:407) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:390) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106) 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-11 00:33:31,778 INFO L168 Benchmark]: Toolchain (without parser) took 6243.63 ms. Allocated memory was 144.2 MB in the beginning and 285.2 MB in the end (delta: 141.0 MB). Free memory was 102.4 MB in the beginning and 229.6 MB in the end (delta: -127.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:31,779 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-11 00:33:31,779 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.54 ms. Allocated memory is still 144.2 MB. Free memory was 102.0 MB in the beginning and 90.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:31,782 INFO L168 Benchmark]: Boogie Preprocessor took 138.11 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 90.2 MB in the beginning and 178.7 MB in the end (delta: -88.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:31,788 INFO L168 Benchmark]: RCFGBuilder took 666.31 ms. Allocated memory is still 201.3 MB. Free memory was 178.0 MB in the beginning and 140.4 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:31,790 INFO L168 Benchmark]: TraceAbstraction took 5099.92 ms. Allocated memory was 201.3 MB in the beginning and 285.2 MB in the end (delta: 83.9 MB). Free memory was 140.4 MB in the beginning and 229.6 MB in the end (delta: -89.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:33:31,798 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.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 333.54 ms. Allocated memory is still 144.2 MB. Free memory was 102.0 MB in the beginning and 90.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.11 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 90.2 MB in the beginning and 178.7 MB in the end (delta: -88.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 666.31 ms. Allocated memory is still 201.3 MB. Free memory was 178.0 MB in the beginning and 140.4 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5099.92 ms. Allocated memory was 201.3 MB in the beginning and 285.2 MB in the end (delta: 83.9 MB). Free memory was 140.4 MB in the beginning and 229.6 MB in the end (delta: -89.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...