/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1252b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:13:45,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:13:45,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:13:45,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:13:45,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:13:45,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:13:45,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:13:45,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:13:45,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:13:45,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:13:45,567 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:13:45,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:13:45,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:13:45,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:13:45,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:13:45,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:13:45,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:13:45,575 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:13:45,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:13:45,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:13:45,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:13:45,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:13:45,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:13:45,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:13:45,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:13:45,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:13:45,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:13:45,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:13:45,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:13:45,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:13:45,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:13:45,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:13:45,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:13:45,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:13:45,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:13:45,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:13:45,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:13:45,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:13:45,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:13:45,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:13:45,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:13:45,605 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:13:45,613 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:13:45,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:13:45,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:13:45,614 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:13:45,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:13:45,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:13:45,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:13:45,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:13:45,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:13:45,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:13:45,616 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:13:45,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:13:45,616 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:13:45,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:13:45,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:13:45,617 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:13:45,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:13:45,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:13:45,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:13:45,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:13:45,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:13:45,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:13:45,618 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:13:45,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:13:45,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:13:45,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:13:45,925 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:13:45,925 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:13:45,926 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-18 00:13:45,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1960942/e105e0f6c3cf42a695ba5a144ba47439/FLAG4b01bfb54 [2020-07-18 00:13:46,389 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:13:46,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1252b.c [2020-07-18 00:13:46,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1960942/e105e0f6c3cf42a695ba5a144ba47439/FLAG4b01bfb54 [2020-07-18 00:13:46,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1960942/e105e0f6c3cf42a695ba5a144ba47439 [2020-07-18 00:13:46,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:13:46,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:13:46,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:13:46,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:13:46,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:13:46,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:13:46" (1/1) ... [2020-07-18 00:13:46,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51390d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:46, skipping insertion in model container [2020-07-18 00:13:46,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:13:46" (1/1) ... [2020-07-18 00:13:46,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:13:46,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:13:47,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:13:47,041 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:13:47,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:13:47,188 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:13:47,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:47 WrapperNode [2020-07-18 00:13:47,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:13:47,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:13:47,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:13:47,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:13:47,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:47" (1/1) ... [2020-07-18 00:13:47,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:47" (1/1) ... [2020-07-18 00:13:47,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:47" (1/1) ... [2020-07-18 00:13:47,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:47" (1/1) ... [2020-07-18 00:13:47,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:47" (1/1) ... [2020-07-18 00:13:47,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:47" (1/1) ... [2020-07-18 00:13:47,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:47" (1/1) ... [2020-07-18 00:13:47,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:13:47,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:13:47,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:13:47,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:13:47,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:47" (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-18 00:13:47,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:13:47,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:13:47,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-18 00:13:47,300 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2020-07-18 00:13:47,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2020-07-18 00:13:47,300 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:13:47,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:13:47,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2020-07-18 00:13:47,300 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-18 00:13:47,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:13:47,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-18 00:13:47,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:13:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:13:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2020-07-18 00:13:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2020-07-18 00:13:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:13:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:13:47,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:13:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:13:47,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-18 00:13:47,809 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:13:47,810 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-18 00:13:47,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:13:47 BoogieIcfgContainer [2020-07-18 00:13:47,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:13:47,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:13:47,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:13:47,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:13:47,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:13:46" (1/3) ... [2020-07-18 00:13:47,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735aa83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:13:47, skipping insertion in model container [2020-07-18 00:13:47,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:47" (2/3) ... [2020-07-18 00:13:47,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735aa83f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:13:47, skipping insertion in model container [2020-07-18 00:13:47,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:13:47" (3/3) ... [2020-07-18 00:13:47,823 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252b.c [2020-07-18 00:13:47,833 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:13:47,841 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:13:47,853 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:13:47,874 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:13:47,875 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:13:47,875 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:13:47,875 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:13:47,875 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:13:47,875 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:13:47,875 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:13:47,876 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:13:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2020-07-18 00:13:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-18 00:13:47,903 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:47,904 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-18 00:13:47,905 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:47,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2131665852, now seen corresponding path program 1 times [2020-07-18 00:13:47,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:47,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [421202564] [2020-07-18 00:13:47,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:48,138 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-18 00:13:48,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} #valid := #valid[0 := 0]; {92#true} is VALID [2020-07-18 00:13:48,140 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume 0 < #StackHeapBarrier; {92#true} is VALID [2020-07-18 00:13:48,141 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-18 00:13:48,142 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {92#true} {92#true} #143#return; {92#true} is VALID [2020-07-18 00:13:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:48,231 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-18 00:13:48,232 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} havoc ~w~0; {92#true} is VALID [2020-07-18 00:13:48,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-18 00:13:48,234 INFO L280 TraceCheckUtils]: 3: Hoare triple {93#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {93#false} is VALID [2020-07-18 00:13:48,234 INFO L280 TraceCheckUtils]: 4: Hoare triple {93#false} #res := 2; {93#false} is VALID [2020-07-18 00:13:48,235 INFO L280 TraceCheckUtils]: 5: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-18 00:13:48,235 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {93#false} {92#true} #139#return; {93#false} is VALID [2020-07-18 00:13:48,236 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-18 00:13:48,236 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} ~y := #in~y; {92#true} is VALID [2020-07-18 00:13:48,239 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-18 00:13:48,239 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-18 00:13:48,240 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} havoc ~w~0; {92#true} is VALID [2020-07-18 00:13:48,241 INFO L280 TraceCheckUtils]: 5: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-18 00:13:48,241 INFO L280 TraceCheckUtils]: 6: Hoare triple {93#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {93#false} is VALID [2020-07-18 00:13:48,242 INFO L280 TraceCheckUtils]: 7: Hoare triple {93#false} #res := 2; {93#false} is VALID [2020-07-18 00:13:48,242 INFO L280 TraceCheckUtils]: 8: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-18 00:13:48,242 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {93#false} {92#true} #139#return; {93#false} is VALID [2020-07-18 00:13:48,243 INFO L280 TraceCheckUtils]: 10: Hoare triple {93#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {93#false} is VALID [2020-07-18 00:13:48,243 INFO L280 TraceCheckUtils]: 11: Hoare triple {93#false} assume 0 == #t~ret2; {93#false} is VALID [2020-07-18 00:13:48,244 INFO L280 TraceCheckUtils]: 12: Hoare triple {93#false} havoc #t~ret2; {93#false} is VALID [2020-07-18 00:13:48,244 INFO L280 TraceCheckUtils]: 13: Hoare triple {93#false} #res := ~y; {93#false} is VALID [2020-07-18 00:13:48,246 INFO L280 TraceCheckUtils]: 14: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-18 00:13:48,247 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {93#false} {92#true} #135#return; {93#false} is VALID [2020-07-18 00:13:48,251 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-18 00:13:48,251 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-18 00:13:48,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} #valid := #valid[0 := 0]; {92#true} is VALID [2020-07-18 00:13:48,252 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} assume 0 < #StackHeapBarrier; {92#true} is VALID [2020-07-18 00:13:48,252 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-18 00:13:48,253 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {92#true} {92#true} #143#return; {92#true} is VALID [2020-07-18 00:13:48,253 INFO L263 TraceCheckUtils]: 6: Hoare triple {92#true} call #t~ret10 := main(); {92#true} is VALID [2020-07-18 00:13:48,254 INFO L280 TraceCheckUtils]: 7: Hoare triple {92#true} ~x~0 := 0.0; {92#true} is VALID [2020-07-18 00:13:48,257 INFO L280 TraceCheckUtils]: 8: Hoare triple {92#true} ~y~0 := ~someUnaryFLOAToperation(0.0); {92#true} is VALID [2020-07-18 00:13:48,260 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-18 00:13:48,261 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-18 00:13:48,261 INFO L280 TraceCheckUtils]: 11: Hoare triple {92#true} ~y := #in~y; {92#true} is VALID [2020-07-18 00:13:48,263 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-18 00:13:48,264 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-18 00:13:48,264 INFO L280 TraceCheckUtils]: 14: Hoare triple {92#true} havoc ~w~0; {92#true} is VALID [2020-07-18 00:13:48,265 INFO L280 TraceCheckUtils]: 15: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-18 00:13:48,265 INFO L280 TraceCheckUtils]: 16: Hoare triple {93#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {93#false} is VALID [2020-07-18 00:13:48,265 INFO L280 TraceCheckUtils]: 17: Hoare triple {93#false} #res := 2; {93#false} is VALID [2020-07-18 00:13:48,266 INFO L280 TraceCheckUtils]: 18: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-18 00:13:48,266 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {93#false} {92#true} #139#return; {93#false} is VALID [2020-07-18 00:13:48,266 INFO L280 TraceCheckUtils]: 20: Hoare triple {93#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {93#false} is VALID [2020-07-18 00:13:48,267 INFO L280 TraceCheckUtils]: 21: Hoare triple {93#false} assume 0 == #t~ret2; {93#false} is VALID [2020-07-18 00:13:48,267 INFO L280 TraceCheckUtils]: 22: Hoare triple {93#false} havoc #t~ret2; {93#false} is VALID [2020-07-18 00:13:48,267 INFO L280 TraceCheckUtils]: 23: Hoare triple {93#false} #res := ~y; {93#false} is VALID [2020-07-18 00:13:48,268 INFO L280 TraceCheckUtils]: 24: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-18 00:13:48,268 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {93#false} {92#true} #135#return; {93#false} is VALID [2020-07-18 00:13:48,272 INFO L280 TraceCheckUtils]: 26: Hoare triple {93#false} ~res~0 := #t~ret7; {93#false} is VALID [2020-07-18 00:13:48,272 INFO L280 TraceCheckUtils]: 27: Hoare triple {93#false} havoc #t~ret7; {93#false} is VALID [2020-07-18 00:13:48,273 INFO L280 TraceCheckUtils]: 28: Hoare triple {93#false} #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {93#false} is VALID [2020-07-18 00:13:48,273 INFO L280 TraceCheckUtils]: 29: Hoare triple {93#false} assume !#t~short9; {93#false} is VALID [2020-07-18 00:13:48,273 INFO L280 TraceCheckUtils]: 30: Hoare triple {93#false} assume !#t~short9; {93#false} is VALID [2020-07-18 00:13:48,274 INFO L280 TraceCheckUtils]: 31: Hoare triple {93#false} havoc #t~short9; {93#false} is VALID [2020-07-18 00:13:48,274 INFO L280 TraceCheckUtils]: 32: Hoare triple {93#false} havoc #t~ret8; {93#false} is VALID [2020-07-18 00:13:48,274 INFO L280 TraceCheckUtils]: 33: Hoare triple {93#false} assume !false; {93#false} is VALID [2020-07-18 00:13:48,282 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-18 00:13:48,285 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:13:48,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [421202564] [2020-07-18 00:13:48,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:13:48,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:13:48,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738885434] [2020-07-18 00:13:48,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-07-18 00:13:48,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:13:48,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:13:48,362 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-18 00:13:48,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:13:48,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:13:48,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:13:48,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:13:48,374 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 4 states. [2020-07-18 00:13:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:48,986 INFO L93 Difference]: Finished difference Result 164 states and 192 transitions. [2020-07-18 00:13:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:13:48,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-07-18 00:13:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:13:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:13:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2020-07-18 00:13:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:13:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2020-07-18 00:13:49,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2020-07-18 00:13:49,270 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-18 00:13:49,296 INFO L225 Difference]: With dead ends: 164 [2020-07-18 00:13:49,297 INFO L226 Difference]: Without dead ends: 81 [2020-07-18 00:13:49,305 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-18 00:13:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-18 00:13:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-18 00:13:49,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:13:49,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-18 00:13:49,451 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-18 00:13:49,451 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-18 00:13:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:49,459 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-18 00:13:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-18 00:13:49,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:49,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:49,461 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-18 00:13:49,462 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-18 00:13:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:49,468 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-18 00:13:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-18 00:13:49,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:49,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:49,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:13:49,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:13:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-18 00:13:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-07-18 00:13:49,477 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 34 [2020-07-18 00:13:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:13:49,477 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-07-18 00:13:49,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:13:49,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 89 transitions. [2020-07-18 00:13:49,579 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-18 00:13:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-18 00:13:49,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 00:13:49,581 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:49,581 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-18 00:13:49,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:13:49,582 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:49,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:49,582 INFO L82 PathProgramCache]: Analyzing trace with hash -630897281, now seen corresponding path program 1 times [2020-07-18 00:13:49,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:49,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1940938947] [2020-07-18 00:13:49,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:49,677 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-18 00:13:49,677 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#true} #valid := #valid[0 := 0]; {781#true} is VALID [2020-07-18 00:13:49,677 INFO L280 TraceCheckUtils]: 2: Hoare triple {781#true} assume 0 < #StackHeapBarrier; {781#true} is VALID [2020-07-18 00:13:49,678 INFO L280 TraceCheckUtils]: 3: Hoare triple {781#true} assume true; {781#true} is VALID [2020-07-18 00:13:49,678 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {781#true} {781#true} #143#return; {781#true} is VALID [2020-07-18 00:13:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:49,795 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-18 00:13:49,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#true} havoc ~w~0; {781#true} is VALID [2020-07-18 00:13:49,796 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-18 00:13:49,796 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-18 00:13:49,797 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-18 00:13:49,797 INFO L280 TraceCheckUtils]: 5: Hoare triple {781#true} ~w~0 := #t~mem0; {781#true} is VALID [2020-07-18 00:13:49,797 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-18 00:13:49,797 INFO L280 TraceCheckUtils]: 7: Hoare triple {781#true} havoc #t~union1; {781#true} is VALID [2020-07-18 00:13:49,798 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#true} havoc #t~mem0; {781#true} is VALID [2020-07-18 00:13:49,798 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-18 00:13:49,798 INFO L280 TraceCheckUtils]: 10: Hoare triple {781#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {781#true} is VALID [2020-07-18 00:13:49,799 INFO L280 TraceCheckUtils]: 11: Hoare triple {781#true} goto; {781#true} is VALID [2020-07-18 00:13:49,799 INFO L280 TraceCheckUtils]: 12: Hoare triple {781#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {781#true} is VALID [2020-07-18 00:13:49,800 INFO L280 TraceCheckUtils]: 13: Hoare triple {781#true} #res := 2; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-18 00:13:49,801 INFO L280 TraceCheckUtils]: 14: Hoare triple {832#(<= 2 |__fpclassify_float_#res|)} assume true; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-18 00:13:49,802 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-18 00:13:49,803 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-18 00:13:49,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#true} ~y := #in~y; {781#true} is VALID [2020-07-18 00:13:49,804 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-18 00:13:49,804 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-18 00:13:49,805 INFO L280 TraceCheckUtils]: 4: Hoare triple {781#true} havoc ~w~0; {781#true} is VALID [2020-07-18 00:13:49,805 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-18 00:13:49,805 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-18 00:13:49,806 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-18 00:13:49,806 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#true} ~w~0 := #t~mem0; {781#true} is VALID [2020-07-18 00:13:49,806 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-18 00:13:49,807 INFO L280 TraceCheckUtils]: 10: Hoare triple {781#true} havoc #t~union1; {781#true} is VALID [2020-07-18 00:13:49,807 INFO L280 TraceCheckUtils]: 11: Hoare triple {781#true} havoc #t~mem0; {781#true} is VALID [2020-07-18 00:13:49,807 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-18 00:13:49,808 INFO L280 TraceCheckUtils]: 13: Hoare triple {781#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {781#true} is VALID [2020-07-18 00:13:49,808 INFO L280 TraceCheckUtils]: 14: Hoare triple {781#true} goto; {781#true} is VALID [2020-07-18 00:13:49,808 INFO L280 TraceCheckUtils]: 15: Hoare triple {781#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {781#true} is VALID [2020-07-18 00:13:49,809 INFO L280 TraceCheckUtils]: 16: Hoare triple {781#true} #res := 2; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-18 00:13:49,810 INFO L280 TraceCheckUtils]: 17: Hoare triple {832#(<= 2 |__fpclassify_float_#res|)} assume true; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-18 00:13:49,811 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-18 00:13:49,811 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-18 00:13:49,812 INFO L280 TraceCheckUtils]: 20: Hoare triple {831#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {782#false} is VALID [2020-07-18 00:13:49,812 INFO L280 TraceCheckUtils]: 21: Hoare triple {782#false} havoc #t~ret2; {782#false} is VALID [2020-07-18 00:13:49,813 INFO L280 TraceCheckUtils]: 22: Hoare triple {782#false} #res := ~y; {782#false} is VALID [2020-07-18 00:13:49,813 INFO L280 TraceCheckUtils]: 23: Hoare triple {782#false} assume true; {782#false} is VALID [2020-07-18 00:13:49,813 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {782#false} {781#true} #135#return; {782#false} is VALID [2020-07-18 00:13:49,815 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-18 00:13:49,815 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-18 00:13:49,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {781#true} #valid := #valid[0 := 0]; {781#true} is VALID [2020-07-18 00:13:49,816 INFO L280 TraceCheckUtils]: 3: Hoare triple {781#true} assume 0 < #StackHeapBarrier; {781#true} is VALID [2020-07-18 00:13:49,816 INFO L280 TraceCheckUtils]: 4: Hoare triple {781#true} assume true; {781#true} is VALID [2020-07-18 00:13:49,817 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {781#true} {781#true} #143#return; {781#true} is VALID [2020-07-18 00:13:49,817 INFO L263 TraceCheckUtils]: 6: Hoare triple {781#true} call #t~ret10 := main(); {781#true} is VALID [2020-07-18 00:13:49,817 INFO L280 TraceCheckUtils]: 7: Hoare triple {781#true} ~x~0 := 0.0; {781#true} is VALID [2020-07-18 00:13:49,817 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#true} ~y~0 := ~someUnaryFLOAToperation(0.0); {781#true} is VALID [2020-07-18 00:13:49,819 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-18 00:13:49,819 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-18 00:13:49,819 INFO L280 TraceCheckUtils]: 11: Hoare triple {781#true} ~y := #in~y; {781#true} is VALID [2020-07-18 00:13:49,820 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-18 00:13:49,821 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-18 00:13:49,821 INFO L280 TraceCheckUtils]: 14: Hoare triple {781#true} havoc ~w~0; {781#true} is VALID [2020-07-18 00:13:49,821 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-18 00:13:49,822 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-18 00:13:49,822 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-18 00:13:49,822 INFO L280 TraceCheckUtils]: 18: Hoare triple {781#true} ~w~0 := #t~mem0; {781#true} is VALID [2020-07-18 00:13:49,822 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-18 00:13:49,823 INFO L280 TraceCheckUtils]: 20: Hoare triple {781#true} havoc #t~union1; {781#true} is VALID [2020-07-18 00:13:49,823 INFO L280 TraceCheckUtils]: 21: Hoare triple {781#true} havoc #t~mem0; {781#true} is VALID [2020-07-18 00:13:49,823 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-18 00:13:49,824 INFO L280 TraceCheckUtils]: 23: Hoare triple {781#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {781#true} is VALID [2020-07-18 00:13:49,824 INFO L280 TraceCheckUtils]: 24: Hoare triple {781#true} goto; {781#true} is VALID [2020-07-18 00:13:49,824 INFO L280 TraceCheckUtils]: 25: Hoare triple {781#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {781#true} is VALID [2020-07-18 00:13:49,825 INFO L280 TraceCheckUtils]: 26: Hoare triple {781#true} #res := 2; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-18 00:13:49,825 INFO L280 TraceCheckUtils]: 27: Hoare triple {832#(<= 2 |__fpclassify_float_#res|)} assume true; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-18 00:13:49,826 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-18 00:13:49,827 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-18 00:13:49,828 INFO L280 TraceCheckUtils]: 30: Hoare triple {831#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {782#false} is VALID [2020-07-18 00:13:49,828 INFO L280 TraceCheckUtils]: 31: Hoare triple {782#false} havoc #t~ret2; {782#false} is VALID [2020-07-18 00:13:49,828 INFO L280 TraceCheckUtils]: 32: Hoare triple {782#false} #res := ~y; {782#false} is VALID [2020-07-18 00:13:49,829 INFO L280 TraceCheckUtils]: 33: Hoare triple {782#false} assume true; {782#false} is VALID [2020-07-18 00:13:49,829 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {782#false} {781#true} #135#return; {782#false} is VALID [2020-07-18 00:13:49,829 INFO L280 TraceCheckUtils]: 35: Hoare triple {782#false} ~res~0 := #t~ret7; {782#false} is VALID [2020-07-18 00:13:49,829 INFO L280 TraceCheckUtils]: 36: Hoare triple {782#false} havoc #t~ret7; {782#false} is VALID [2020-07-18 00:13:49,830 INFO L280 TraceCheckUtils]: 37: Hoare triple {782#false} #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {782#false} is VALID [2020-07-18 00:13:49,830 INFO L280 TraceCheckUtils]: 38: Hoare triple {782#false} assume !#t~short9; {782#false} is VALID [2020-07-18 00:13:49,830 INFO L280 TraceCheckUtils]: 39: Hoare triple {782#false} assume !#t~short9; {782#false} is VALID [2020-07-18 00:13:49,831 INFO L280 TraceCheckUtils]: 40: Hoare triple {782#false} havoc #t~short9; {782#false} is VALID [2020-07-18 00:13:49,831 INFO L280 TraceCheckUtils]: 41: Hoare triple {782#false} havoc #t~ret8; {782#false} is VALID [2020-07-18 00:13:49,831 INFO L280 TraceCheckUtils]: 42: Hoare triple {782#false} assume !false; {782#false} is VALID [2020-07-18 00:13:49,834 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-18 00:13:49,837 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:13:49,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1940938947] [2020-07-18 00:13:49,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:13:49,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:13:49,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776772829] [2020-07-18 00:13:49,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-18 00:13:49,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:13:49,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:13:49,882 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-18 00:13:49,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:13:49,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:13:49,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:13:49,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:13:49,883 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2020-07-18 00:13:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:50,494 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2020-07-18 00:13:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:13:50,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-18 00:13:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:13:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:13:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-18 00:13:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:13:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-18 00:13:50,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2020-07-18 00:13:50,642 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-18 00:13:50,648 INFO L225 Difference]: With dead ends: 117 [2020-07-18 00:13:50,648 INFO L226 Difference]: Without dead ends: 86 [2020-07-18 00:13:50,650 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:13:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-18 00:13:50,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2020-07-18 00:13:50,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:13:50,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 85 states. [2020-07-18 00:13:50,728 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 85 states. [2020-07-18 00:13:50,729 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 85 states. [2020-07-18 00:13:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:50,734 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-07-18 00:13:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-07-18 00:13:50,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:50,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:50,735 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 86 states. [2020-07-18 00:13:50,736 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 86 states. [2020-07-18 00:13:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:50,740 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-07-18 00:13:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-07-18 00:13:50,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:50,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:50,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:13:50,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:13:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-18 00:13:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2020-07-18 00:13:50,746 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 43 [2020-07-18 00:13:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:13:50,747 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-07-18 00:13:50,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:13:50,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 94 transitions. [2020-07-18 00:13:50,868 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-18 00:13:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2020-07-18 00:13:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-18 00:13:50,870 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:50,870 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-18 00:13:50,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:13:50,870 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:50,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1681903777, now seen corresponding path program 1 times [2020-07-18 00:13:50,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:50,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1730492791] [2020-07-18 00:13:50,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:50,964 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-18 00:13:50,964 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} #valid := #valid[0 := 0]; {1414#true} is VALID [2020-07-18 00:13:50,965 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#true} assume 0 < #StackHeapBarrier; {1414#true} is VALID [2020-07-18 00:13:50,965 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} assume true; {1414#true} is VALID [2020-07-18 00:13:50,965 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1414#true} {1414#true} #143#return; {1414#true} is VALID [2020-07-18 00:13:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:51,143 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-18 00:13:51,143 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} havoc ~w~0; {1414#true} is VALID [2020-07-18 00:13:51,143 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-18 00:13:51,144 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-18 00:13:51,144 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-18 00:13:51,144 INFO L280 TraceCheckUtils]: 5: Hoare triple {1414#true} ~w~0 := #t~mem0; {1414#true} is VALID [2020-07-18 00:13:51,144 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-18 00:13:51,145 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} havoc #t~union1; {1414#true} is VALID [2020-07-18 00:13:51,145 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} havoc #t~mem0; {1414#true} is VALID [2020-07-18 00:13:51,145 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-18 00:13:51,146 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1414#true} is VALID [2020-07-18 00:13:51,146 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} goto; {1414#true} is VALID [2020-07-18 00:13:51,146 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1414#true} is VALID [2020-07-18 00:13:51,146 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-18 00:13:51,147 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-18 00:13:51,147 INFO L280 TraceCheckUtils]: 15: Hoare triple {1414#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1414#true} is VALID [2020-07-18 00:13:51,148 INFO L280 TraceCheckUtils]: 16: Hoare triple {1414#true} #res := 1; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-18 00:13:51,148 INFO L280 TraceCheckUtils]: 17: Hoare triple {1471#(= 1 |__fpclassify_float_#res|)} assume true; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-18 00:13:51,149 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-18 00:13:51,150 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-18 00:13:51,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} ~y := #in~y; {1414#true} is VALID [2020-07-18 00:13:51,152 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-18 00:13:51,152 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-18 00:13:51,152 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} havoc ~w~0; {1414#true} is VALID [2020-07-18 00:13:51,153 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-18 00:13:51,153 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-18 00:13:51,153 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-18 00:13:51,154 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} ~w~0 := #t~mem0; {1414#true} is VALID [2020-07-18 00:13:51,154 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-18 00:13:51,155 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} havoc #t~union1; {1414#true} is VALID [2020-07-18 00:13:51,155 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} havoc #t~mem0; {1414#true} is VALID [2020-07-18 00:13:51,155 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-18 00:13:51,155 INFO L280 TraceCheckUtils]: 13: Hoare triple {1414#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1414#true} is VALID [2020-07-18 00:13:51,156 INFO L280 TraceCheckUtils]: 14: Hoare triple {1414#true} goto; {1414#true} is VALID [2020-07-18 00:13:51,156 INFO L280 TraceCheckUtils]: 15: Hoare triple {1414#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1414#true} is VALID [2020-07-18 00:13:51,160 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-18 00:13:51,160 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-18 00:13:51,160 INFO L280 TraceCheckUtils]: 18: Hoare triple {1414#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1414#true} is VALID [2020-07-18 00:13:51,165 INFO L280 TraceCheckUtils]: 19: Hoare triple {1414#true} #res := 1; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-18 00:13:51,166 INFO L280 TraceCheckUtils]: 20: Hoare triple {1471#(= 1 |__fpclassify_float_#res|)} assume true; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-18 00:13:51,167 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-18 00:13:51,168 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-18 00:13:51,169 INFO L280 TraceCheckUtils]: 23: Hoare triple {1470#(= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {1415#false} is VALID [2020-07-18 00:13:51,169 INFO L280 TraceCheckUtils]: 24: Hoare triple {1415#false} havoc #t~ret2; {1415#false} is VALID [2020-07-18 00:13:51,170 INFO L280 TraceCheckUtils]: 25: Hoare triple {1415#false} #res := ~y; {1415#false} is VALID [2020-07-18 00:13:51,170 INFO L280 TraceCheckUtils]: 26: Hoare triple {1415#false} assume true; {1415#false} is VALID [2020-07-18 00:13:51,173 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1415#false} {1414#true} #135#return; {1415#false} is VALID [2020-07-18 00:13:51,177 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-18 00:13:51,177 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-18 00:13:51,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#true} #valid := #valid[0 := 0]; {1414#true} is VALID [2020-07-18 00:13:51,178 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} assume 0 < #StackHeapBarrier; {1414#true} is VALID [2020-07-18 00:13:51,178 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume true; {1414#true} is VALID [2020-07-18 00:13:51,178 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1414#true} {1414#true} #143#return; {1414#true} is VALID [2020-07-18 00:13:51,178 INFO L263 TraceCheckUtils]: 6: Hoare triple {1414#true} call #t~ret10 := main(); {1414#true} is VALID [2020-07-18 00:13:51,179 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} ~x~0 := 0.0; {1414#true} is VALID [2020-07-18 00:13:51,179 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} ~y~0 := ~someUnaryFLOAToperation(0.0); {1414#true} is VALID [2020-07-18 00:13:51,180 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-18 00:13:51,180 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-18 00:13:51,181 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} ~y := #in~y; {1414#true} is VALID [2020-07-18 00:13:51,182 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-18 00:13:51,182 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-18 00:13:51,183 INFO L280 TraceCheckUtils]: 14: Hoare triple {1414#true} havoc ~w~0; {1414#true} is VALID [2020-07-18 00:13:51,183 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-18 00:13:51,183 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-18 00:13:51,183 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-18 00:13:51,184 INFO L280 TraceCheckUtils]: 18: Hoare triple {1414#true} ~w~0 := #t~mem0; {1414#true} is VALID [2020-07-18 00:13:51,184 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-18 00:13:51,184 INFO L280 TraceCheckUtils]: 20: Hoare triple {1414#true} havoc #t~union1; {1414#true} is VALID [2020-07-18 00:13:51,184 INFO L280 TraceCheckUtils]: 21: Hoare triple {1414#true} havoc #t~mem0; {1414#true} is VALID [2020-07-18 00:13:51,185 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-18 00:13:51,185 INFO L280 TraceCheckUtils]: 23: Hoare triple {1414#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1414#true} is VALID [2020-07-18 00:13:51,185 INFO L280 TraceCheckUtils]: 24: Hoare triple {1414#true} goto; {1414#true} is VALID [2020-07-18 00:13:51,186 INFO L280 TraceCheckUtils]: 25: Hoare triple {1414#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1414#true} is VALID [2020-07-18 00:13:51,186 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-18 00:13:51,186 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-18 00:13:51,186 INFO L280 TraceCheckUtils]: 28: Hoare triple {1414#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1414#true} is VALID [2020-07-18 00:13:51,187 INFO L280 TraceCheckUtils]: 29: Hoare triple {1414#true} #res := 1; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-18 00:13:51,188 INFO L280 TraceCheckUtils]: 30: Hoare triple {1471#(= 1 |__fpclassify_float_#res|)} assume true; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-18 00:13:51,189 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-18 00:13:51,189 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-18 00:13:51,190 INFO L280 TraceCheckUtils]: 33: Hoare triple {1470#(= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {1415#false} is VALID [2020-07-18 00:13:51,190 INFO L280 TraceCheckUtils]: 34: Hoare triple {1415#false} havoc #t~ret2; {1415#false} is VALID [2020-07-18 00:13:51,190 INFO L280 TraceCheckUtils]: 35: Hoare triple {1415#false} #res := ~y; {1415#false} is VALID [2020-07-18 00:13:51,191 INFO L280 TraceCheckUtils]: 36: Hoare triple {1415#false} assume true; {1415#false} is VALID [2020-07-18 00:13:51,191 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1415#false} {1414#true} #135#return; {1415#false} is VALID [2020-07-18 00:13:51,191 INFO L280 TraceCheckUtils]: 38: Hoare triple {1415#false} ~res~0 := #t~ret7; {1415#false} is VALID [2020-07-18 00:13:51,192 INFO L280 TraceCheckUtils]: 39: Hoare triple {1415#false} havoc #t~ret7; {1415#false} is VALID [2020-07-18 00:13:51,192 INFO L280 TraceCheckUtils]: 40: Hoare triple {1415#false} #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {1415#false} is VALID [2020-07-18 00:13:51,192 INFO L280 TraceCheckUtils]: 41: Hoare triple {1415#false} assume !#t~short9; {1415#false} is VALID [2020-07-18 00:13:51,192 INFO L280 TraceCheckUtils]: 42: Hoare triple {1415#false} assume !#t~short9; {1415#false} is VALID [2020-07-18 00:13:51,193 INFO L280 TraceCheckUtils]: 43: Hoare triple {1415#false} havoc #t~short9; {1415#false} is VALID [2020-07-18 00:13:51,193 INFO L280 TraceCheckUtils]: 44: Hoare triple {1415#false} havoc #t~ret8; {1415#false} is VALID [2020-07-18 00:13:51,193 INFO L280 TraceCheckUtils]: 45: Hoare triple {1415#false} assume !false; {1415#false} is VALID [2020-07-18 00:13:51,196 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-18 00:13:51,198 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:13:51,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1730492791] [2020-07-18 00:13:51,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:13:51,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:13:51,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616982869] [2020-07-18 00:13:51,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-18 00:13:51,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:13:51,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:13:51,247 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-18 00:13:51,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:13:51,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:13:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:13:51,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:13:51,249 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 6 states. [2020-07-18 00:13:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:51,827 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2020-07-18 00:13:51,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:13:51,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-18 00:13:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:13:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:13:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-18 00:13:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:13:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-18 00:13:51,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2020-07-18 00:13:51,993 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-18 00:13:51,998 INFO L225 Difference]: With dead ends: 121 [2020-07-18 00:13:51,998 INFO L226 Difference]: Without dead ends: 90 [2020-07-18 00:13:51,999 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:13:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-18 00:13:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2020-07-18 00:13:52,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:13:52,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 85 states. [2020-07-18 00:13:52,053 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 85 states. [2020-07-18 00:13:52,053 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 85 states. [2020-07-18 00:13:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:52,058 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2020-07-18 00:13:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2020-07-18 00:13:52,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:52,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:52,060 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 90 states. [2020-07-18 00:13:52,060 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 90 states. [2020-07-18 00:13:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:52,064 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2020-07-18 00:13:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2020-07-18 00:13:52,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:52,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:52,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:13:52,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:13:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-18 00:13:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2020-07-18 00:13:52,070 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 46 [2020-07-18 00:13:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:13:52,070 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-07-18 00:13:52,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:13:52,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 94 transitions. [2020-07-18 00:13:52,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2020-07-18 00:13:52,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-18 00:13:52,156 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:52,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:13:52,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:13:52,156 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:52,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:52,157 INFO L82 PathProgramCache]: Analyzing trace with hash -969429089, now seen corresponding path program 1 times [2020-07-18 00:13:52,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:52,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [263771238] [2020-07-18 00:13:52,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 00:13:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 00:13:52,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:13:52,317 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:407) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:390) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:283) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:13:52,323 INFO L168 Benchmark]: Toolchain (without parser) took 5501.09 ms. Allocated memory was 146.3 MB in the beginning and 278.4 MB in the end (delta: 132.1 MB). Free memory was 102.7 MB in the beginning and 190.4 MB in the end (delta: -87.6 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:52,324 INFO L168 Benchmark]: CDTParser took 0.86 ms. Allocated memory is still 146.3 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:13:52,325 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.27 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.3 MB in the beginning and 181.9 MB in the end (delta: -79.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:52,326 INFO L168 Benchmark]: Boogie Preprocessor took 47.22 ms. Allocated memory is still 202.9 MB. Free memory was 181.9 MB in the beginning and 180.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:52,326 INFO L168 Benchmark]: RCFGBuilder took 577.60 ms. Allocated memory is still 202.9 MB. Free memory was 179.4 MB in the beginning and 141.4 MB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:52,327 INFO L168 Benchmark]: TraceAbstraction took 4504.22 ms. Allocated memory was 202.9 MB in the beginning and 278.4 MB in the end (delta: 75.5 MB). Free memory was 141.4 MB in the beginning and 190.4 MB in the end (delta: -49.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:52,331 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.86 ms. Allocated memory is still 146.3 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 365.27 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.3 MB in the beginning and 181.9 MB in the end (delta: -79.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.22 ms. Allocated memory is still 202.9 MB. Free memory was 181.9 MB in the beginning and 180.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 577.60 ms. Allocated memory is still 202.9 MB. Free memory was 179.4 MB in the beginning and 141.4 MB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4504.22 ms. Allocated memory was 202.9 MB in the beginning and 278.4 MB in the end (delta: 75.5 MB). Free memory was 141.4 MB in the beginning and 190.4 MB in the end (delta: -49.0 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...