/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_1252b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:33:28,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:33:28,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:33:28,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:33:28,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:33:28,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:33:28,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:33:28,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:33:28,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:33:28,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:33:28,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:33:28,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:33:28,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:33:28,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:33:28,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:33:28,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:33:28,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:33:28,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:33:28,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:33:28,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:33:28,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:33:28,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:33:28,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:33:28,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:33:28,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:33:28,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:33:28,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:33:28,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:33:28,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:33:28,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:33:28,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:33:28,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:33:28,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:33:28,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:33:28,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:33:28,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:33:28,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:33:28,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:33:28,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:33:28,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:33:28,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:33:28,677 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:28,688 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:33:28,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:33:28,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:33:28,691 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:33:28,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:33:28,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:33:28,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:33:28,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:33:28,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:33:28,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:33:28,693 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:33:28,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:33:28,693 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:33:28,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:33:28,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:33:28,694 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:33:28,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:33:28,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:33:28,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:28,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:33:28,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:33:28,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:33:28,696 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:28,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:33:28,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:33:28,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:33:28,985 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:33:28,986 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:33:28,987 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1252b.c [2020-07-11 00:33:29,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/365f54e47/2fae4500561241bfb8111fc2921e212d/FLAGc59a97711 [2020-07-11 00:33:29,555 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:29,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1252b.c [2020-07-11 00:33:29,563 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/365f54e47/2fae4500561241bfb8111fc2921e212d/FLAGc59a97711 [2020-07-11 00:33:29,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/365f54e47/2fae4500561241bfb8111fc2921e212d [2020-07-11 00:33:29,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:29,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:29,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:29,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:29,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:29,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:29" (1/1) ... [2020-07-11 00:33:29,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9b0210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:29, skipping insertion in model container [2020-07-11 00:33:29,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:29" (1/1) ... [2020-07-11 00:33:29,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:30,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:30,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:30,261 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:30,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:30,399 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:30,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:30 WrapperNode [2020-07-11 00:33:30,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:30,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:30,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:30,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:30,412 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:30" (1/1) ... [2020-07-11 00:33:30,412 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:30" (1/1) ... [2020-07-11 00:33:30,421 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:30" (1/1) ... [2020-07-11 00:33:30,421 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:30" (1/1) ... [2020-07-11 00:33:30,434 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:30" (1/1) ... [2020-07-11 00:33:30,441 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:30" (1/1) ... [2020-07-11 00:33:30,443 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:30" (1/1) ... [2020-07-11 00:33:30,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:30,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:30,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:30,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:30,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:30" (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:30,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:30,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:30,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-11 00:33:30,509 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2020-07-11 00:33:30,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2020-07-11 00:33:30,509 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2020-07-11 00:33:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-11 00:33:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 00:33:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-11 00:33:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 00:33:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 00:33:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2020-07-11 00:33:30,510 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2020-07-11 00:33:30,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:30,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:30,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:30,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-11 00:33:30,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 00:33:31,052 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:31,053 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-11 00:33:31,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:31 BoogieIcfgContainer [2020-07-11 00:33:31,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:31,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:31,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:31,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:31,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:29" (1/3) ... [2020-07-11 00:33:31,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79390e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:31, skipping insertion in model container [2020-07-11 00:33:31,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:30" (2/3) ... [2020-07-11 00:33:31,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79390e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:31, skipping insertion in model container [2020-07-11 00:33:31,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:31" (3/3) ... [2020-07-11 00:33:31,066 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252b.c [2020-07-11 00:33:31,077 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:31,084 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:31,099 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:33:31,120 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:33:31,121 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:33:31,121 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:33:31,121 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:33:31,122 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:33:31,122 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:33:31,122 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:33:31,122 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:33:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2020-07-11 00:33:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 00:33:31,152 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:31,153 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:31,154 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:31,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:31,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2131665852, now seen corresponding path program 1 times [2020-07-11 00:33:31,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:31,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [382419783] [2020-07-11 00:33:31,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:31,411 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:31,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} #valid := #valid[0 := 0]; {92#true} is VALID [2020-07-11 00:33:31,412 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume 0 < #StackHeapBarrier; {92#true} is VALID [2020-07-11 00:33:31,412 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-11 00:33:31,413 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {92#true} {92#true} #143#return; {92#true} is VALID [2020-07-11 00:33:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:31,475 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:31,476 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} havoc ~w~0; {92#true} is VALID [2020-07-11 00:33:31,477 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-11 00:33:31,478 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:31,478 INFO L280 TraceCheckUtils]: 4: Hoare triple {93#false} #res := 2; {93#false} is VALID [2020-07-11 00:33:31,478 INFO L280 TraceCheckUtils]: 5: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-11 00:33:31,479 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {93#false} {92#true} #139#return; {93#false} is VALID [2020-07-11 00:33:31,479 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:31,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} ~y := #in~y; {92#true} is VALID [2020-07-11 00:33:31,482 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:31,483 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:31,483 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} havoc ~w~0; {92#true} is VALID [2020-07-11 00:33:31,484 INFO L280 TraceCheckUtils]: 5: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-11 00:33:31,484 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:31,485 INFO L280 TraceCheckUtils]: 7: Hoare triple {93#false} #res := 2; {93#false} is VALID [2020-07-11 00:33:31,485 INFO L280 TraceCheckUtils]: 8: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-11 00:33:31,485 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {93#false} {92#true} #139#return; {93#false} is VALID [2020-07-11 00:33:31,486 INFO L280 TraceCheckUtils]: 10: Hoare triple {93#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {93#false} is VALID [2020-07-11 00:33:31,486 INFO L280 TraceCheckUtils]: 11: Hoare triple {93#false} assume 0 == #t~ret2; {93#false} is VALID [2020-07-11 00:33:31,486 INFO L280 TraceCheckUtils]: 12: Hoare triple {93#false} havoc #t~ret2; {93#false} is VALID [2020-07-11 00:33:31,487 INFO L280 TraceCheckUtils]: 13: Hoare triple {93#false} #res := ~y; {93#false} is VALID [2020-07-11 00:33:31,487 INFO L280 TraceCheckUtils]: 14: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-11 00:33:31,488 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {93#false} {92#true} #135#return; {93#false} is VALID [2020-07-11 00:33:31,493 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:31,494 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:31,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} #valid := #valid[0 := 0]; {92#true} is VALID [2020-07-11 00:33:31,494 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} assume 0 < #StackHeapBarrier; {92#true} is VALID [2020-07-11 00:33:31,495 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-11 00:33:31,495 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {92#true} {92#true} #143#return; {92#true} is VALID [2020-07-11 00:33:31,495 INFO L263 TraceCheckUtils]: 6: Hoare triple {92#true} call #t~ret10 := main(); {92#true} is VALID [2020-07-11 00:33:31,496 INFO L280 TraceCheckUtils]: 7: Hoare triple {92#true} ~x~0 := 0.0; {92#true} is VALID [2020-07-11 00:33:31,496 INFO L280 TraceCheckUtils]: 8: Hoare triple {92#true} ~y~0 := ~someUnaryFLOAToperation(0.0); {92#true} is VALID [2020-07-11 00:33:31,498 INFO L263 TraceCheckUtils]: 9: Hoare triple {92#true} call #t~ret7 := fmax_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:31,499 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:31,499 INFO L280 TraceCheckUtils]: 11: Hoare triple {92#true} ~y := #in~y; {92#true} is VALID [2020-07-11 00:33:31,501 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:31,501 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:31,502 INFO L280 TraceCheckUtils]: 14: Hoare triple {92#true} havoc ~w~0; {92#true} is VALID [2020-07-11 00:33:31,503 INFO L280 TraceCheckUtils]: 15: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-11 00:33:31,503 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:31,503 INFO L280 TraceCheckUtils]: 17: Hoare triple {93#false} #res := 2; {93#false} is VALID [2020-07-11 00:33:31,504 INFO L280 TraceCheckUtils]: 18: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-11 00:33:31,504 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {93#false} {92#true} #139#return; {93#false} is VALID [2020-07-11 00:33:31,504 INFO L280 TraceCheckUtils]: 20: Hoare triple {93#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {93#false} is VALID [2020-07-11 00:33:31,505 INFO L280 TraceCheckUtils]: 21: Hoare triple {93#false} assume 0 == #t~ret2; {93#false} is VALID [2020-07-11 00:33:31,505 INFO L280 TraceCheckUtils]: 22: Hoare triple {93#false} havoc #t~ret2; {93#false} is VALID [2020-07-11 00:33:31,505 INFO L280 TraceCheckUtils]: 23: Hoare triple {93#false} #res := ~y; {93#false} is VALID [2020-07-11 00:33:31,506 INFO L280 TraceCheckUtils]: 24: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-11 00:33:31,506 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {93#false} {92#true} #135#return; {93#false} is VALID [2020-07-11 00:33:31,506 INFO L280 TraceCheckUtils]: 26: Hoare triple {93#false} ~res~0 := #t~ret7; {93#false} is VALID [2020-07-11 00:33:31,507 INFO L280 TraceCheckUtils]: 27: Hoare triple {93#false} havoc #t~ret7; {93#false} is VALID [2020-07-11 00:33:31,507 INFO L280 TraceCheckUtils]: 28: Hoare triple {93#false} #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {93#false} is VALID [2020-07-11 00:33:31,508 INFO L280 TraceCheckUtils]: 29: Hoare triple {93#false} assume !#t~short9; {93#false} is VALID [2020-07-11 00:33:31,508 INFO L280 TraceCheckUtils]: 30: Hoare triple {93#false} assume !#t~short9; {93#false} is VALID [2020-07-11 00:33:31,508 INFO L280 TraceCheckUtils]: 31: Hoare triple {93#false} havoc #t~ret8; {93#false} is VALID [2020-07-11 00:33:31,509 INFO L280 TraceCheckUtils]: 32: Hoare triple {93#false} havoc #t~short9; {93#false} is VALID [2020-07-11 00:33:31,509 INFO L280 TraceCheckUtils]: 33: Hoare triple {93#false} assume !false; {93#false} is VALID [2020-07-11 00:33:31,515 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:31,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [382419783] [2020-07-11 00:33:31,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:31,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 00:33:31,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250130078] [2020-07-11 00:33:31,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-07-11 00:33:31,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:31,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 00:33:31,597 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:31,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 00:33:31,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:31,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 00:33:31,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 00:33:31,611 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 4 states. [2020-07-11 00:33:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:32,272 INFO L93 Difference]: Finished difference Result 164 states and 192 transitions. [2020-07-11 00:33:32,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 00:33:32,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-07-11 00:33:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2020-07-11 00:33:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2020-07-11 00:33:32,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2020-07-11 00:33:32,588 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:32,623 INFO L225 Difference]: With dead ends: 164 [2020-07-11 00:33:32,626 INFO L226 Difference]: Without dead ends: 81 [2020-07-11 00:33:32,635 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:32,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-11 00:33:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-11 00:33:32,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:32,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:32,782 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:32,782 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:32,794 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-11 00:33:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-11 00:33:32,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:32,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:32,797 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:32,797 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-11 00:33:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:32,814 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-11 00:33:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-11 00:33:32,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:32,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:32,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:32,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-11 00:33:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-07-11 00:33:32,829 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 34 [2020-07-11 00:33:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:32,830 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-07-11 00:33:32,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 00:33:32,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 89 transitions. [2020-07-11 00:33:32,970 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:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-11 00:33:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-11 00:33:32,973 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:32,973 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:32,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:33:32,974 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:32,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:32,974 INFO L82 PathProgramCache]: Analyzing trace with hash -630897281, now seen corresponding path program 1 times [2020-07-11 00:33:32,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:32,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1025877736] [2020-07-11 00:33:32,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:33,074 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:33,074 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#true} #valid := #valid[0 := 0]; {781#true} is VALID [2020-07-11 00:33:33,075 INFO L280 TraceCheckUtils]: 2: Hoare triple {781#true} assume 0 < #StackHeapBarrier; {781#true} is VALID [2020-07-11 00:33:33,075 INFO L280 TraceCheckUtils]: 3: Hoare triple {781#true} assume true; {781#true} is VALID [2020-07-11 00:33:33,075 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {781#true} {781#true} #143#return; {781#true} is VALID [2020-07-11 00:33:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:33,218 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:33,218 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#true} havoc ~w~0; {781#true} is VALID [2020-07-11 00:33:33,219 INFO L280 TraceCheckUtils]: 2: Hoare triple {781#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L23-2 {781#true} is VALID [2020-07-11 00:33:33,219 INFO L280 TraceCheckUtils]: 3: Hoare triple {781#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L24 {781#true} is VALID [2020-07-11 00:33:33,219 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: L25 {781#true} is VALID [2020-07-11 00:33:33,220 INFO L280 TraceCheckUtils]: 5: Hoare triple {781#true} ~w~0 := #t~mem0; {781#true} is VALID [2020-07-11 00:33:33,220 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: L26-1 {781#true} is VALID [2020-07-11 00:33:33,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {781#true} havoc #t~mem0; {781#true} is VALID [2020-07-11 00:33:33,221 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#true} havoc #t~union1; {781#true} is VALID [2020-07-11 00:33:33,221 INFO L280 TraceCheckUtils]: 9: Hoare triple {781#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L24-1 {781#true} is VALID [2020-07-11 00:33:33,221 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:33,222 INFO L280 TraceCheckUtils]: 11: Hoare triple {781#true} goto; {781#true} is VALID [2020-07-11 00:33:33,222 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:33,224 INFO L280 TraceCheckUtils]: 13: Hoare triple {781#true} #res := 2; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:33,225 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:33,226 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {832#(<= 2 |__fpclassify_float_#res|)} {781#true} #139#return; {831#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-11 00:33:33,227 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:33,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#true} ~y := #in~y; {781#true} is VALID [2020-07-11 00:33:33,228 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:33,228 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:33,229 INFO L280 TraceCheckUtils]: 4: Hoare triple {781#true} havoc ~w~0; {781#true} is VALID [2020-07-11 00:33:33,229 INFO L280 TraceCheckUtils]: 5: Hoare triple {781#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L23-2 {781#true} is VALID [2020-07-11 00:33:33,229 INFO L280 TraceCheckUtils]: 6: Hoare triple {781#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L24 {781#true} is VALID [2020-07-11 00:33:33,230 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: L25 {781#true} is VALID [2020-07-11 00:33:33,230 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#true} ~w~0 := #t~mem0; {781#true} is VALID [2020-07-11 00:33:33,230 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: L26-1 {781#true} is VALID [2020-07-11 00:33:33,231 INFO L280 TraceCheckUtils]: 10: Hoare triple {781#true} havoc #t~mem0; {781#true} is VALID [2020-07-11 00:33:33,231 INFO L280 TraceCheckUtils]: 11: Hoare triple {781#true} havoc #t~union1; {781#true} is VALID [2020-07-11 00:33:33,231 INFO L280 TraceCheckUtils]: 12: Hoare triple {781#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L24-1 {781#true} is VALID [2020-07-11 00:33:33,231 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:33,232 INFO L280 TraceCheckUtils]: 14: Hoare triple {781#true} goto; {781#true} is VALID [2020-07-11 00:33:33,232 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:33,233 INFO L280 TraceCheckUtils]: 16: Hoare triple {781#true} #res := 2; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:33,234 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:33,235 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {832#(<= 2 |__fpclassify_float_#res|)} {781#true} #139#return; {831#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-11 00:33:33,236 INFO L280 TraceCheckUtils]: 19: Hoare triple {831#(<= 2 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {831#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-11 00:33:33,237 INFO L280 TraceCheckUtils]: 20: Hoare triple {831#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {782#false} is VALID [2020-07-11 00:33:33,237 INFO L280 TraceCheckUtils]: 21: Hoare triple {782#false} havoc #t~ret2; {782#false} is VALID [2020-07-11 00:33:33,237 INFO L280 TraceCheckUtils]: 22: Hoare triple {782#false} #res := ~y; {782#false} is VALID [2020-07-11 00:33:33,238 INFO L280 TraceCheckUtils]: 23: Hoare triple {782#false} assume true; {782#false} is VALID [2020-07-11 00:33:33,238 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {782#false} {781#true} #135#return; {782#false} is VALID [2020-07-11 00:33:33,240 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:33,240 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:33,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {781#true} #valid := #valid[0 := 0]; {781#true} is VALID [2020-07-11 00:33:33,241 INFO L280 TraceCheckUtils]: 3: Hoare triple {781#true} assume 0 < #StackHeapBarrier; {781#true} is VALID [2020-07-11 00:33:33,241 INFO L280 TraceCheckUtils]: 4: Hoare triple {781#true} assume true; {781#true} is VALID [2020-07-11 00:33:33,242 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {781#true} {781#true} #143#return; {781#true} is VALID [2020-07-11 00:33:33,242 INFO L263 TraceCheckUtils]: 6: Hoare triple {781#true} call #t~ret10 := main(); {781#true} is VALID [2020-07-11 00:33:33,242 INFO L280 TraceCheckUtils]: 7: Hoare triple {781#true} ~x~0 := 0.0; {781#true} is VALID [2020-07-11 00:33:33,242 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#true} ~y~0 := ~someUnaryFLOAToperation(0.0); {781#true} is VALID [2020-07-11 00:33:33,244 INFO L263 TraceCheckUtils]: 9: Hoare triple {781#true} call #t~ret7 := fmax_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:33,244 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:33,245 INFO L280 TraceCheckUtils]: 11: Hoare triple {781#true} ~y := #in~y; {781#true} is VALID [2020-07-11 00:33:33,246 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:33,246 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:33,246 INFO L280 TraceCheckUtils]: 14: Hoare triple {781#true} havoc ~w~0; {781#true} is VALID [2020-07-11 00:33:33,247 INFO L280 TraceCheckUtils]: 15: Hoare triple {781#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L23-2 {781#true} is VALID [2020-07-11 00:33:33,247 INFO L280 TraceCheckUtils]: 16: Hoare triple {781#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L24 {781#true} is VALID [2020-07-11 00:33:33,247 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: L25 {781#true} is VALID [2020-07-11 00:33:33,248 INFO L280 TraceCheckUtils]: 18: Hoare triple {781#true} ~w~0 := #t~mem0; {781#true} is VALID [2020-07-11 00:33:33,248 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: L26-1 {781#true} is VALID [2020-07-11 00:33:33,248 INFO L280 TraceCheckUtils]: 20: Hoare triple {781#true} havoc #t~mem0; {781#true} is VALID [2020-07-11 00:33:33,249 INFO L280 TraceCheckUtils]: 21: Hoare triple {781#true} havoc #t~union1; {781#true} is VALID [2020-07-11 00:33:33,249 INFO L280 TraceCheckUtils]: 22: Hoare triple {781#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L24-1 {781#true} is VALID [2020-07-11 00:33:33,249 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:33,249 INFO L280 TraceCheckUtils]: 24: Hoare triple {781#true} goto; {781#true} is VALID [2020-07-11 00:33:33,250 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:33,251 INFO L280 TraceCheckUtils]: 26: Hoare triple {781#true} #res := 2; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:33,251 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:33,252 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {832#(<= 2 |__fpclassify_float_#res|)} {781#true} #139#return; {831#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-11 00:33:33,253 INFO L280 TraceCheckUtils]: 29: Hoare triple {831#(<= 2 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {831#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-11 00:33:33,254 INFO L280 TraceCheckUtils]: 30: Hoare triple {831#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {782#false} is VALID [2020-07-11 00:33:33,254 INFO L280 TraceCheckUtils]: 31: Hoare triple {782#false} havoc #t~ret2; {782#false} is VALID [2020-07-11 00:33:33,255 INFO L280 TraceCheckUtils]: 32: Hoare triple {782#false} #res := ~y; {782#false} is VALID [2020-07-11 00:33:33,255 INFO L280 TraceCheckUtils]: 33: Hoare triple {782#false} assume true; {782#false} is VALID [2020-07-11 00:33:33,255 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {782#false} {781#true} #135#return; {782#false} is VALID [2020-07-11 00:33:33,256 INFO L280 TraceCheckUtils]: 35: Hoare triple {782#false} ~res~0 := #t~ret7; {782#false} is VALID [2020-07-11 00:33:33,256 INFO L280 TraceCheckUtils]: 36: Hoare triple {782#false} havoc #t~ret7; {782#false} is VALID [2020-07-11 00:33:33,256 INFO L280 TraceCheckUtils]: 37: Hoare triple {782#false} #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {782#false} is VALID [2020-07-11 00:33:33,256 INFO L280 TraceCheckUtils]: 38: Hoare triple {782#false} assume !#t~short9; {782#false} is VALID [2020-07-11 00:33:33,257 INFO L280 TraceCheckUtils]: 39: Hoare triple {782#false} assume !#t~short9; {782#false} is VALID [2020-07-11 00:33:33,257 INFO L280 TraceCheckUtils]: 40: Hoare triple {782#false} havoc #t~ret8; {782#false} is VALID [2020-07-11 00:33:33,257 INFO L280 TraceCheckUtils]: 41: Hoare triple {782#false} havoc #t~short9; {782#false} is VALID [2020-07-11 00:33:33,257 INFO L280 TraceCheckUtils]: 42: Hoare triple {782#false} assume !false; {782#false} is VALID [2020-07-11 00:33:33,260 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:33,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1025877736] [2020-07-11 00:33:33,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:33,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:33:33,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160537197] [2020-07-11 00:33:33,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-11 00:33:33,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:33,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:33:33,314 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:33,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:33:33,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:33,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:33:33,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:33,315 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2020-07-11 00:33:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:34,027 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2020-07-11 00:33:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:33:34,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-11 00:33:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-11 00:33:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-11 00:33:34,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2020-07-11 00:33:34,171 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:34,181 INFO L225 Difference]: With dead ends: 117 [2020-07-11 00:33:34,181 INFO L226 Difference]: Without dead ends: 86 [2020-07-11 00:33:34,183 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:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-11 00:33:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2020-07-11 00:33:34,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:34,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 85 states. [2020-07-11 00:33:34,250 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 85 states. [2020-07-11 00:33:34,250 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 85 states. [2020-07-11 00:33:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:34,255 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-07-11 00:33:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-07-11 00:33:34,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:34,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:34,257 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 86 states. [2020-07-11 00:33:34,257 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 86 states. [2020-07-11 00:33:34,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:34,262 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-07-11 00:33:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-07-11 00:33:34,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:34,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:34,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:34,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-11 00:33:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2020-07-11 00:33:34,268 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 43 [2020-07-11 00:33:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:34,268 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-07-11 00:33:34,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:34,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 94 transitions. [2020-07-11 00:33:34,379 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:34,379 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2020-07-11 00:33:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-11 00:33:34,382 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:34,382 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:34,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:34,383 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:34,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:34,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1681903777, now seen corresponding path program 1 times [2020-07-11 00:33:34,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:34,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1239890996] [2020-07-11 00:33:34,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:34,510 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:34,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} #valid := #valid[0 := 0]; {1414#true} is VALID [2020-07-11 00:33:34,511 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#true} assume 0 < #StackHeapBarrier; {1414#true} is VALID [2020-07-11 00:33:34,511 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} assume true; {1414#true} is VALID [2020-07-11 00:33:34,511 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1414#true} {1414#true} #143#return; {1414#true} is VALID [2020-07-11 00:33:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:34,610 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:34,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} havoc ~w~0; {1414#true} is VALID [2020-07-11 00:33:34,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L23-2 {1414#true} is VALID [2020-07-11 00:33:34,611 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L24 {1414#true} is VALID [2020-07-11 00:33:34,611 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: L25 {1414#true} is VALID [2020-07-11 00:33:34,612 INFO L280 TraceCheckUtils]: 5: Hoare triple {1414#true} ~w~0 := #t~mem0; {1414#true} is VALID [2020-07-11 00:33:34,612 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: L26-1 {1414#true} is VALID [2020-07-11 00:33:34,612 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} havoc #t~mem0; {1414#true} is VALID [2020-07-11 00:33:34,612 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} havoc #t~union1; {1414#true} is VALID [2020-07-11 00:33:34,612 INFO L280 TraceCheckUtils]: 9: Hoare triple {1414#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L24-1 {1414#true} is VALID [2020-07-11 00:33:34,613 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:34,613 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} goto; {1414#true} is VALID [2020-07-11 00:33:34,613 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:34,613 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:34,614 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:34,614 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:34,615 INFO L280 TraceCheckUtils]: 16: Hoare triple {1414#true} #res := 1; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:34,615 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:34,617 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1471#(= 1 |__fpclassify_float_#res|)} {1414#true} #139#return; {1470#(= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-11 00:33:34,618 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:34,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} ~y := #in~y; {1414#true} is VALID [2020-07-11 00:33:34,619 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:34,620 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:34,620 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} havoc ~w~0; {1414#true} is VALID [2020-07-11 00:33:34,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {1414#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L23-2 {1414#true} is VALID [2020-07-11 00:33:34,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {1414#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L24 {1414#true} is VALID [2020-07-11 00:33:34,621 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: L25 {1414#true} is VALID [2020-07-11 00:33:34,621 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} ~w~0 := #t~mem0; {1414#true} is VALID [2020-07-11 00:33:34,621 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: L26-1 {1414#true} is VALID [2020-07-11 00:33:34,621 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} havoc #t~mem0; {1414#true} is VALID [2020-07-11 00:33:34,622 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} havoc #t~union1; {1414#true} is VALID [2020-07-11 00:33:34,622 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L24-1 {1414#true} is VALID [2020-07-11 00:33:34,622 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:34,622 INFO L280 TraceCheckUtils]: 14: Hoare triple {1414#true} goto; {1414#true} is VALID [2020-07-11 00:33:34,623 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:34,623 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:34,623 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:34,623 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:34,625 INFO L280 TraceCheckUtils]: 19: Hoare triple {1414#true} #res := 1; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:34,628 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:34,630 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1471#(= 1 |__fpclassify_float_#res|)} {1414#true} #139#return; {1470#(= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-11 00:33:34,631 INFO L280 TraceCheckUtils]: 22: Hoare triple {1470#(= 1 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1470#(= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-11 00:33:34,633 INFO L280 TraceCheckUtils]: 23: Hoare triple {1470#(= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {1415#false} is VALID [2020-07-11 00:33:34,634 INFO L280 TraceCheckUtils]: 24: Hoare triple {1415#false} havoc #t~ret2; {1415#false} is VALID [2020-07-11 00:33:34,634 INFO L280 TraceCheckUtils]: 25: Hoare triple {1415#false} #res := ~y; {1415#false} is VALID [2020-07-11 00:33:34,634 INFO L280 TraceCheckUtils]: 26: Hoare triple {1415#false} assume true; {1415#false} is VALID [2020-07-11 00:33:34,635 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1415#false} {1414#true} #135#return; {1415#false} is VALID [2020-07-11 00:33:34,637 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:34,637 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:34,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#true} #valid := #valid[0 := 0]; {1414#true} is VALID [2020-07-11 00:33:34,638 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} assume 0 < #StackHeapBarrier; {1414#true} is VALID [2020-07-11 00:33:34,638 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume true; {1414#true} is VALID [2020-07-11 00:33:34,639 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1414#true} {1414#true} #143#return; {1414#true} is VALID [2020-07-11 00:33:34,639 INFO L263 TraceCheckUtils]: 6: Hoare triple {1414#true} call #t~ret10 := main(); {1414#true} is VALID [2020-07-11 00:33:34,639 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} ~x~0 := 0.0; {1414#true} is VALID [2020-07-11 00:33:34,639 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} ~y~0 := ~someUnaryFLOAToperation(0.0); {1414#true} is VALID [2020-07-11 00:33:34,641 INFO L263 TraceCheckUtils]: 9: Hoare triple {1414#true} call #t~ret7 := fmax_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:34,641 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:34,642 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} ~y := #in~y; {1414#true} is VALID [2020-07-11 00:33:34,643 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:34,643 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:34,643 INFO L280 TraceCheckUtils]: 14: Hoare triple {1414#true} havoc ~w~0; {1414#true} is VALID [2020-07-11 00:33:34,644 INFO L280 TraceCheckUtils]: 15: Hoare triple {1414#true} SUMMARY for call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4); srcloc: L23-2 {1414#true} is VALID [2020-07-11 00:33:34,644 INFO L280 TraceCheckUtils]: 16: Hoare triple {1414#true} SUMMARY for call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); srcloc: L24 {1414#true} is VALID [2020-07-11 00:33:34,644 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: L25 {1414#true} is VALID [2020-07-11 00:33:34,645 INFO L280 TraceCheckUtils]: 18: Hoare triple {1414#true} ~w~0 := #t~mem0; {1414#true} is VALID [2020-07-11 00:33:34,645 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: L26-1 {1414#true} is VALID [2020-07-11 00:33:34,645 INFO L280 TraceCheckUtils]: 20: Hoare triple {1414#true} havoc #t~mem0; {1414#true} is VALID [2020-07-11 00:33:34,645 INFO L280 TraceCheckUtils]: 21: Hoare triple {1414#true} havoc #t~union1; {1414#true} is VALID [2020-07-11 00:33:34,646 INFO L280 TraceCheckUtils]: 22: Hoare triple {1414#true} SUMMARY for call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); srcloc: L24-1 {1414#true} is VALID [2020-07-11 00:33:34,646 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:34,646 INFO L280 TraceCheckUtils]: 24: Hoare triple {1414#true} goto; {1414#true} is VALID [2020-07-11 00:33:34,646 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:34,647 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:34,647 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:34,647 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:34,648 INFO L280 TraceCheckUtils]: 29: Hoare triple {1414#true} #res := 1; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-11 00:33:34,649 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:34,650 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1471#(= 1 |__fpclassify_float_#res|)} {1414#true} #139#return; {1470#(= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-11 00:33:34,651 INFO L280 TraceCheckUtils]: 32: Hoare triple {1470#(= 1 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1470#(= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-11 00:33:34,651 INFO L280 TraceCheckUtils]: 33: Hoare triple {1470#(= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {1415#false} is VALID [2020-07-11 00:33:34,652 INFO L280 TraceCheckUtils]: 34: Hoare triple {1415#false} havoc #t~ret2; {1415#false} is VALID [2020-07-11 00:33:34,652 INFO L280 TraceCheckUtils]: 35: Hoare triple {1415#false} #res := ~y; {1415#false} is VALID [2020-07-11 00:33:34,652 INFO L280 TraceCheckUtils]: 36: Hoare triple {1415#false} assume true; {1415#false} is VALID [2020-07-11 00:33:34,653 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1415#false} {1414#true} #135#return; {1415#false} is VALID [2020-07-11 00:33:34,653 INFO L280 TraceCheckUtils]: 38: Hoare triple {1415#false} ~res~0 := #t~ret7; {1415#false} is VALID [2020-07-11 00:33:34,653 INFO L280 TraceCheckUtils]: 39: Hoare triple {1415#false} havoc #t~ret7; {1415#false} is VALID [2020-07-11 00:33:34,653 INFO L280 TraceCheckUtils]: 40: Hoare triple {1415#false} #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {1415#false} is VALID [2020-07-11 00:33:34,653 INFO L280 TraceCheckUtils]: 41: Hoare triple {1415#false} assume !#t~short9; {1415#false} is VALID [2020-07-11 00:33:34,654 INFO L280 TraceCheckUtils]: 42: Hoare triple {1415#false} assume !#t~short9; {1415#false} is VALID [2020-07-11 00:33:34,654 INFO L280 TraceCheckUtils]: 43: Hoare triple {1415#false} havoc #t~ret8; {1415#false} is VALID [2020-07-11 00:33:34,654 INFO L280 TraceCheckUtils]: 44: Hoare triple {1415#false} havoc #t~short9; {1415#false} is VALID [2020-07-11 00:33:34,654 INFO L280 TraceCheckUtils]: 45: Hoare triple {1415#false} assume !false; {1415#false} is VALID [2020-07-11 00:33:34,657 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:34,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1239890996] [2020-07-11 00:33:34,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:34,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 00:33:34,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359575886] [2020-07-11 00:33:34,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-11 00:33:34,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:34,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:33:34,727 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:34,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:33:34,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:34,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:33:34,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:34,729 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 6 states. [2020-07-11 00:33:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:35,369 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2020-07-11 00:33:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:33:35,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-11 00:33:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-11 00:33:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:33:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-11 00:33:35,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2020-07-11 00:33:35,516 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:35,520 INFO L225 Difference]: With dead ends: 121 [2020-07-11 00:33:35,521 INFO L226 Difference]: Without dead ends: 90 [2020-07-11 00:33:35,521 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:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-11 00:33:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2020-07-11 00:33:35,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:35,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 85 states. [2020-07-11 00:33:35,598 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 85 states. [2020-07-11 00:33:35,598 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 85 states. [2020-07-11 00:33:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:35,605 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2020-07-11 00:33:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2020-07-11 00:33:35,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:35,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:35,606 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 90 states. [2020-07-11 00:33:35,607 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 90 states. [2020-07-11 00:33:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:35,612 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2020-07-11 00:33:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2020-07-11 00:33:35,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:35,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:35,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:35,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-11 00:33:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2020-07-11 00:33:35,622 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 46 [2020-07-11 00:33:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:35,623 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-07-11 00:33:35,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:33:35,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 94 transitions. [2020-07-11 00:33:35,741 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:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2020-07-11 00:33:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-11 00:33:35,742 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:35,743 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:35,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:33:35,743 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash -969429089, now seen corresponding path program 1 times [2020-07-11 00:33:35,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:35,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1452353921] [2020-07-11 00:33:35,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:33:36,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:33:36,034 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:36,040 INFO L168 Benchmark]: Toolchain (without parser) took 6064.75 ms. Allocated memory was 137.9 MB in the beginning and 286.3 MB in the end (delta: 148.4 MB). Free memory was 102.6 MB in the beginning and 226.9 MB in the end (delta: -124.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:36,041 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 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:36,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.79 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 102.4 MB in the beginning and 180.3 MB in the end (delta: -77.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:36,043 INFO L168 Benchmark]: Boogie Preprocessor took 45.76 ms. Allocated memory is still 201.3 MB. Free memory was 180.3 MB in the beginning and 177.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:36,044 INFO L168 Benchmark]: RCFGBuilder took 611.41 ms. Allocated memory is still 201.3 MB. Free memory was 177.9 MB in the beginning and 140.0 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:36,044 INFO L168 Benchmark]: TraceAbstraction took 4977.91 ms. Allocated memory was 201.3 MB in the beginning and 286.3 MB in the end (delta: 84.9 MB). Free memory was 139.3 MB in the beginning and 226.9 MB in the end (delta: -87.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:33:36,048 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.29 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 423.79 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 102.4 MB in the beginning and 180.3 MB in the end (delta: -77.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.76 ms. Allocated memory is still 201.3 MB. Free memory was 180.3 MB in the beginning and 177.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 611.41 ms. Allocated memory is still 201.3 MB. Free memory was 177.9 MB in the beginning and 140.0 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4977.91 ms. Allocated memory was 201.3 MB in the beginning and 286.3 MB in the end (delta: 84.9 MB). Free memory was 139.3 MB in the beginning and 226.9 MB in the end (delta: -87.6 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...