/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/double_req_bl_1300.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:32:59,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:32:59,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:32:59,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:32:59,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:32:59,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:32:59,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:32:59,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:32:59,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:32:59,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:32:59,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:32:59,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:32:59,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:32:59,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:32:59,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:32:59,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:32:59,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:32:59,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:32:59,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:32:59,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:32:59,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:32:59,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:32:59,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:32:59,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:32:59,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:32:59,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:32:59,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:32:59,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:32:59,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:32:59,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:32:59,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:32:59,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:32:59,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:32:59,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:32:59,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:32:59,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:32:59,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:32:59,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:32:59,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:32:59,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:32:59,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:32:59,573 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:32:59,582 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:32:59,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:32:59,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:32:59,584 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:32:59,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:32:59,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:32:59,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:32:59,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:32:59,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:32:59,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:32:59,585 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:32:59,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:32:59,586 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:32:59,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:32:59,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:32:59,586 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:32:59,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:32:59,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:32:59,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:32:59,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:32:59,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:32:59,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:32:59,588 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:32:59,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:32:59,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:32:59,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:32:59,880 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:32:59,880 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:32:59,881 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1300.c [2020-07-11 00:32:59,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce7369152/172f542fb2134fe7846cb01d5f000997/FLAGa81b8cc07 [2020-07-11 00:33:00,395 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:33:00,396 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1300.c [2020-07-11 00:33:00,404 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce7369152/172f542fb2134fe7846cb01d5f000997/FLAGa81b8cc07 [2020-07-11 00:33:00,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce7369152/172f542fb2134fe7846cb01d5f000997 [2020-07-11 00:33:00,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:33:00,795 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:33:00,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:00,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:33:00,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:33:00,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:00" (1/1) ... [2020-07-11 00:33:00,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d313d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:00, skipping insertion in model container [2020-07-11 00:33:00,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:33:00" (1/1) ... [2020-07-11 00:33:00,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:33:00,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:33:01,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:01,030 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:33:01,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:33:01,082 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:33:01,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:01 WrapperNode [2020-07-11 00:33:01,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:33:01,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:33:01,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:33:01,083 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:33:01,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:01" (1/1) ... [2020-07-11 00:33:01,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:01" (1/1) ... [2020-07-11 00:33:01,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:01" (1/1) ... [2020-07-11 00:33:01,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:01" (1/1) ... [2020-07-11 00:33:01,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:01" (1/1) ... [2020-07-11 00:33:01,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:01" (1/1) ... [2020-07-11 00:33:01,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:01" (1/1) ... [2020-07-11 00:33:01,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:33:01,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:33:01,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:33:01,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:33:01,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:33:01,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:33:01,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:33:01,275 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2020-07-11 00:33:01,275 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-11 00:33:01,275 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_double [2020-07-11 00:33:01,275 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:33:01,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:33:01,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-11 00:33:01,275 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2020-07-11 00:33:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 00:33:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-11 00:33:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 00:33:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 00:33:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-11 00:33:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_double [2020-07-11 00:33:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:33:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:33:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:33:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-11 00:33:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 00:33:01,801 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:33:01,801 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-11 00:33:01,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:01 BoogieIcfgContainer [2020-07-11 00:33:01,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:33:01,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:33:01,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:33:01,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:33:01,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:33:00" (1/3) ... [2020-07-11 00:33:01,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a7b5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:01, skipping insertion in model container [2020-07-11 00:33:01,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:33:01" (2/3) ... [2020-07-11 00:33:01,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a7b5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:33:01, skipping insertion in model container [2020-07-11 00:33:01,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:33:01" (3/3) ... [2020-07-11 00:33:01,823 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300.c [2020-07-11 00:33:01,835 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:33:01,843 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:33:01,858 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:33:01,882 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:33:01,883 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:33:01,883 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:33:01,883 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:33:01,883 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:33:01,883 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:33:01,883 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:33:01,884 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:33:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2020-07-11 00:33:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-11 00:33:01,909 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:01,910 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] [2020-07-11 00:33:01,910 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:01,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:01,916 INFO L82 PathProgramCache]: Analyzing trace with hash -984491116, now seen corresponding path program 1 times [2020-07-11 00:33:01,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:01,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1646175631] [2020-07-11 00:33:01,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:02,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {82#true} is VALID [2020-07-11 00:33:02,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} #valid := #valid[0 := 0]; {82#true} is VALID [2020-07-11 00:33:02,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} assume 0 < #StackHeapBarrier; {82#true} is VALID [2020-07-11 00:33:02,175 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-11 00:33:02,176 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {82#true} {82#true} #113#return; {82#true} is VALID [2020-07-11 00:33:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:02,247 INFO L280 TraceCheckUtils]: 0: Hoare triple {106#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-11 00:33:02,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} havoc ~hx~0; {82#true} is VALID [2020-07-11 00:33:02,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} havoc ~lx~0; {82#true} is VALID [2020-07-11 00:33:02,249 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-11 00:33:02,250 INFO L280 TraceCheckUtils]: 4: Hoare triple {83#false} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {83#false} is VALID [2020-07-11 00:33:02,250 INFO L280 TraceCheckUtils]: 5: Hoare triple {83#false} ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); {83#false} is VALID [2020-07-11 00:33:02,251 INFO L280 TraceCheckUtils]: 6: Hoare triple {83#false} ~hx~0 := 2146435072 - ~hx~0; {83#false} is VALID [2020-07-11 00:33:02,251 INFO L280 TraceCheckUtils]: 7: Hoare triple {83#false} #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {83#false} is VALID [2020-07-11 00:33:02,251 INFO L280 TraceCheckUtils]: 8: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-11 00:33:02,252 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {83#false} {82#true} #107#return; {83#false} is VALID [2020-07-11 00:33:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:02,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {106#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-11 00:33:02,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} havoc ~hx~1; {82#true} is VALID [2020-07-11 00:33:02,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-11 00:33:02,283 INFO L280 TraceCheckUtils]: 3: Hoare triple {83#false} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {83#false} is VALID [2020-07-11 00:33:02,283 INFO L280 TraceCheckUtils]: 4: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-11 00:33:02,284 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {83#false} {83#false} #111#return; {83#false} is VALID [2020-07-11 00:33:02,286 INFO L263 TraceCheckUtils]: 0: Hoare triple {82#true} call ULTIMATE.init(); {105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:33:02,286 INFO L280 TraceCheckUtils]: 1: Hoare triple {105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {82#true} is VALID [2020-07-11 00:33:02,287 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} #valid := #valid[0 := 0]; {82#true} is VALID [2020-07-11 00:33:02,287 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume 0 < #StackHeapBarrier; {82#true} is VALID [2020-07-11 00:33:02,287 INFO L280 TraceCheckUtils]: 4: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-11 00:33:02,288 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {82#true} {82#true} #113#return; {82#true} is VALID [2020-07-11 00:33:02,288 INFO L263 TraceCheckUtils]: 6: Hoare triple {82#true} call #t~ret11 := main(); {82#true} is VALID [2020-07-11 00:33:02,288 INFO L280 TraceCheckUtils]: 7: Hoare triple {82#true} ~x~0 := #t~nondet6; {82#true} is VALID [2020-07-11 00:33:02,289 INFO L280 TraceCheckUtils]: 8: Hoare triple {82#true} havoc #t~nondet6; {82#true} is VALID [2020-07-11 00:33:02,291 INFO L263 TraceCheckUtils]: 9: Hoare triple {82#true} call #t~ret7 := isinf_double(~x~0); {106#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:02,291 INFO L280 TraceCheckUtils]: 10: Hoare triple {106#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-11 00:33:02,291 INFO L280 TraceCheckUtils]: 11: Hoare triple {82#true} havoc ~hx~0; {82#true} is VALID [2020-07-11 00:33:02,292 INFO L280 TraceCheckUtils]: 12: Hoare triple {82#true} havoc ~lx~0; {82#true} is VALID [2020-07-11 00:33:02,293 INFO L280 TraceCheckUtils]: 13: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-11 00:33:02,293 INFO L280 TraceCheckUtils]: 14: Hoare triple {83#false} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {83#false} is VALID [2020-07-11 00:33:02,294 INFO L280 TraceCheckUtils]: 15: Hoare triple {83#false} ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); {83#false} is VALID [2020-07-11 00:33:02,294 INFO L280 TraceCheckUtils]: 16: Hoare triple {83#false} ~hx~0 := 2146435072 - ~hx~0; {83#false} is VALID [2020-07-11 00:33:02,295 INFO L280 TraceCheckUtils]: 17: Hoare triple {83#false} #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {83#false} is VALID [2020-07-11 00:33:02,295 INFO L280 TraceCheckUtils]: 18: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-11 00:33:02,295 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {83#false} {82#true} #107#return; {83#false} is VALID [2020-07-11 00:33:02,296 INFO L280 TraceCheckUtils]: 20: Hoare triple {83#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; {83#false} is VALID [2020-07-11 00:33:02,296 INFO L280 TraceCheckUtils]: 21: Hoare triple {83#false} #t~short9 := 0 == #t~ret7; {83#false} is VALID [2020-07-11 00:33:02,297 INFO L280 TraceCheckUtils]: 22: Hoare triple {83#false} assume !#t~short9; {83#false} is VALID [2020-07-11 00:33:02,297 INFO L280 TraceCheckUtils]: 23: Hoare triple {83#false} assume #t~short9; {83#false} is VALID [2020-07-11 00:33:02,297 INFO L280 TraceCheckUtils]: 24: Hoare triple {83#false} havoc #t~short9; {83#false} is VALID [2020-07-11 00:33:02,297 INFO L280 TraceCheckUtils]: 25: Hoare triple {83#false} havoc #t~ret8; {83#false} is VALID [2020-07-11 00:33:02,298 INFO L280 TraceCheckUtils]: 26: Hoare triple {83#false} havoc #t~ret7; {83#false} is VALID [2020-07-11 00:33:02,298 INFO L263 TraceCheckUtils]: 27: Hoare triple {83#false} call #t~ret10 := isfinite_double(~x~0); {106#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:02,298 INFO L280 TraceCheckUtils]: 28: Hoare triple {106#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-11 00:33:02,299 INFO L280 TraceCheckUtils]: 29: Hoare triple {82#true} havoc ~hx~1; {82#true} is VALID [2020-07-11 00:33:02,300 INFO L280 TraceCheckUtils]: 30: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-11 00:33:02,300 INFO L280 TraceCheckUtils]: 31: Hoare triple {83#false} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {83#false} is VALID [2020-07-11 00:33:02,300 INFO L280 TraceCheckUtils]: 32: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-11 00:33:02,301 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {83#false} {83#false} #111#return; {83#false} is VALID [2020-07-11 00:33:02,301 INFO L280 TraceCheckUtils]: 34: Hoare triple {83#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; {83#false} is VALID [2020-07-11 00:33:02,301 INFO L280 TraceCheckUtils]: 35: Hoare triple {83#false} ~res~0 := ~convertINTToDOUBLE(#t~ret10); {83#false} is VALID [2020-07-11 00:33:02,302 INFO L280 TraceCheckUtils]: 36: Hoare triple {83#false} havoc #t~ret10; {83#false} is VALID [2020-07-11 00:33:02,302 INFO L280 TraceCheckUtils]: 37: Hoare triple {83#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {83#false} is VALID [2020-07-11 00:33:02,303 INFO L280 TraceCheckUtils]: 38: Hoare triple {83#false} assume !false; {83#false} is VALID [2020-07-11 00:33:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:33:02,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1646175631] [2020-07-11 00:33:02,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:02,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 00:33:02,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124495064] [2020-07-11 00:33:02,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-07-11 00:33:02,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:02,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 00:33:02,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:02,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 00:33:02,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:02,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 00:33:02,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 00:33:02,423 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2020-07-11 00:33:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:03,103 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2020-07-11 00:33:03,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 00:33:03,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-07-11 00:33:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2020-07-11 00:33:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:33:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2020-07-11 00:33:03,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 157 transitions. [2020-07-11 00:33:03,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:03,354 INFO L225 Difference]: With dead ends: 144 [2020-07-11 00:33:03,355 INFO L226 Difference]: Without dead ends: 70 [2020-07-11 00:33:03,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:33:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-11 00:33:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-11 00:33:03,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:03,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-11 00:33:03,468 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-11 00:33:03,468 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-11 00:33:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:03,475 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2020-07-11 00:33:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2020-07-11 00:33:03,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:03,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:03,477 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-11 00:33:03,477 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-11 00:33:03,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:03,484 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2020-07-11 00:33:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2020-07-11 00:33:03,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:03,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:03,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:03,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-11 00:33:03,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2020-07-11 00:33:03,493 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 39 [2020-07-11 00:33:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:03,494 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2020-07-11 00:33:03,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 00:33:03,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 70 transitions. [2020-07-11 00:33:03,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2020-07-11 00:33:03,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-11 00:33:03,601 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:03,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:03,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:33:03,602 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:03,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:03,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1526802571, now seen corresponding path program 1 times [2020-07-11 00:33:03,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:03,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [957074824] [2020-07-11 00:33:03,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:03,787 INFO L280 TraceCheckUtils]: 0: Hoare triple {727#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {680#true} is VALID [2020-07-11 00:33:03,787 INFO L280 TraceCheckUtils]: 1: Hoare triple {680#true} #valid := #valid[0 := 0]; {680#true} is VALID [2020-07-11 00:33:03,788 INFO L280 TraceCheckUtils]: 2: Hoare triple {680#true} assume 0 < #StackHeapBarrier; {680#true} is VALID [2020-07-11 00:33:03,788 INFO L280 TraceCheckUtils]: 3: Hoare triple {680#true} assume true; {680#true} is VALID [2020-07-11 00:33:03,788 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {680#true} {680#true} #113#return; {680#true} is VALID [2020-07-11 00:33:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:03,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {728#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {680#true} is VALID [2020-07-11 00:33:03,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {680#true} havoc ~hx~0; {680#true} is VALID [2020-07-11 00:33:03,840 INFO L280 TraceCheckUtils]: 2: Hoare triple {680#true} havoc ~lx~0; {680#true} is VALID [2020-07-11 00:33:03,841 INFO L280 TraceCheckUtils]: 3: Hoare triple {680#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L18-2 {680#true} is VALID [2020-07-11 00:33:03,841 INFO L280 TraceCheckUtils]: 4: Hoare triple {680#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L19 {680#true} is VALID [2020-07-11 00:33:03,841 INFO L280 TraceCheckUtils]: 5: Hoare triple {680#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L20 {680#true} is VALID [2020-07-11 00:33:03,842 INFO L280 TraceCheckUtils]: 6: Hoare triple {680#true} ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-11 00:33:03,842 INFO L280 TraceCheckUtils]: 7: Hoare triple {680#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21-1 {680#true} is VALID [2020-07-11 00:33:03,842 INFO L280 TraceCheckUtils]: 8: Hoare triple {680#true} havoc #t~union1; {680#true} is VALID [2020-07-11 00:33:03,843 INFO L280 TraceCheckUtils]: 9: Hoare triple {680#true} havoc #t~mem0; {680#true} is VALID [2020-07-11 00:33:03,843 INFO L280 TraceCheckUtils]: 10: Hoare triple {680#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L22 {680#true} is VALID [2020-07-11 00:33:03,843 INFO L280 TraceCheckUtils]: 11: Hoare triple {680#true} ~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-11 00:33:03,843 INFO L280 TraceCheckUtils]: 12: Hoare triple {680#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L22-2 {680#true} is VALID [2020-07-11 00:33:03,844 INFO L280 TraceCheckUtils]: 13: Hoare triple {680#true} havoc #t~mem2; {680#true} is VALID [2020-07-11 00:33:03,844 INFO L280 TraceCheckUtils]: 14: Hoare triple {680#true} havoc #t~union3; {680#true} is VALID [2020-07-11 00:33:03,844 INFO L280 TraceCheckUtils]: 15: Hoare triple {680#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L19-1 {680#true} is VALID [2020-07-11 00:33:03,845 INFO L280 TraceCheckUtils]: 16: Hoare triple {680#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {680#true} is VALID [2020-07-11 00:33:03,845 INFO L280 TraceCheckUtils]: 17: Hoare triple {680#true} goto; {680#true} is VALID [2020-07-11 00:33:03,845 INFO L280 TraceCheckUtils]: 18: Hoare triple {680#true} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {680#true} is VALID [2020-07-11 00:33:03,846 INFO L280 TraceCheckUtils]: 19: Hoare triple {680#true} ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-11 00:33:03,846 INFO L280 TraceCheckUtils]: 20: Hoare triple {680#true} ~hx~0 := 2146435072 - ~hx~0; {680#true} is VALID [2020-07-11 00:33:03,846 INFO L280 TraceCheckUtils]: 21: Hoare triple {680#true} #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-11 00:33:03,847 INFO L280 TraceCheckUtils]: 22: Hoare triple {680#true} assume true; {680#true} is VALID [2020-07-11 00:33:03,847 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {680#true} {680#true} #107#return; {680#true} is VALID [2020-07-11 00:33:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:33:03,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {728#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {680#true} is VALID [2020-07-11 00:33:03,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {680#true} havoc ~hx~1; {680#true} is VALID [2020-07-11 00:33:03,908 INFO L280 TraceCheckUtils]: 2: Hoare triple {680#true} SUMMARY for call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L35-2 {680#true} is VALID [2020-07-11 00:33:03,909 INFO L280 TraceCheckUtils]: 3: Hoare triple {680#true} SUMMARY for call write~real(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8); srcloc: L36 {680#true} is VALID [2020-07-11 00:33:03,909 INFO L280 TraceCheckUtils]: 4: Hoare triple {680#true} SUMMARY for call #t~mem4 := read~int(~#gh_u~0.base, 4 + ~#gh_u~0.offset, 4); srcloc: L37 {680#true} is VALID [2020-07-11 00:33:03,909 INFO L280 TraceCheckUtils]: 5: Hoare triple {680#true} ~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-11 00:33:03,910 INFO L280 TraceCheckUtils]: 6: Hoare triple {680#true} SUMMARY for call write~real(#t~union5, ~#gh_u~0.base, ~#gh_u~0.offset, 8); srcloc: L38-1 {680#true} is VALID [2020-07-11 00:33:03,910 INFO L280 TraceCheckUtils]: 7: Hoare triple {680#true} havoc #t~mem4; {680#true} is VALID [2020-07-11 00:33:03,910 INFO L280 TraceCheckUtils]: 8: Hoare triple {680#true} havoc #t~union5; {680#true} is VALID [2020-07-11 00:33:03,911 INFO L280 TraceCheckUtils]: 9: Hoare triple {680#true} SUMMARY for call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); srcloc: L36-1 {680#true} is VALID [2020-07-11 00:33:03,911 INFO L280 TraceCheckUtils]: 10: Hoare triple {680#true} havoc ~#gh_u~0.base, ~#gh_u~0.offset; {680#true} is VALID [2020-07-11 00:33:03,913 INFO L280 TraceCheckUtils]: 11: Hoare triple {680#true} goto; {680#true} is VALID [2020-07-11 00:33:03,914 INFO L280 TraceCheckUtils]: 12: Hoare triple {680#true} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-11 00:33:03,914 INFO L280 TraceCheckUtils]: 13: Hoare triple {680#true} assume true; {680#true} is VALID [2020-07-11 00:33:03,920 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {680#true} {681#false} #111#return; {681#false} is VALID [2020-07-11 00:33:03,923 INFO L263 TraceCheckUtils]: 0: Hoare triple {680#true} call ULTIMATE.init(); {727#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:33:03,924 INFO L280 TraceCheckUtils]: 1: Hoare triple {727#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {680#true} is VALID [2020-07-11 00:33:03,924 INFO L280 TraceCheckUtils]: 2: Hoare triple {680#true} #valid := #valid[0 := 0]; {680#true} is VALID [2020-07-11 00:33:03,924 INFO L280 TraceCheckUtils]: 3: Hoare triple {680#true} assume 0 < #StackHeapBarrier; {680#true} is VALID [2020-07-11 00:33:03,925 INFO L280 TraceCheckUtils]: 4: Hoare triple {680#true} assume true; {680#true} is VALID [2020-07-11 00:33:03,925 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {680#true} {680#true} #113#return; {680#true} is VALID [2020-07-11 00:33:03,927 INFO L263 TraceCheckUtils]: 6: Hoare triple {680#true} call #t~ret11 := main(); {680#true} is VALID [2020-07-11 00:33:03,928 INFO L280 TraceCheckUtils]: 7: Hoare triple {680#true} ~x~0 := #t~nondet6; {680#true} is VALID [2020-07-11 00:33:03,928 INFO L280 TraceCheckUtils]: 8: Hoare triple {680#true} havoc #t~nondet6; {680#true} is VALID [2020-07-11 00:33:03,941 INFO L263 TraceCheckUtils]: 9: Hoare triple {680#true} call #t~ret7 := isinf_double(~x~0); {728#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:03,941 INFO L280 TraceCheckUtils]: 10: Hoare triple {728#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {680#true} is VALID [2020-07-11 00:33:03,941 INFO L280 TraceCheckUtils]: 11: Hoare triple {680#true} havoc ~hx~0; {680#true} is VALID [2020-07-11 00:33:03,942 INFO L280 TraceCheckUtils]: 12: Hoare triple {680#true} havoc ~lx~0; {680#true} is VALID [2020-07-11 00:33:03,942 INFO L280 TraceCheckUtils]: 13: Hoare triple {680#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L18-2 {680#true} is VALID [2020-07-11 00:33:03,942 INFO L280 TraceCheckUtils]: 14: Hoare triple {680#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L19 {680#true} is VALID [2020-07-11 00:33:03,942 INFO L280 TraceCheckUtils]: 15: Hoare triple {680#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L20 {680#true} is VALID [2020-07-11 00:33:03,943 INFO L280 TraceCheckUtils]: 16: Hoare triple {680#true} ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-11 00:33:03,943 INFO L280 TraceCheckUtils]: 17: Hoare triple {680#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21-1 {680#true} is VALID [2020-07-11 00:33:03,946 INFO L280 TraceCheckUtils]: 18: Hoare triple {680#true} havoc #t~union1; {680#true} is VALID [2020-07-11 00:33:03,947 INFO L280 TraceCheckUtils]: 19: Hoare triple {680#true} havoc #t~mem0; {680#true} is VALID [2020-07-11 00:33:03,947 INFO L280 TraceCheckUtils]: 20: Hoare triple {680#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L22 {680#true} is VALID [2020-07-11 00:33:03,947 INFO L280 TraceCheckUtils]: 21: Hoare triple {680#true} ~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-11 00:33:03,948 INFO L280 TraceCheckUtils]: 22: Hoare triple {680#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L22-2 {680#true} is VALID [2020-07-11 00:33:03,948 INFO L280 TraceCheckUtils]: 23: Hoare triple {680#true} havoc #t~mem2; {680#true} is VALID [2020-07-11 00:33:03,951 INFO L280 TraceCheckUtils]: 24: Hoare triple {680#true} havoc #t~union3; {680#true} is VALID [2020-07-11 00:33:03,952 INFO L280 TraceCheckUtils]: 25: Hoare triple {680#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L19-1 {680#true} is VALID [2020-07-11 00:33:03,952 INFO L280 TraceCheckUtils]: 26: Hoare triple {680#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {680#true} is VALID [2020-07-11 00:33:03,952 INFO L280 TraceCheckUtils]: 27: Hoare triple {680#true} goto; {680#true} is VALID [2020-07-11 00:33:03,953 INFO L280 TraceCheckUtils]: 28: Hoare triple {680#true} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {680#true} is VALID [2020-07-11 00:33:03,953 INFO L280 TraceCheckUtils]: 29: Hoare triple {680#true} ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-11 00:33:03,955 INFO L280 TraceCheckUtils]: 30: Hoare triple {680#true} ~hx~0 := 2146435072 - ~hx~0; {680#true} is VALID [2020-07-11 00:33:03,956 INFO L280 TraceCheckUtils]: 31: Hoare triple {680#true} #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-11 00:33:03,956 INFO L280 TraceCheckUtils]: 32: Hoare triple {680#true} assume true; {680#true} is VALID [2020-07-11 00:33:03,956 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {680#true} {680#true} #107#return; {680#true} is VALID [2020-07-11 00:33:03,957 INFO L280 TraceCheckUtils]: 34: Hoare triple {680#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; {680#true} is VALID [2020-07-11 00:33:03,957 INFO L280 TraceCheckUtils]: 35: Hoare triple {680#true} #t~short9 := 0 == #t~ret7; {680#true} is VALID [2020-07-11 00:33:03,961 INFO L280 TraceCheckUtils]: 36: Hoare triple {680#true} assume !#t~short9; {711#(not |main_#t~short9|)} is VALID [2020-07-11 00:33:03,962 INFO L280 TraceCheckUtils]: 37: Hoare triple {711#(not |main_#t~short9|)} assume #t~short9; {681#false} is VALID [2020-07-11 00:33:03,962 INFO L280 TraceCheckUtils]: 38: Hoare triple {681#false} havoc #t~short9; {681#false} is VALID [2020-07-11 00:33:03,962 INFO L280 TraceCheckUtils]: 39: Hoare triple {681#false} havoc #t~ret8; {681#false} is VALID [2020-07-11 00:33:03,963 INFO L280 TraceCheckUtils]: 40: Hoare triple {681#false} havoc #t~ret7; {681#false} is VALID [2020-07-11 00:33:03,963 INFO L263 TraceCheckUtils]: 41: Hoare triple {681#false} call #t~ret10 := isfinite_double(~x~0); {728#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:33:03,963 INFO L280 TraceCheckUtils]: 42: Hoare triple {728#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {680#true} is VALID [2020-07-11 00:33:03,963 INFO L280 TraceCheckUtils]: 43: Hoare triple {680#true} havoc ~hx~1; {680#true} is VALID [2020-07-11 00:33:03,964 INFO L280 TraceCheckUtils]: 44: Hoare triple {680#true} SUMMARY for call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L35-2 {680#true} is VALID [2020-07-11 00:33:03,964 INFO L280 TraceCheckUtils]: 45: Hoare triple {680#true} SUMMARY for call write~real(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8); srcloc: L36 {680#true} is VALID [2020-07-11 00:33:03,964 INFO L280 TraceCheckUtils]: 46: Hoare triple {680#true} SUMMARY for call #t~mem4 := read~int(~#gh_u~0.base, 4 + ~#gh_u~0.offset, 4); srcloc: L37 {680#true} is VALID [2020-07-11 00:33:03,965 INFO L280 TraceCheckUtils]: 47: Hoare triple {680#true} ~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-11 00:33:03,965 INFO L280 TraceCheckUtils]: 48: Hoare triple {680#true} SUMMARY for call write~real(#t~union5, ~#gh_u~0.base, ~#gh_u~0.offset, 8); srcloc: L38-1 {680#true} is VALID [2020-07-11 00:33:03,965 INFO L280 TraceCheckUtils]: 49: Hoare triple {680#true} havoc #t~mem4; {680#true} is VALID [2020-07-11 00:33:03,965 INFO L280 TraceCheckUtils]: 50: Hoare triple {680#true} havoc #t~union5; {680#true} is VALID [2020-07-11 00:33:03,966 INFO L280 TraceCheckUtils]: 51: Hoare triple {680#true} SUMMARY for call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); srcloc: L36-1 {680#true} is VALID [2020-07-11 00:33:03,966 INFO L280 TraceCheckUtils]: 52: Hoare triple {680#true} havoc ~#gh_u~0.base, ~#gh_u~0.offset; {680#true} is VALID [2020-07-11 00:33:03,966 INFO L280 TraceCheckUtils]: 53: Hoare triple {680#true} goto; {680#true} is VALID [2020-07-11 00:33:03,967 INFO L280 TraceCheckUtils]: 54: Hoare triple {680#true} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-11 00:33:03,967 INFO L280 TraceCheckUtils]: 55: Hoare triple {680#true} assume true; {680#true} is VALID [2020-07-11 00:33:03,967 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {680#true} {681#false} #111#return; {681#false} is VALID [2020-07-11 00:33:03,967 INFO L280 TraceCheckUtils]: 57: Hoare triple {681#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; {681#false} is VALID [2020-07-11 00:33:03,968 INFO L280 TraceCheckUtils]: 58: Hoare triple {681#false} ~res~0 := ~convertINTToDOUBLE(#t~ret10); {681#false} is VALID [2020-07-11 00:33:03,968 INFO L280 TraceCheckUtils]: 59: Hoare triple {681#false} havoc #t~ret10; {681#false} is VALID [2020-07-11 00:33:03,968 INFO L280 TraceCheckUtils]: 60: Hoare triple {681#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {681#false} is VALID [2020-07-11 00:33:03,968 INFO L280 TraceCheckUtils]: 61: Hoare triple {681#false} assume !false; {681#false} is VALID [2020-07-11 00:33:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:33:03,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [957074824] [2020-07-11 00:33:03,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:33:03,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:33:03,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012792993] [2020-07-11 00:33:03,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2020-07-11 00:33:03,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:33:03,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:33:04,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:04,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:33:04,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:33:04,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:33:04,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:33:04,050 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 5 states. [2020-07-11 00:33:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:04,521 INFO L93 Difference]: Finished difference Result 96 states and 95 transitions. [2020-07-11 00:33:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:33:04,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2020-07-11 00:33:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:33:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:33:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2020-07-11 00:33:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:33:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2020-07-11 00:33:04,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2020-07-11 00:33:04,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:04,643 INFO L225 Difference]: With dead ends: 96 [2020-07-11 00:33:04,643 INFO L226 Difference]: Without dead ends: 70 [2020-07-11 00:33:04,645 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:33:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-11 00:33:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-11 00:33:04,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:33:04,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-11 00:33:04,715 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-11 00:33:04,715 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-11 00:33:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:04,719 INFO L93 Difference]: Finished difference Result 70 states and 69 transitions. [2020-07-11 00:33:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 69 transitions. [2020-07-11 00:33:04,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:04,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:04,721 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-11 00:33:04,721 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-11 00:33:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:33:04,725 INFO L93 Difference]: Finished difference Result 70 states and 69 transitions. [2020-07-11 00:33:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 69 transitions. [2020-07-11 00:33:04,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:33:04,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:33:04,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:33:04,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:33:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-11 00:33:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 69 transitions. [2020-07-11 00:33:04,731 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 69 transitions. Word has length 62 [2020-07-11 00:33:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:33:04,732 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 69 transitions. [2020-07-11 00:33:04,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:33:04,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 69 transitions. [2020-07-11 00:33:04,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:33:04,813 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 69 transitions. [2020-07-11 00:33:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-11 00:33:04,816 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:33:04,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:33:04,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:33:04,816 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:33:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:33:04,817 INFO L82 PathProgramCache]: Analyzing trace with hash 396797035, now seen corresponding path program 1 times [2020-07-11 00:33:04,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:33:04,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [385349120] [2020-07-11 00:33:04,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:33:04,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:33:04,973 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.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1012) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1159) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-11 00:33:04,984 INFO L168 Benchmark]: Toolchain (without parser) took 4188.08 ms. Allocated memory was 134.7 MB in the beginning and 254.8 MB in the end (delta: 120.1 MB). Free memory was 99.1 MB in the beginning and 208.3 MB in the end (delta: -109.1 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:04,985 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 134.7 MB. Free memory was 118.1 MB in the beginning and 117.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 00:33:04,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.60 ms. Allocated memory is still 134.7 MB. Free memory was 98.9 MB in the beginning and 87.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:04,988 INFO L168 Benchmark]: Boogie Preprocessor took 131.36 ms. Allocated memory was 134.7 MB in the beginning and 198.2 MB in the end (delta: 63.4 MB). Free memory was 87.8 MB in the beginning and 175.3 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:04,989 INFO L168 Benchmark]: RCFGBuilder took 596.86 ms. Allocated memory is still 198.2 MB. Free memory was 175.3 MB in the beginning and 141.5 MB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:33:04,991 INFO L168 Benchmark]: TraceAbstraction took 3165.03 ms. Allocated memory was 198.2 MB in the beginning and 254.8 MB in the end (delta: 56.6 MB). Free memory was 140.8 MB in the beginning and 208.3 MB in the end (delta: -67.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:33:04,999 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.24 ms. Allocated memory is still 134.7 MB. Free memory was 118.1 MB in the beginning and 117.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 286.60 ms. Allocated memory is still 134.7 MB. Free memory was 98.9 MB in the beginning and 87.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.36 ms. Allocated memory was 134.7 MB in the beginning and 198.2 MB in the end (delta: 63.4 MB). Free memory was 87.8 MB in the beginning and 175.3 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 596.86 ms. Allocated memory is still 198.2 MB. Free memory was 175.3 MB in the beginning and 141.5 MB in the end (delta: 33.7 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3165.03 ms. Allocated memory was 198.2 MB in the beginning and 254.8 MB in the end (delta: 56.6 MB). Free memory was 140.8 MB in the beginning and 208.3 MB in the end (delta: -67.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...