/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1252b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 21:48:44,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 21:48:44,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 21:48:44,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 21:48:44,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 21:48:44,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 21:48:44,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 21:48:44,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 21:48:44,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 21:48:44,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 21:48:44,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 21:48:44,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 21:48:44,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 21:48:44,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 21:48:44,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 21:48:44,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 21:48:44,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 21:48:44,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 21:48:44,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 21:48:44,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 21:48:44,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 21:48:44,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 21:48:44,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 21:48:44,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 21:48:44,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 21:48:44,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 21:48:44,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 21:48:44,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 21:48:44,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 21:48:44,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 21:48:44,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 21:48:44,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 21:48:44,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 21:48:44,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 21:48:44,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 21:48:44,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 21:48:44,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 21:48:44,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 21:48:44,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 21:48:44,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 21:48:44,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 21:48:44,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 21:48:44,178 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 21:48:44,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 21:48:44,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 21:48:44,183 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 21:48:44,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 21:48:44,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 21:48:44,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 21:48:44,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 21:48:44,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 21:48:44,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 21:48:44,186 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 21:48:44,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 21:48:44,187 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 21:48:44,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 21:48:44,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 21:48:44,189 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 21:48:44,190 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 21:48:44,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 21:48:44,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 21:48:44,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 21:48:44,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 21:48:44,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 21:48:44,191 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 21:48:44,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 21:48:44,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 21:48:44,505 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 21:48:44,506 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 21:48:44,507 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 21:48:44,507 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-08 21:48:44,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc1ba617/ace96dd7ff15477a9ecf6571cdd09253/FLAG7919f2aa7 [2020-07-08 21:48:45,077 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 21:48:45,078 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1252b.c [2020-07-08 21:48:45,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc1ba617/ace96dd7ff15477a9ecf6571cdd09253/FLAG7919f2aa7 [2020-07-08 21:48:45,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cc1ba617/ace96dd7ff15477a9ecf6571cdd09253 [2020-07-08 21:48:45,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 21:48:45,435 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 21:48:45,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 21:48:45,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 21:48:45,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 21:48:45,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:48:45" (1/1) ... [2020-07-08 21:48:45,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc6390f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:45, skipping insertion in model container [2020-07-08 21:48:45,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 09:48:45" (1/1) ... [2020-07-08 21:48:45,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 21:48:45,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 21:48:45,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:48:45,716 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 21:48:45,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 21:48:45,773 INFO L208 MainTranslator]: Completed translation [2020-07-08 21:48:45,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:45 WrapperNode [2020-07-08 21:48:45,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 21:48:45,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 21:48:45,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 21:48:45,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 21:48:45,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:45" (1/1) ... [2020-07-08 21:48:45,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:45" (1/1) ... [2020-07-08 21:48:45,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:45" (1/1) ... [2020-07-08 21:48:45,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:45" (1/1) ... [2020-07-08 21:48:45,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:45" (1/1) ... [2020-07-08 21:48:45,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:45" (1/1) ... [2020-07-08 21:48:45,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:45" (1/1) ... [2020-07-08 21:48:45,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 21:48:45,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 21:48:45,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 21:48:45,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 21:48:45,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:45" (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-08 21:48:46,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 21:48:46,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 21:48:46,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-08 21:48:46,012 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2020-07-08 21:48:46,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2020-07-08 21:48:46,012 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 21:48:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 21:48:46,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2020-07-08 21:48:46,013 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-08 21:48:46,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 21:48:46,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 21:48:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 21:48:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 21:48:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2020-07-08 21:48:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2020-07-08 21:48:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 21:48:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 21:48:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 21:48:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 21:48:46,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 21:48:46,655 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 21:48:46,655 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-08 21:48:46,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:48:46 BoogieIcfgContainer [2020-07-08 21:48:46,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 21:48:46,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 21:48:46,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 21:48:46,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 21:48:46,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 09:48:45" (1/3) ... [2020-07-08 21:48:46,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573ed757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:48:46, skipping insertion in model container [2020-07-08 21:48:46,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 09:48:45" (2/3) ... [2020-07-08 21:48:46,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573ed757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 09:48:46, skipping insertion in model container [2020-07-08 21:48:46,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 09:48:46" (3/3) ... [2020-07-08 21:48:46,670 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252b.c [2020-07-08 21:48:46,683 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 21:48:46,692 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 21:48:46,716 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 21:48:46,767 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 21:48:46,768 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 21:48:46,768 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 21:48:46,768 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 21:48:46,770 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 21:48:46,771 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 21:48:46,771 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 21:48:46,771 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 21:48:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2020-07-08 21:48:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 21:48:46,827 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:48:46,828 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-08 21:48:46,829 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:48:46,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:48:46,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2131665852, now seen corresponding path program 1 times [2020-07-08 21:48:46,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:48:46,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1092523867] [2020-07-08 21:48:46,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:48:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:47,086 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-08 21:48:47,087 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} #valid := #valid[0 := 0]; {92#true} is VALID [2020-07-08 21:48:47,088 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume 0 < #StackHeapBarrier; {92#true} is VALID [2020-07-08 21:48:47,088 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-08 21:48:47,089 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {92#true} {92#true} #143#return; {92#true} is VALID [2020-07-08 21:48:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:47,184 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-08 21:48:47,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} havoc ~w~0; {92#true} is VALID [2020-07-08 21:48:47,188 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-08 21:48:47,188 INFO L280 TraceCheckUtils]: 3: Hoare triple {93#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {93#false} is VALID [2020-07-08 21:48:47,188 INFO L280 TraceCheckUtils]: 4: Hoare triple {93#false} #res := 2; {93#false} is VALID [2020-07-08 21:48:47,189 INFO L280 TraceCheckUtils]: 5: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-08 21:48:47,189 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {93#false} {92#true} #139#return; {93#false} is VALID [2020-07-08 21:48:47,190 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-08 21:48:47,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} ~y := #in~y; {92#true} is VALID [2020-07-08 21:48:47,196 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-08 21:48:47,196 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-08 21:48:47,197 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} havoc ~w~0; {92#true} is VALID [2020-07-08 21:48:47,203 INFO L280 TraceCheckUtils]: 5: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-08 21:48:47,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {93#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {93#false} is VALID [2020-07-08 21:48:47,203 INFO L280 TraceCheckUtils]: 7: Hoare triple {93#false} #res := 2; {93#false} is VALID [2020-07-08 21:48:47,204 INFO L280 TraceCheckUtils]: 8: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-08 21:48:47,204 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {93#false} {92#true} #139#return; {93#false} is VALID [2020-07-08 21:48:47,204 INFO L280 TraceCheckUtils]: 10: Hoare triple {93#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {93#false} is VALID [2020-07-08 21:48:47,205 INFO L280 TraceCheckUtils]: 11: Hoare triple {93#false} assume 0 == #t~ret2; {93#false} is VALID [2020-07-08 21:48:47,205 INFO L280 TraceCheckUtils]: 12: Hoare triple {93#false} havoc #t~ret2; {93#false} is VALID [2020-07-08 21:48:47,206 INFO L280 TraceCheckUtils]: 13: Hoare triple {93#false} #res := ~y; {93#false} is VALID [2020-07-08 21:48:47,206 INFO L280 TraceCheckUtils]: 14: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-08 21:48:47,206 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {93#false} {92#true} #135#return; {93#false} is VALID [2020-07-08 21:48:47,211 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-08 21:48:47,212 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-08 21:48:47,212 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} #valid := #valid[0 := 0]; {92#true} is VALID [2020-07-08 21:48:47,213 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} assume 0 < #StackHeapBarrier; {92#true} is VALID [2020-07-08 21:48:47,213 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} assume true; {92#true} is VALID [2020-07-08 21:48:47,213 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {92#true} {92#true} #143#return; {92#true} is VALID [2020-07-08 21:48:47,213 INFO L263 TraceCheckUtils]: 6: Hoare triple {92#true} call #t~ret10 := main(); {92#true} is VALID [2020-07-08 21:48:47,214 INFO L280 TraceCheckUtils]: 7: Hoare triple {92#true} ~x~0 := 0.0; {92#true} is VALID [2020-07-08 21:48:47,214 INFO L280 TraceCheckUtils]: 8: Hoare triple {92#true} ~y~0 := ~someUnaryFLOAToperation(0.0); {92#true} is VALID [2020-07-08 21:48:47,216 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-08 21:48:47,216 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-08 21:48:47,216 INFO L280 TraceCheckUtils]: 11: Hoare triple {92#true} ~y := #in~y; {92#true} is VALID [2020-07-08 21:48:47,218 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-08 21:48:47,218 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-08 21:48:47,219 INFO L280 TraceCheckUtils]: 14: Hoare triple {92#true} havoc ~w~0; {92#true} is VALID [2020-07-08 21:48:47,220 INFO L280 TraceCheckUtils]: 15: Hoare triple {92#true} assume !true; {93#false} is VALID [2020-07-08 21:48:47,220 INFO L280 TraceCheckUtils]: 16: Hoare triple {93#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {93#false} is VALID [2020-07-08 21:48:47,220 INFO L280 TraceCheckUtils]: 17: Hoare triple {93#false} #res := 2; {93#false} is VALID [2020-07-08 21:48:47,221 INFO L280 TraceCheckUtils]: 18: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-08 21:48:47,221 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {93#false} {92#true} #139#return; {93#false} is VALID [2020-07-08 21:48:47,221 INFO L280 TraceCheckUtils]: 20: Hoare triple {93#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {93#false} is VALID [2020-07-08 21:48:47,222 INFO L280 TraceCheckUtils]: 21: Hoare triple {93#false} assume 0 == #t~ret2; {93#false} is VALID [2020-07-08 21:48:47,222 INFO L280 TraceCheckUtils]: 22: Hoare triple {93#false} havoc #t~ret2; {93#false} is VALID [2020-07-08 21:48:47,222 INFO L280 TraceCheckUtils]: 23: Hoare triple {93#false} #res := ~y; {93#false} is VALID [2020-07-08 21:48:47,223 INFO L280 TraceCheckUtils]: 24: Hoare triple {93#false} assume true; {93#false} is VALID [2020-07-08 21:48:47,223 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {93#false} {92#true} #135#return; {93#false} is VALID [2020-07-08 21:48:47,223 INFO L280 TraceCheckUtils]: 26: Hoare triple {93#false} ~res~0 := #t~ret7; {93#false} is VALID [2020-07-08 21:48:47,223 INFO L280 TraceCheckUtils]: 27: Hoare triple {93#false} havoc #t~ret7; {93#false} is VALID [2020-07-08 21:48:47,224 INFO L280 TraceCheckUtils]: 28: Hoare triple {93#false} #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {93#false} is VALID [2020-07-08 21:48:47,224 INFO L280 TraceCheckUtils]: 29: Hoare triple {93#false} assume !#t~short9; {93#false} is VALID [2020-07-08 21:48:47,225 INFO L280 TraceCheckUtils]: 30: Hoare triple {93#false} assume !#t~short9; {93#false} is VALID [2020-07-08 21:48:47,225 INFO L280 TraceCheckUtils]: 31: Hoare triple {93#false} havoc #t~short9; {93#false} is VALID [2020-07-08 21:48:47,225 INFO L280 TraceCheckUtils]: 32: Hoare triple {93#false} havoc #t~ret8; {93#false} is VALID [2020-07-08 21:48:47,225 INFO L280 TraceCheckUtils]: 33: Hoare triple {93#false} assume !false; {93#false} is VALID [2020-07-08 21:48:47,231 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-08 21:48:47,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1092523867] [2020-07-08 21:48:47,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:48:47,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 21:48:47,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673393207] [2020-07-08 21:48:47,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-07-08 21:48:47,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:48:47,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 21:48:47,316 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-08 21:48:47,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 21:48:47,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:48:47,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 21:48:47,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 21:48:47,334 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 4 states. [2020-07-08 21:48:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:48,019 INFO L93 Difference]: Finished difference Result 164 states and 192 transitions. [2020-07-08 21:48:48,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 21:48:48,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-07-08 21:48:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:48:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 21:48:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2020-07-08 21:48:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 21:48:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2020-07-08 21:48:48,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2020-07-08 21:48:48,343 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-08 21:48:48,364 INFO L225 Difference]: With dead ends: 164 [2020-07-08 21:48:48,365 INFO L226 Difference]: Without dead ends: 81 [2020-07-08 21:48:48,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 21:48:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-08 21:48:48,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-08 21:48:48,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:48:48,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-08 21:48:48,503 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-08 21:48:48,504 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-08 21:48:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:48,513 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-08 21:48:48,513 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-08 21:48:48,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:48:48,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:48:48,515 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-08 21:48:48,515 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-08 21:48:48,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:48,523 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2020-07-08 21:48:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-08 21:48:48,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:48:48,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:48:48,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:48:48,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:48:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-08 21:48:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-07-08 21:48:48,533 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 34 [2020-07-08 21:48:48,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:48:48,536 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-07-08 21:48:48,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 21:48:48,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 89 transitions. [2020-07-08 21:48:48,656 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-08 21:48:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-07-08 21:48:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-08 21:48:48,660 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:48:48,660 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-08 21:48:48,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 21:48:48,661 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:48:48,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:48:48,662 INFO L82 PathProgramCache]: Analyzing trace with hash -630897281, now seen corresponding path program 1 times [2020-07-08 21:48:48,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:48:48,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1832035338] [2020-07-08 21:48:48,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:48:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:48,784 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-08 21:48:48,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#true} #valid := #valid[0 := 0]; {781#true} is VALID [2020-07-08 21:48:48,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {781#true} assume 0 < #StackHeapBarrier; {781#true} is VALID [2020-07-08 21:48:48,785 INFO L280 TraceCheckUtils]: 3: Hoare triple {781#true} assume true; {781#true} is VALID [2020-07-08 21:48:48,786 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {781#true} {781#true} #143#return; {781#true} is VALID [2020-07-08 21:48:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:48,892 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-08 21:48:48,893 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#true} havoc ~w~0; {781#true} is VALID [2020-07-08 21:48:48,893 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-08 21:48:48,894 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-08 21:48:48,894 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-08 21:48:48,894 INFO L280 TraceCheckUtils]: 5: Hoare triple {781#true} ~w~0 := #t~mem0; {781#true} is VALID [2020-07-08 21:48:48,895 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-08 21:48:48,895 INFO L280 TraceCheckUtils]: 7: Hoare triple {781#true} havoc #t~mem0; {781#true} is VALID [2020-07-08 21:48:48,896 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#true} havoc #t~union1; {781#true} is VALID [2020-07-08 21:48:48,896 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-08 21:48:48,896 INFO L280 TraceCheckUtils]: 10: Hoare triple {781#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {781#true} is VALID [2020-07-08 21:48:48,897 INFO L280 TraceCheckUtils]: 11: Hoare triple {781#true} goto; {781#true} is VALID [2020-07-08 21:48:48,897 INFO L280 TraceCheckUtils]: 12: Hoare triple {781#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {781#true} is VALID [2020-07-08 21:48:48,898 INFO L280 TraceCheckUtils]: 13: Hoare triple {781#true} #res := 2; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 21:48:48,899 INFO L280 TraceCheckUtils]: 14: Hoare triple {832#(<= 2 |__fpclassify_float_#res|)} assume true; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 21:48:48,901 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-08 21:48:48,902 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-08 21:48:48,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {781#true} ~y := #in~y; {781#true} is VALID [2020-07-08 21:48:48,904 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-08 21:48:48,904 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-08 21:48:48,905 INFO L280 TraceCheckUtils]: 4: Hoare triple {781#true} havoc ~w~0; {781#true} is VALID [2020-07-08 21:48:48,905 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-08 21:48:48,905 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-08 21:48:48,906 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-08 21:48:48,906 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#true} ~w~0 := #t~mem0; {781#true} is VALID [2020-07-08 21:48:48,906 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-08 21:48:48,907 INFO L280 TraceCheckUtils]: 10: Hoare triple {781#true} havoc #t~mem0; {781#true} is VALID [2020-07-08 21:48:48,907 INFO L280 TraceCheckUtils]: 11: Hoare triple {781#true} havoc #t~union1; {781#true} is VALID [2020-07-08 21:48:48,908 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-08 21:48:48,908 INFO L280 TraceCheckUtils]: 13: Hoare triple {781#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {781#true} is VALID [2020-07-08 21:48:48,908 INFO L280 TraceCheckUtils]: 14: Hoare triple {781#true} goto; {781#true} is VALID [2020-07-08 21:48:48,908 INFO L280 TraceCheckUtils]: 15: Hoare triple {781#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {781#true} is VALID [2020-07-08 21:48:48,910 INFO L280 TraceCheckUtils]: 16: Hoare triple {781#true} #res := 2; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 21:48:48,910 INFO L280 TraceCheckUtils]: 17: Hoare triple {832#(<= 2 |__fpclassify_float_#res|)} assume true; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 21:48:48,912 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-08 21:48:48,912 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-08 21:48:48,913 INFO L280 TraceCheckUtils]: 20: Hoare triple {831#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {782#false} is VALID [2020-07-08 21:48:48,914 INFO L280 TraceCheckUtils]: 21: Hoare triple {782#false} havoc #t~ret2; {782#false} is VALID [2020-07-08 21:48:48,914 INFO L280 TraceCheckUtils]: 22: Hoare triple {782#false} #res := ~y; {782#false} is VALID [2020-07-08 21:48:48,914 INFO L280 TraceCheckUtils]: 23: Hoare triple {782#false} assume true; {782#false} is VALID [2020-07-08 21:48:48,915 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {782#false} {781#true} #135#return; {782#false} is VALID [2020-07-08 21:48:48,917 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-08 21:48:48,917 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-08 21:48:48,917 INFO L280 TraceCheckUtils]: 2: Hoare triple {781#true} #valid := #valid[0 := 0]; {781#true} is VALID [2020-07-08 21:48:48,918 INFO L280 TraceCheckUtils]: 3: Hoare triple {781#true} assume 0 < #StackHeapBarrier; {781#true} is VALID [2020-07-08 21:48:48,918 INFO L280 TraceCheckUtils]: 4: Hoare triple {781#true} assume true; {781#true} is VALID [2020-07-08 21:48:48,918 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {781#true} {781#true} #143#return; {781#true} is VALID [2020-07-08 21:48:48,919 INFO L263 TraceCheckUtils]: 6: Hoare triple {781#true} call #t~ret10 := main(); {781#true} is VALID [2020-07-08 21:48:48,919 INFO L280 TraceCheckUtils]: 7: Hoare triple {781#true} ~x~0 := 0.0; {781#true} is VALID [2020-07-08 21:48:48,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {781#true} ~y~0 := ~someUnaryFLOAToperation(0.0); {781#true} is VALID [2020-07-08 21:48:48,921 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-08 21:48:48,921 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-08 21:48:48,922 INFO L280 TraceCheckUtils]: 11: Hoare triple {781#true} ~y := #in~y; {781#true} is VALID [2020-07-08 21:48:48,923 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-08 21:48:48,923 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-08 21:48:48,924 INFO L280 TraceCheckUtils]: 14: Hoare triple {781#true} havoc ~w~0; {781#true} is VALID [2020-07-08 21:48:48,924 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-08 21:48:48,924 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-08 21:48:48,924 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-08 21:48:48,925 INFO L280 TraceCheckUtils]: 18: Hoare triple {781#true} ~w~0 := #t~mem0; {781#true} is VALID [2020-07-08 21:48:48,925 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-08 21:48:48,925 INFO L280 TraceCheckUtils]: 20: Hoare triple {781#true} havoc #t~mem0; {781#true} is VALID [2020-07-08 21:48:48,926 INFO L280 TraceCheckUtils]: 21: Hoare triple {781#true} havoc #t~union1; {781#true} is VALID [2020-07-08 21:48:48,926 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-08 21:48:48,926 INFO L280 TraceCheckUtils]: 23: Hoare triple {781#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {781#true} is VALID [2020-07-08 21:48:48,926 INFO L280 TraceCheckUtils]: 24: Hoare triple {781#true} goto; {781#true} is VALID [2020-07-08 21:48:48,927 INFO L280 TraceCheckUtils]: 25: Hoare triple {781#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296; {781#true} is VALID [2020-07-08 21:48:48,928 INFO L280 TraceCheckUtils]: 26: Hoare triple {781#true} #res := 2; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 21:48:48,928 INFO L280 TraceCheckUtils]: 27: Hoare triple {832#(<= 2 |__fpclassify_float_#res|)} assume true; {832#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-08 21:48:48,930 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-08 21:48:48,930 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-08 21:48:48,931 INFO L280 TraceCheckUtils]: 30: Hoare triple {831#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {782#false} is VALID [2020-07-08 21:48:48,932 INFO L280 TraceCheckUtils]: 31: Hoare triple {782#false} havoc #t~ret2; {782#false} is VALID [2020-07-08 21:48:48,932 INFO L280 TraceCheckUtils]: 32: Hoare triple {782#false} #res := ~y; {782#false} is VALID [2020-07-08 21:48:48,932 INFO L280 TraceCheckUtils]: 33: Hoare triple {782#false} assume true; {782#false} is VALID [2020-07-08 21:48:48,932 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {782#false} {781#true} #135#return; {782#false} is VALID [2020-07-08 21:48:48,933 INFO L280 TraceCheckUtils]: 35: Hoare triple {782#false} ~res~0 := #t~ret7; {782#false} is VALID [2020-07-08 21:48:48,933 INFO L280 TraceCheckUtils]: 36: Hoare triple {782#false} havoc #t~ret7; {782#false} is VALID [2020-07-08 21:48:48,933 INFO L280 TraceCheckUtils]: 37: Hoare triple {782#false} #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {782#false} is VALID [2020-07-08 21:48:48,934 INFO L280 TraceCheckUtils]: 38: Hoare triple {782#false} assume !#t~short9; {782#false} is VALID [2020-07-08 21:48:48,934 INFO L280 TraceCheckUtils]: 39: Hoare triple {782#false} assume !#t~short9; {782#false} is VALID [2020-07-08 21:48:48,934 INFO L280 TraceCheckUtils]: 40: Hoare triple {782#false} havoc #t~short9; {782#false} is VALID [2020-07-08 21:48:48,934 INFO L280 TraceCheckUtils]: 41: Hoare triple {782#false} havoc #t~ret8; {782#false} is VALID [2020-07-08 21:48:48,935 INFO L280 TraceCheckUtils]: 42: Hoare triple {782#false} assume !false; {782#false} is VALID [2020-07-08 21:48:48,938 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-08 21:48:48,939 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1832035338] [2020-07-08 21:48:48,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:48:48,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 21:48:48,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013957898] [2020-07-08 21:48:48,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-08 21:48:48,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:48:48,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 21:48:48,989 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-08 21:48:48,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 21:48:48,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:48:48,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 21:48:48,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 21:48:48,990 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2020-07-08 21:48:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:49,652 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2020-07-08 21:48:49,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 21:48:49,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-08 21:48:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:48:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:48:49,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-08 21:48:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:48:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-08 21:48:49,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2020-07-08 21:48:49,812 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-08 21:48:49,817 INFO L225 Difference]: With dead ends: 117 [2020-07-08 21:48:49,817 INFO L226 Difference]: Without dead ends: 86 [2020-07-08 21:48:49,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 21:48:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-08 21:48:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2020-07-08 21:48:49,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:48:49,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 85 states. [2020-07-08 21:48:49,909 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 85 states. [2020-07-08 21:48:49,910 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 85 states. [2020-07-08 21:48:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:49,922 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-07-08 21:48:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-07-08 21:48:49,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:48:49,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:48:49,925 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 86 states. [2020-07-08 21:48:49,925 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 86 states. [2020-07-08 21:48:49,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:49,935 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-07-08 21:48:49,936 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2020-07-08 21:48:49,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:48:49,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:48:49,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:48:49,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:48:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-08 21:48:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2020-07-08 21:48:49,949 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 43 [2020-07-08 21:48:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:48:49,950 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-07-08 21:48:49,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 21:48:49,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 94 transitions. [2020-07-08 21:48:50,059 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-08 21:48:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2020-07-08 21:48:50,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-08 21:48:50,061 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:48:50,061 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-08 21:48:50,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 21:48:50,063 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:48:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:48:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1681903777, now seen corresponding path program 1 times [2020-07-08 21:48:50,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:48:50,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [796780638] [2020-07-08 21:48:50,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:48:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:50,223 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-08 21:48:50,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} #valid := #valid[0 := 0]; {1414#true} is VALID [2020-07-08 21:48:50,223 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#true} assume 0 < #StackHeapBarrier; {1414#true} is VALID [2020-07-08 21:48:50,223 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} assume true; {1414#true} is VALID [2020-07-08 21:48:50,224 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1414#true} {1414#true} #143#return; {1414#true} is VALID [2020-07-08 21:48:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 21:48:50,344 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-08 21:48:50,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} havoc ~w~0; {1414#true} is VALID [2020-07-08 21:48:50,345 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-08 21:48:50,345 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-08 21:48:50,345 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-08 21:48:50,346 INFO L280 TraceCheckUtils]: 5: Hoare triple {1414#true} ~w~0 := #t~mem0; {1414#true} is VALID [2020-07-08 21:48:50,346 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-08 21:48:50,346 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} havoc #t~mem0; {1414#true} is VALID [2020-07-08 21:48:50,346 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} havoc #t~union1; {1414#true} is VALID [2020-07-08 21:48:50,347 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-08 21:48:50,347 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1414#true} is VALID [2020-07-08 21:48:50,347 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} goto; {1414#true} is VALID [2020-07-08 21:48:50,348 INFO L280 TraceCheckUtils]: 12: Hoare triple {1414#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1414#true} is VALID [2020-07-08 21:48:50,348 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-08 21:48:50,348 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-08 21:48:50,348 INFO L280 TraceCheckUtils]: 15: Hoare triple {1414#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1414#true} is VALID [2020-07-08 21:48:50,349 INFO L280 TraceCheckUtils]: 16: Hoare triple {1414#true} #res := 1; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 21:48:50,350 INFO L280 TraceCheckUtils]: 17: Hoare triple {1471#(= 1 |__fpclassify_float_#res|)} assume true; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 21:48:50,351 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-08 21:48:50,352 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-08 21:48:50,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {1414#true} ~y := #in~y; {1414#true} is VALID [2020-07-08 21:48:50,353 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-08 21:48:50,354 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-08 21:48:50,354 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} havoc ~w~0; {1414#true} is VALID [2020-07-08 21:48:50,354 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-08 21:48:50,355 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-08 21:48:50,355 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-08 21:48:50,355 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} ~w~0 := #t~mem0; {1414#true} is VALID [2020-07-08 21:48:50,355 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-08 21:48:50,356 INFO L280 TraceCheckUtils]: 10: Hoare triple {1414#true} havoc #t~mem0; {1414#true} is VALID [2020-07-08 21:48:50,356 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} havoc #t~union1; {1414#true} is VALID [2020-07-08 21:48:50,356 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-08 21:48:50,356 INFO L280 TraceCheckUtils]: 13: Hoare triple {1414#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1414#true} is VALID [2020-07-08 21:48:50,357 INFO L280 TraceCheckUtils]: 14: Hoare triple {1414#true} goto; {1414#true} is VALID [2020-07-08 21:48:50,357 INFO L280 TraceCheckUtils]: 15: Hoare triple {1414#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1414#true} is VALID [2020-07-08 21:48:50,357 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-08 21:48:50,357 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-08 21:48:50,358 INFO L280 TraceCheckUtils]: 18: Hoare triple {1414#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1414#true} is VALID [2020-07-08 21:48:50,359 INFO L280 TraceCheckUtils]: 19: Hoare triple {1414#true} #res := 1; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 21:48:50,359 INFO L280 TraceCheckUtils]: 20: Hoare triple {1471#(= 1 |__fpclassify_float_#res|)} assume true; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 21:48:50,360 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-08 21:48:50,361 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-08 21:48:50,362 INFO L280 TraceCheckUtils]: 23: Hoare triple {1470#(= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {1415#false} is VALID [2020-07-08 21:48:50,362 INFO L280 TraceCheckUtils]: 24: Hoare triple {1415#false} havoc #t~ret2; {1415#false} is VALID [2020-07-08 21:48:50,363 INFO L280 TraceCheckUtils]: 25: Hoare triple {1415#false} #res := ~y; {1415#false} is VALID [2020-07-08 21:48:50,363 INFO L280 TraceCheckUtils]: 26: Hoare triple {1415#false} assume true; {1415#false} is VALID [2020-07-08 21:48:50,363 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1415#false} {1414#true} #135#return; {1415#false} is VALID [2020-07-08 21:48:50,365 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-08 21:48:50,366 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-08 21:48:50,366 INFO L280 TraceCheckUtils]: 2: Hoare triple {1414#true} #valid := #valid[0 := 0]; {1414#true} is VALID [2020-07-08 21:48:50,366 INFO L280 TraceCheckUtils]: 3: Hoare triple {1414#true} assume 0 < #StackHeapBarrier; {1414#true} is VALID [2020-07-08 21:48:50,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {1414#true} assume true; {1414#true} is VALID [2020-07-08 21:48:50,367 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1414#true} {1414#true} #143#return; {1414#true} is VALID [2020-07-08 21:48:50,367 INFO L263 TraceCheckUtils]: 6: Hoare triple {1414#true} call #t~ret10 := main(); {1414#true} is VALID [2020-07-08 21:48:50,367 INFO L280 TraceCheckUtils]: 7: Hoare triple {1414#true} ~x~0 := 0.0; {1414#true} is VALID [2020-07-08 21:48:50,368 INFO L280 TraceCheckUtils]: 8: Hoare triple {1414#true} ~y~0 := ~someUnaryFLOAToperation(0.0); {1414#true} is VALID [2020-07-08 21:48:50,369 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-08 21:48:50,369 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-08 21:48:50,370 INFO L280 TraceCheckUtils]: 11: Hoare triple {1414#true} ~y := #in~y; {1414#true} is VALID [2020-07-08 21:48:50,371 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-08 21:48:50,371 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-08 21:48:50,372 INFO L280 TraceCheckUtils]: 14: Hoare triple {1414#true} havoc ~w~0; {1414#true} is VALID [2020-07-08 21:48:50,372 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-08 21:48:50,372 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-08 21:48:50,372 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-08 21:48:50,373 INFO L280 TraceCheckUtils]: 18: Hoare triple {1414#true} ~w~0 := #t~mem0; {1414#true} is VALID [2020-07-08 21:48:50,373 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-08 21:48:50,373 INFO L280 TraceCheckUtils]: 20: Hoare triple {1414#true} havoc #t~mem0; {1414#true} is VALID [2020-07-08 21:48:50,373 INFO L280 TraceCheckUtils]: 21: Hoare triple {1414#true} havoc #t~union1; {1414#true} is VALID [2020-07-08 21:48:50,374 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-08 21:48:50,374 INFO L280 TraceCheckUtils]: 23: Hoare triple {1414#true} havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1414#true} is VALID [2020-07-08 21:48:50,374 INFO L280 TraceCheckUtils]: 24: Hoare triple {1414#true} goto; {1414#true} is VALID [2020-07-08 21:48:50,374 INFO L280 TraceCheckUtils]: 25: Hoare triple {1414#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {1414#true} is VALID [2020-07-08 21:48:50,375 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-08 21:48:50,375 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-08 21:48:50,375 INFO L280 TraceCheckUtils]: 28: Hoare triple {1414#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296; {1414#true} is VALID [2020-07-08 21:48:50,376 INFO L280 TraceCheckUtils]: 29: Hoare triple {1414#true} #res := 1; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 21:48:50,377 INFO L280 TraceCheckUtils]: 30: Hoare triple {1471#(= 1 |__fpclassify_float_#res|)} assume true; {1471#(= 1 |__fpclassify_float_#res|)} is VALID [2020-07-08 21:48:50,378 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-08 21:48:50,379 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-08 21:48:50,379 INFO L280 TraceCheckUtils]: 33: Hoare triple {1470#(= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2; {1415#false} is VALID [2020-07-08 21:48:50,380 INFO L280 TraceCheckUtils]: 34: Hoare triple {1415#false} havoc #t~ret2; {1415#false} is VALID [2020-07-08 21:48:50,380 INFO L280 TraceCheckUtils]: 35: Hoare triple {1415#false} #res := ~y; {1415#false} is VALID [2020-07-08 21:48:50,380 INFO L280 TraceCheckUtils]: 36: Hoare triple {1415#false} assume true; {1415#false} is VALID [2020-07-08 21:48:50,380 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1415#false} {1414#true} #135#return; {1415#false} is VALID [2020-07-08 21:48:50,381 INFO L280 TraceCheckUtils]: 38: Hoare triple {1415#false} ~res~0 := #t~ret7; {1415#false} is VALID [2020-07-08 21:48:50,381 INFO L280 TraceCheckUtils]: 39: Hoare triple {1415#false} havoc #t~ret7; {1415#false} is VALID [2020-07-08 21:48:50,381 INFO L280 TraceCheckUtils]: 40: Hoare triple {1415#false} #t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {1415#false} is VALID [2020-07-08 21:48:50,381 INFO L280 TraceCheckUtils]: 41: Hoare triple {1415#false} assume !#t~short9; {1415#false} is VALID [2020-07-08 21:48:50,382 INFO L280 TraceCheckUtils]: 42: Hoare triple {1415#false} assume !#t~short9; {1415#false} is VALID [2020-07-08 21:48:50,382 INFO L280 TraceCheckUtils]: 43: Hoare triple {1415#false} havoc #t~short9; {1415#false} is VALID [2020-07-08 21:48:50,382 INFO L280 TraceCheckUtils]: 44: Hoare triple {1415#false} havoc #t~ret8; {1415#false} is VALID [2020-07-08 21:48:50,382 INFO L280 TraceCheckUtils]: 45: Hoare triple {1415#false} assume !false; {1415#false} is VALID [2020-07-08 21:48:50,385 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-08 21:48:50,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [796780638] [2020-07-08 21:48:50,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 21:48:50,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 21:48:50,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839564093] [2020-07-08 21:48:50,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-08 21:48:50,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 21:48:50,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 21:48:50,434 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-08 21:48:50,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 21:48:50,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 21:48:50,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 21:48:50,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 21:48:50,435 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 6 states. [2020-07-08 21:48:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:51,082 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2020-07-08 21:48:51,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 21:48:51,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2020-07-08 21:48:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 21:48:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:48:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-08 21:48:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 21:48:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-08 21:48:51,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2020-07-08 21:48:51,249 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-08 21:48:51,252 INFO L225 Difference]: With dead ends: 121 [2020-07-08 21:48:51,253 INFO L226 Difference]: Without dead ends: 90 [2020-07-08 21:48:51,254 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 21:48:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-08 21:48:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2020-07-08 21:48:51,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 21:48:51,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 85 states. [2020-07-08 21:48:51,319 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 85 states. [2020-07-08 21:48:51,319 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 85 states. [2020-07-08 21:48:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:51,327 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2020-07-08 21:48:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2020-07-08 21:48:51,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:48:51,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:48:51,330 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 90 states. [2020-07-08 21:48:51,330 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 90 states. [2020-07-08 21:48:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 21:48:51,338 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2020-07-08 21:48:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2020-07-08 21:48:51,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 21:48:51,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 21:48:51,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 21:48:51,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 21:48:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-08 21:48:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2020-07-08 21:48:51,350 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 46 [2020-07-08 21:48:51,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 21:48:51,351 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2020-07-08 21:48:51,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 21:48:51,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 94 transitions. [2020-07-08 21:48:51,448 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-08 21:48:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2020-07-08 21:48:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-08 21:48:51,449 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 21:48:51,450 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-08 21:48:51,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 21:48:51,454 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 21:48:51,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 21:48:51,454 INFO L82 PathProgramCache]: Analyzing trace with hash -969429089, now seen corresponding path program 1 times [2020-07-08 21:48:51,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 21:48:51,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [84791856] [2020-07-08 21:48:51,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 21:48:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 21:48:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 21:48:51,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 21:48:51,711 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:1145) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1014) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:407) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:390) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-08 21:48:51,719 INFO L168 Benchmark]: Toolchain (without parser) took 6283.10 ms. Allocated memory was 146.8 MB in the beginning and 275.3 MB in the end (delta: 128.5 MB). Free memory was 105.3 MB in the beginning and 167.9 MB in the end (delta: -62.6 MB). Peak memory consumption was 65.9 MB. Max. memory is 7.1 GB. [2020-07-08 21:48:51,721 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-08 21:48:51,721 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.04 ms. Allocated memory is still 146.8 MB. Free memory was 105.1 MB in the beginning and 93.5 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2020-07-08 21:48:51,725 INFO L168 Benchmark]: Boogie Preprocessor took 154.72 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 93.5 MB in the beginning and 182.0 MB in the end (delta: -88.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-08 21:48:51,726 INFO L168 Benchmark]: RCFGBuilder took 731.26 ms. Allocated memory is still 205.0 MB. Free memory was 182.0 MB in the beginning and 144.3 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2020-07-08 21:48:51,727 INFO L168 Benchmark]: TraceAbstraction took 5052.16 ms. Allocated memory was 205.0 MB in the beginning and 275.3 MB in the end (delta: 70.3 MB). Free memory was 143.7 MB in the beginning and 167.9 MB in the end (delta: -24.2 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2020-07-08 21:48:51,733 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.19 ms. Allocated memory is still 146.8 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 338.04 ms. Allocated memory is still 146.8 MB. Free memory was 105.1 MB in the beginning and 93.5 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 154.72 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 93.5 MB in the beginning and 182.0 MB in the end (delta: -88.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 731.26 ms. Allocated memory is still 205.0 MB. Free memory was 182.0 MB in the beginning and 144.3 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5052.16 ms. Allocated memory was 205.0 MB in the beginning and 275.3 MB in the end (delta: 70.3 MB). Free memory was 143.7 MB in the beginning and 167.9 MB in the end (delta: -24.2 MB). Peak memory consumption was 46.0 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...