/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/verifythis/tree_max_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:54:07,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:54:07,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:54:07,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:54:07,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:54:07,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:54:07,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:54:07,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:54:07,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:54:07,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:54:07,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:54:07,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:54:07,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:54:07,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:54:07,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:54:07,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:54:08,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:54:08,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:54:08,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:54:08,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:54:08,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:54:08,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:54:08,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:54:08,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:54:08,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:54:08,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:54:08,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:54:08,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:54:08,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:54:08,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:54:08,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:54:08,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:54:08,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:54:08,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:54:08,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:54:08,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:54:08,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:54:08,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:54:08,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:54:08,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:54:08,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:54:08,036 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:54:08,045 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:54:08,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:54:08,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:54:08,047 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:54:08,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:54:08,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:54:08,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:54:08,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:54:08,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:54:08,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:54:08,049 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:54:08,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:54:08,049 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:54:08,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:54:08,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:54:08,050 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:54:08,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:54:08,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:54:08,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:54:08,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:54:08,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:54:08,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:54:08,052 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:54:08,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:54:08,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:54:08,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:54:08,405 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:54:08,405 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:54:08,406 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_max_incorrect.c [2020-07-11 00:54:08,470 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2407ba9/0611f5d707b14c899bdf5565ecef8ed1/FLAG0797a0f40 [2020-07-11 00:54:08,940 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:54:08,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_max_incorrect.c [2020-07-11 00:54:08,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2407ba9/0611f5d707b14c899bdf5565ecef8ed1/FLAG0797a0f40 [2020-07-11 00:54:09,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab2407ba9/0611f5d707b14c899bdf5565ecef8ed1 [2020-07-11 00:54:09,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:54:09,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:54:09,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:54:09,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:54:09,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:54:09,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:54:09" (1/1) ... [2020-07-11 00:54:09,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd4a373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:09, skipping insertion in model container [2020-07-11 00:54:09,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:54:09" (1/1) ... [2020-07-11 00:54:09,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:54:09,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:54:09,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:54:09,580 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:54:09,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:54:09,623 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:54:09,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:09 WrapperNode [2020-07-11 00:54:09,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:54:09,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:54:09,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:54:09,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:54:09,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:09" (1/1) ... [2020-07-11 00:54:09,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:09" (1/1) ... [2020-07-11 00:54:09,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:09" (1/1) ... [2020-07-11 00:54:09,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:09" (1/1) ... [2020-07-11 00:54:09,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:09" (1/1) ... [2020-07-11 00:54:09,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:09" (1/1) ... [2020-07-11 00:54:09,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:09" (1/1) ... [2020-07-11 00:54:09,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:54:09,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:54:09,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:54:09,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:54:09,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:09" (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:54:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:54:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:54:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 00:54:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-11 00:54:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2020-07-11 00:54:09,864 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-11 00:54:09,864 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-11 00:54:09,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:54:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 00:54:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-11 00:54:09,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:54:09,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-11 00:54:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:54:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 00:54:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-11 00:54:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 00:54:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 00:54:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-11 00:54:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure max [2020-07-11 00:54:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-11 00:54:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-11 00:54:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 00:54:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-11 00:54:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:54:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:54:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:54:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 00:54:10,401 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:54:10,402 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:54:10,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:54:10 BoogieIcfgContainer [2020-07-11 00:54:10,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:54:10,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:54:10,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:54:10,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:54:10,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:54:09" (1/3) ... [2020-07-11 00:54:10,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1488367c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:54:10, skipping insertion in model container [2020-07-11 00:54:10,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:09" (2/3) ... [2020-07-11 00:54:10,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1488367c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:54:10, skipping insertion in model container [2020-07-11 00:54:10,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:54:10" (3/3) ... [2020-07-11 00:54:10,418 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_max_incorrect.c [2020-07-11 00:54:10,427 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:54:10,436 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:54:10,450 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:54:10,473 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:54:10,474 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:54:10,474 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:54:10,474 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:54:10,474 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:54:10,474 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:54:10,475 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:54:10,475 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:54:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2020-07-11 00:54:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 00:54:10,504 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:10,505 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] [2020-07-11 00:54:10,506 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:10,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:10,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1509507830, now seen corresponding path program 1 times [2020-07-11 00:54:10,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:10,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1554640144] [2020-07-11 00:54:10,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:10,919 INFO L280 TraceCheckUtils]: 0: Hoare triple {108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {86#true} is VALID [2020-07-11 00:54:10,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} #valid := #valid[0 := 0]; {86#true} is VALID [2020-07-11 00:54:10,920 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} assume 0 < #StackHeapBarrier; {86#true} is VALID [2020-07-11 00:54:10,921 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-11 00:54:10,922 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {86#true} {86#true} #122#return; {86#true} is VALID [2020-07-11 00:54:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:11,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256; {86#true} is VALID [2020-07-11 00:54:11,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} havoc #t~nondet1; {86#true} is VALID [2020-07-11 00:54:11,029 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} #res.base, #res.offset := 0, 0; {110#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-11 00:54:11,031 INFO L280 TraceCheckUtils]: 3: Hoare triple {110#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {110#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-11 00:54:11,033 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {110#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {86#true} #108#return; {98#(and (= |main_#t~ret15.offset| 0) (= 0 |main_#t~ret15.base|))} is VALID [2020-07-11 00:54:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:11,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {86#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {86#true} is VALID [2020-07-11 00:54:11,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} assume ~n.base == 0 && ~n.offset == 0; {86#true} is VALID [2020-07-11 00:54:11,047 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} #res := -2147483648; {86#true} is VALID [2020-07-11 00:54:11,047 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-11 00:54:11,050 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {86#true} {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} #118#return; {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-11 00:54:11,052 INFO L263 TraceCheckUtils]: 0: Hoare triple {86#true} call ULTIMATE.init(); {108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:54:11,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {86#true} is VALID [2020-07-11 00:54:11,053 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} #valid := #valid[0 := 0]; {86#true} is VALID [2020-07-11 00:54:11,053 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#true} assume 0 < #StackHeapBarrier; {86#true} is VALID [2020-07-11 00:54:11,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-11 00:54:11,054 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {86#true} {86#true} #122#return; {86#true} is VALID [2020-07-11 00:54:11,055 INFO L263 TraceCheckUtils]: 6: Hoare triple {86#true} call #t~ret16 := main(); {86#true} is VALID [2020-07-11 00:54:11,056 INFO L263 TraceCheckUtils]: 7: Hoare triple {86#true} call #t~ret15.base, #t~ret15.offset := nondet_tree(); {109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 00:54:11,057 INFO L280 TraceCheckUtils]: 8: Hoare triple {109#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256; {86#true} is VALID [2020-07-11 00:54:11,057 INFO L280 TraceCheckUtils]: 9: Hoare triple {86#true} havoc #t~nondet1; {86#true} is VALID [2020-07-11 00:54:11,058 INFO L280 TraceCheckUtils]: 10: Hoare triple {86#true} #res.base, #res.offset := 0, 0; {110#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-11 00:54:11,059 INFO L280 TraceCheckUtils]: 11: Hoare triple {110#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {110#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID [2020-07-11 00:54:11,061 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {110#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {86#true} #108#return; {98#(and (= |main_#t~ret15.offset| 0) (= 0 |main_#t~ret15.base|))} is VALID [2020-07-11 00:54:11,063 INFO L263 TraceCheckUtils]: 13: Hoare triple {98#(and (= |main_#t~ret15.offset| 0) (= 0 |main_#t~ret15.base|))} call task(#t~ret15.base, #t~ret15.offset); {99#(and (= 0 |task_#in~n.offset|) (= |task_#in~n.base| 0))} is VALID [2020-07-11 00:54:11,065 INFO L280 TraceCheckUtils]: 14: Hoare triple {99#(and (= 0 |task_#in~n.offset|) (= |task_#in~n.base| 0))} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-11 00:54:11,065 INFO L263 TraceCheckUtils]: 15: Hoare triple {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} call #t~ret14 := max(~n.base, ~n.offset); {86#true} is VALID [2020-07-11 00:54:11,066 INFO L280 TraceCheckUtils]: 16: Hoare triple {86#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {86#true} is VALID [2020-07-11 00:54:11,066 INFO L280 TraceCheckUtils]: 17: Hoare triple {86#true} assume ~n.base == 0 && ~n.offset == 0; {86#true} is VALID [2020-07-11 00:54:11,066 INFO L280 TraceCheckUtils]: 18: Hoare triple {86#true} #res := -2147483648; {86#true} is VALID [2020-07-11 00:54:11,067 INFO L280 TraceCheckUtils]: 19: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-11 00:54:11,069 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {86#true} {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} #118#return; {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-11 00:54:11,070 INFO L280 TraceCheckUtils]: 21: Hoare triple {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-11 00:54:11,072 INFO L280 TraceCheckUtils]: 22: Hoare triple {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} ~a~1 := #t~ret14; {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-11 00:54:11,073 INFO L280 TraceCheckUtils]: 23: Hoare triple {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} havoc #t~ret14; {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-11 00:54:11,075 INFO L263 TraceCheckUtils]: 24: Hoare triple {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} call check(~n.base, ~n.offset, ~a~1); {106#(and (= 0 |check_#in~n.offset|) (= 0 |check_#in~n.base|))} is VALID [2020-07-11 00:54:11,076 INFO L280 TraceCheckUtils]: 25: Hoare triple {106#(and (= 0 |check_#in~n.offset|) (= 0 |check_#in~n.base|))} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {107#(and (= 0 check_~n.offset) (= 0 check_~n.base))} is VALID [2020-07-11 00:54:11,077 INFO L280 TraceCheckUtils]: 26: Hoare triple {107#(and (= 0 check_~n.offset) (= 0 check_~n.base))} ~a := #in~a; {107#(and (= 0 check_~n.offset) (= 0 check_~n.base))} is VALID [2020-07-11 00:54:11,078 INFO L280 TraceCheckUtils]: 27: Hoare triple {107#(and (= 0 check_~n.offset) (= 0 check_~n.base))} assume ~n.base != 0 || ~n.offset != 0; {87#false} is VALID [2020-07-11 00:54:11,078 INFO L280 TraceCheckUtils]: 28: Hoare triple {87#false} SUMMARY for call #t~mem10 := read~int(~n.base, ~n.offset, 4); srcloc: L42 {87#false} is VALID [2020-07-11 00:54:11,079 INFO L263 TraceCheckUtils]: 29: Hoare triple {87#false} call __VERIFIER_assert((if #t~mem10 <= ~a then 1 else 0)); {87#false} is VALID [2020-07-11 00:54:11,079 INFO L280 TraceCheckUtils]: 30: Hoare triple {87#false} ~cond := #in~cond; {87#false} is VALID [2020-07-11 00:54:11,080 INFO L280 TraceCheckUtils]: 31: Hoare triple {87#false} assume 0 == ~cond; {87#false} is VALID [2020-07-11 00:54:11,080 INFO L280 TraceCheckUtils]: 32: Hoare triple {87#false} assume !false; {87#false} is VALID [2020-07-11 00:54:11,086 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:54:11,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1554640144] [2020-07-11 00:54:11,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:54:11,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-11 00:54:11,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706177953] [2020-07-11 00:54:11,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-11 00:54:11,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:11,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 00:54:11,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:11,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 00:54:11,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:11,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 00:54:11,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:54:11,195 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 10 states. [2020-07-11 00:54:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:14,136 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2020-07-11 00:54:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-11 00:54:14,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-11 00:54:14,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:54:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2020-07-11 00:54:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:54:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2020-07-11 00:54:14,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 160 transitions. [2020-07-11 00:54:14,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:14,483 INFO L225 Difference]: With dead ends: 134 [2020-07-11 00:54:14,483 INFO L226 Difference]: Without dead ends: 74 [2020-07-11 00:54:14,488 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-07-11 00:54:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-11 00:54:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-11 00:54:14,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:14,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2020-07-11 00:54:14,697 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-11 00:54:14,698 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-11 00:54:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:14,713 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2020-07-11 00:54:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2020-07-11 00:54:14,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:14,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:14,718 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-11 00:54:14,719 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-11 00:54:14,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:14,741 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2020-07-11 00:54:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2020-07-11 00:54:14,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:14,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:14,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:14,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-11 00:54:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2020-07-11 00:54:14,761 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 33 [2020-07-11 00:54:14,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:14,762 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2020-07-11 00:54:14,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 00:54:14,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 83 transitions. [2020-07-11 00:54:14,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2020-07-11 00:54:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-11 00:54:14,927 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:14,927 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:14,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:54:14,928 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:14,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:14,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1181568947, now seen corresponding path program 1 times [2020-07-11 00:54:14,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:14,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2041620012] [2020-07-11 00:54:14,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:15,073 INFO L280 TraceCheckUtils]: 0: Hoare triple {735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {694#true} is VALID [2020-07-11 00:54:15,073 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} #valid := #valid[0 := 0]; {694#true} is VALID [2020-07-11 00:54:15,073 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} assume 0 < #StackHeapBarrier; {694#true} is VALID [2020-07-11 00:54:15,074 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-11 00:54:15,074 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {694#true} {694#true} #122#return; {694#true} is VALID [2020-07-11 00:54:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:15,236 INFO L280 TraceCheckUtils]: 0: Hoare triple {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256; {694#true} is VALID [2020-07-11 00:54:15,236 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-11 00:54:15,237 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-11 00:54:15,237 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-11 00:54:15,238 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {694#true} {738#(not (= 0 nondet_tree_~n~0.base))} #100#return; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:15,247 INFO L280 TraceCheckUtils]: 0: Hoare triple {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256; {694#true} is VALID [2020-07-11 00:54:15,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-11 00:54:15,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-11 00:54:15,248 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-11 00:54:15,249 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {694#true} {738#(not (= 0 nondet_tree_~n~0.base))} #102#return; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256); {694#true} is VALID [2020-07-11 00:54:15,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-11 00:54:15,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L21 {737#(not (= 0 |nondet_tree_#t~malloc2.base|))} is VALID [2020-07-11 00:54:15,254 INFO L280 TraceCheckUtils]: 3: Hoare triple {737#(not (= 0 |nondet_tree_#t~malloc2.base|))} ~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,254 INFO L280 TraceCheckUtils]: 4: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,255 INFO L280 TraceCheckUtils]: 5: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} SUMMARY for call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4); srcloc: L22-1 {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,256 INFO L280 TraceCheckUtils]: 6: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} havoc #t~nondet3; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,257 INFO L263 TraceCheckUtils]: 7: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 00:54:15,257 INFO L280 TraceCheckUtils]: 8: Hoare triple {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256; {694#true} is VALID [2020-07-11 00:54:15,257 INFO L280 TraceCheckUtils]: 9: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-11 00:54:15,258 INFO L280 TraceCheckUtils]: 10: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-11 00:54:15,258 INFO L280 TraceCheckUtils]: 11: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-11 00:54:15,259 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {694#true} {738#(not (= 0 nondet_tree_~n~0.base))} #100#return; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,260 INFO L280 TraceCheckUtils]: 13: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4); srcloc: L23-1 {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,260 INFO L280 TraceCheckUtils]: 14: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} havoc #t~ret4.base, #t~ret4.offset; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,261 INFO L263 TraceCheckUtils]: 15: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 00:54:15,262 INFO L280 TraceCheckUtils]: 16: Hoare triple {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256; {694#true} is VALID [2020-07-11 00:54:15,262 INFO L280 TraceCheckUtils]: 17: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-11 00:54:15,262 INFO L280 TraceCheckUtils]: 18: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-11 00:54:15,262 INFO L280 TraceCheckUtils]: 19: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-11 00:54:15,263 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {694#true} {738#(not (= 0 nondet_tree_~n~0.base))} #102#return; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,264 INFO L280 TraceCheckUtils]: 21: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4); srcloc: L24-1 {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,265 INFO L280 TraceCheckUtils]: 22: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} havoc #t~ret5.base, #t~ret5.offset; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,265 INFO L280 TraceCheckUtils]: 23: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} #res.base, #res.offset := ~n~0.base, ~n~0.offset; {749#(not (= |nondet_tree_#res.base| 0))} is VALID [2020-07-11 00:54:15,266 INFO L280 TraceCheckUtils]: 24: Hoare triple {749#(not (= |nondet_tree_#res.base| 0))} assume true; {749#(not (= |nondet_tree_#res.base| 0))} is VALID [2020-07-11 00:54:15,267 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {749#(not (= |nondet_tree_#res.base| 0))} {694#true} #108#return; {727#(not (= 0 |main_#t~ret15.base|))} is VALID [2020-07-11 00:54:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:15,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {694#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {750#(= max_~n.base |max_#in~n.base|)} is VALID [2020-07-11 00:54:15,303 INFO L280 TraceCheckUtils]: 1: Hoare triple {750#(= max_~n.base |max_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-11 00:54:15,303 INFO L280 TraceCheckUtils]: 2: Hoare triple {751#(= 0 |max_#in~n.base|)} #res := -2147483648; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-11 00:54:15,304 INFO L280 TraceCheckUtils]: 3: Hoare triple {751#(= 0 |max_#in~n.base|)} assume true; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-11 00:54:15,305 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {751#(= 0 |max_#in~n.base|)} {729#(not (= 0 task_~n.base))} #118#return; {695#false} is VALID [2020-07-11 00:54:15,307 INFO L263 TraceCheckUtils]: 0: Hoare triple {694#true} call ULTIMATE.init(); {735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:54:15,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {694#true} is VALID [2020-07-11 00:54:15,307 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} #valid := #valid[0 := 0]; {694#true} is VALID [2020-07-11 00:54:15,308 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#true} assume 0 < #StackHeapBarrier; {694#true} is VALID [2020-07-11 00:54:15,308 INFO L280 TraceCheckUtils]: 4: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-11 00:54:15,308 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {694#true} {694#true} #122#return; {694#true} is VALID [2020-07-11 00:54:15,309 INFO L263 TraceCheckUtils]: 6: Hoare triple {694#true} call #t~ret16 := main(); {694#true} is VALID [2020-07-11 00:54:15,310 INFO L263 TraceCheckUtils]: 7: Hoare triple {694#true} call #t~ret15.base, #t~ret15.offset := nondet_tree(); {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 00:54:15,311 INFO L280 TraceCheckUtils]: 8: Hoare triple {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256); {694#true} is VALID [2020-07-11 00:54:15,311 INFO L280 TraceCheckUtils]: 9: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-11 00:54:15,313 INFO L280 TraceCheckUtils]: 10: Hoare triple {694#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L21 {737#(not (= 0 |nondet_tree_#t~malloc2.base|))} is VALID [2020-07-11 00:54:15,316 INFO L280 TraceCheckUtils]: 11: Hoare triple {737#(not (= 0 |nondet_tree_#t~malloc2.base|))} ~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,318 INFO L280 TraceCheckUtils]: 12: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,318 INFO L280 TraceCheckUtils]: 13: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} SUMMARY for call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4); srcloc: L22-1 {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,319 INFO L280 TraceCheckUtils]: 14: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} havoc #t~nondet3; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,320 INFO L263 TraceCheckUtils]: 15: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 00:54:15,320 INFO L280 TraceCheckUtils]: 16: Hoare triple {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256; {694#true} is VALID [2020-07-11 00:54:15,320 INFO L280 TraceCheckUtils]: 17: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-11 00:54:15,321 INFO L280 TraceCheckUtils]: 18: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-11 00:54:15,321 INFO L280 TraceCheckUtils]: 19: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-11 00:54:15,322 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {694#true} {738#(not (= 0 nondet_tree_~n~0.base))} #100#return; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,322 INFO L280 TraceCheckUtils]: 21: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4); srcloc: L23-1 {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,322 INFO L280 TraceCheckUtils]: 22: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} havoc #t~ret4.base, #t~ret4.offset; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,323 INFO L263 TraceCheckUtils]: 23: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-11 00:54:15,324 INFO L280 TraceCheckUtils]: 24: Hoare triple {736#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256; {694#true} is VALID [2020-07-11 00:54:15,324 INFO L280 TraceCheckUtils]: 25: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-11 00:54:15,324 INFO L280 TraceCheckUtils]: 26: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-11 00:54:15,324 INFO L280 TraceCheckUtils]: 27: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-11 00:54:15,330 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {694#true} {738#(not (= 0 nondet_tree_~n~0.base))} #102#return; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,331 INFO L280 TraceCheckUtils]: 29: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4); srcloc: L24-1 {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,332 INFO L280 TraceCheckUtils]: 30: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} havoc #t~ret5.base, #t~ret5.offset; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-11 00:54:15,332 INFO L280 TraceCheckUtils]: 31: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} #res.base, #res.offset := ~n~0.base, ~n~0.offset; {749#(not (= |nondet_tree_#res.base| 0))} is VALID [2020-07-11 00:54:15,333 INFO L280 TraceCheckUtils]: 32: Hoare triple {749#(not (= |nondet_tree_#res.base| 0))} assume true; {749#(not (= |nondet_tree_#res.base| 0))} is VALID [2020-07-11 00:54:15,334 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {749#(not (= |nondet_tree_#res.base| 0))} {694#true} #108#return; {727#(not (= 0 |main_#t~ret15.base|))} is VALID [2020-07-11 00:54:15,335 INFO L263 TraceCheckUtils]: 34: Hoare triple {727#(not (= 0 |main_#t~ret15.base|))} call task(#t~ret15.base, #t~ret15.offset); {728#(not (= |task_#in~n.base| 0))} is VALID [2020-07-11 00:54:15,336 INFO L280 TraceCheckUtils]: 35: Hoare triple {728#(not (= |task_#in~n.base| 0))} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {729#(not (= 0 task_~n.base))} is VALID [2020-07-11 00:54:15,336 INFO L263 TraceCheckUtils]: 36: Hoare triple {729#(not (= 0 task_~n.base))} call #t~ret14 := max(~n.base, ~n.offset); {694#true} is VALID [2020-07-11 00:54:15,337 INFO L280 TraceCheckUtils]: 37: Hoare triple {694#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {750#(= max_~n.base |max_#in~n.base|)} is VALID [2020-07-11 00:54:15,337 INFO L280 TraceCheckUtils]: 38: Hoare triple {750#(= max_~n.base |max_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-11 00:54:15,338 INFO L280 TraceCheckUtils]: 39: Hoare triple {751#(= 0 |max_#in~n.base|)} #res := -2147483648; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-11 00:54:15,339 INFO L280 TraceCheckUtils]: 40: Hoare triple {751#(= 0 |max_#in~n.base|)} assume true; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-11 00:54:15,341 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {751#(= 0 |max_#in~n.base|)} {729#(not (= 0 task_~n.base))} #118#return; {695#false} is VALID [2020-07-11 00:54:15,342 INFO L280 TraceCheckUtils]: 42: Hoare triple {695#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {695#false} is VALID [2020-07-11 00:54:15,342 INFO L280 TraceCheckUtils]: 43: Hoare triple {695#false} ~a~1 := #t~ret14; {695#false} is VALID [2020-07-11 00:54:15,342 INFO L280 TraceCheckUtils]: 44: Hoare triple {695#false} havoc #t~ret14; {695#false} is VALID [2020-07-11 00:54:15,343 INFO L263 TraceCheckUtils]: 45: Hoare triple {695#false} call check(~n.base, ~n.offset, ~a~1); {695#false} is VALID [2020-07-11 00:54:15,343 INFO L280 TraceCheckUtils]: 46: Hoare triple {695#false} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {695#false} is VALID [2020-07-11 00:54:15,344 INFO L280 TraceCheckUtils]: 47: Hoare triple {695#false} ~a := #in~a; {695#false} is VALID [2020-07-11 00:54:15,344 INFO L280 TraceCheckUtils]: 48: Hoare triple {695#false} assume ~n.base != 0 || ~n.offset != 0; {695#false} is VALID [2020-07-11 00:54:15,344 INFO L280 TraceCheckUtils]: 49: Hoare triple {695#false} SUMMARY for call #t~mem10 := read~int(~n.base, ~n.offset, 4); srcloc: L42 {695#false} is VALID [2020-07-11 00:54:15,344 INFO L263 TraceCheckUtils]: 50: Hoare triple {695#false} call __VERIFIER_assert((if #t~mem10 <= ~a then 1 else 0)); {695#false} is VALID [2020-07-11 00:54:15,345 INFO L280 TraceCheckUtils]: 51: Hoare triple {695#false} ~cond := #in~cond; {695#false} is VALID [2020-07-11 00:54:15,345 INFO L280 TraceCheckUtils]: 52: Hoare triple {695#false} assume 0 == ~cond; {695#false} is VALID [2020-07-11 00:54:15,345 INFO L280 TraceCheckUtils]: 53: Hoare triple {695#false} assume !false; {695#false} is VALID [2020-07-11 00:54:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-11 00:54:15,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2041620012] [2020-07-11 00:54:15,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:54:15,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-11 00:54:15,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712318833] [2020-07-11 00:54:15,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2020-07-11 00:54:15,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:15,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 00:54:15,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:15,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 00:54:15,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:15,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 00:54:15,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-07-11 00:54:15,410 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 12 states. [2020-07-11 00:54:17,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:17,598 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2020-07-11 00:54:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 00:54:17,598 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2020-07-11 00:54:17,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 00:54:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 111 transitions. [2020-07-11 00:54:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 00:54:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 111 transitions. [2020-07-11 00:54:17,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 111 transitions. [2020-07-11 00:54:17,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:17,790 INFO L225 Difference]: With dead ends: 99 [2020-07-11 00:54:17,790 INFO L226 Difference]: Without dead ends: 76 [2020-07-11 00:54:17,791 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2020-07-11 00:54:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-11 00:54:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-07-11 00:54:17,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:17,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2020-07-11 00:54:17,972 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2020-07-11 00:54:17,972 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2020-07-11 00:54:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:17,979 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-07-11 00:54:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-11 00:54:17,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:17,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:17,981 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2020-07-11 00:54:17,981 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2020-07-11 00:54:17,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:17,987 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-07-11 00:54:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-11 00:54:17,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:17,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:17,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:17,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-11 00:54:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2020-07-11 00:54:17,997 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 54 [2020-07-11 00:54:17,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:17,997 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2020-07-11 00:54:17,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 00:54:17,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 86 transitions. [2020-07-11 00:54:18,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-11 00:54:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-11 00:54:18,166 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:18,166 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:18,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:54:18,166 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:18,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:18,167 INFO L82 PathProgramCache]: Analyzing trace with hash 2103557100, now seen corresponding path program 1 times [2020-07-11 00:54:18,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:18,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [597291592] [2020-07-11 00:54:18,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:54:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:54:18,285 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 00:54:18,285 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 00:54:18,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:54:18,339 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 00:54:18,340 WARN L170 areAnnotationChecker]: taskENTRY has no Hoare annotation [2020-07-11 00:54:18,340 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-11 00:54:18,340 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-11 00:54:18,340 WARN L170 areAnnotationChecker]: maxENTRY has no Hoare annotation [2020-07-11 00:54:18,340 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:54:18,340 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 00:54:18,340 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 00:54:18,341 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 00:54:18,341 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 00:54:18,341 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2020-07-11 00:54:18,341 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:54:18,341 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-11 00:54:18,341 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-11 00:54:18,341 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-11 00:54:18,342 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-11 00:54:18,342 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-11 00:54:18,342 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-11 00:54:18,342 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:54:18,342 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 00:54:18,342 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-11 00:54:18,342 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-11 00:54:18,342 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-11 00:54:18,343 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-11 00:54:18,343 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-11 00:54:18,343 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 00:54:18,343 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-11 00:54:18,343 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-11 00:54:18,343 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 00:54:18,343 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-11 00:54:18,343 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-11 00:54:18,344 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 00:54:18,344 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-11 00:54:18,344 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-11 00:54:18,344 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-11 00:54:18,344 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-11 00:54:18,344 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-11 00:54:18,344 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-11 00:54:18,345 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 00:54:18,345 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2020-07-11 00:54:18,345 WARN L170 areAnnotationChecker]: nondet_treeFINAL has no Hoare annotation [2020-07-11 00:54:18,345 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-11 00:54:18,345 WARN L170 areAnnotationChecker]: maxFINAL has no Hoare annotation [2020-07-11 00:54:18,345 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-11 00:54:18,345 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-11 00:54:18,346 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 00:54:18,346 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 00:54:18,346 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-11 00:54:18,346 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-11 00:54:18,346 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 00:54:18,346 WARN L170 areAnnotationChecker]: L53-3 has no Hoare annotation [2020-07-11 00:54:18,346 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-11 00:54:18,347 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-11 00:54:18,347 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-11 00:54:18,347 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 00:54:18,347 WARN L170 areAnnotationChecker]: maxEXIT has no Hoare annotation [2020-07-11 00:54:18,347 WARN L170 areAnnotationChecker]: maxEXIT has no Hoare annotation [2020-07-11 00:54:18,347 WARN L170 areAnnotationChecker]: maxEXIT has no Hoare annotation [2020-07-11 00:54:18,347 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-11 00:54:18,347 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 00:54:18,348 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-11 00:54:18,348 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-11 00:54:18,348 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-11 00:54:18,348 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-11 00:54:18,348 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-11 00:54:18,348 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-11 00:54:18,348 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-11 00:54:18,348 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-11 00:54:18,348 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-11 00:54:18,349 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-11 00:54:18,349 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-11 00:54:18,349 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2020-07-11 00:54:18,349 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-11 00:54:18,349 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-11 00:54:18,349 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-11 00:54:18,349 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-11 00:54:18,349 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-11 00:54:18,350 WARN L170 areAnnotationChecker]: taskFINAL has no Hoare annotation [2020-07-11 00:54:18,350 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-11 00:54:18,350 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-11 00:54:18,350 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2020-07-11 00:54:18,350 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2020-07-11 00:54:18,350 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-11 00:54:18,350 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-11 00:54:18,350 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-11 00:54:18,351 WARN L170 areAnnotationChecker]: taskEXIT has no Hoare annotation [2020-07-11 00:54:18,351 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-11 00:54:18,351 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-11 00:54:18,351 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-11 00:54:18,351 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 00:54:18,351 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 00:54:18,351 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2020-07-11 00:54:18,351 WARN L170 areAnnotationChecker]: L33-5 has no Hoare annotation [2020-07-11 00:54:18,351 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-11 00:54:18,352 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-11 00:54:18,352 WARN L170 areAnnotationChecker]: L34-5 has no Hoare annotation [2020-07-11 00:54:18,352 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-11 00:54:18,352 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-11 00:54:18,352 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-11 00:54:18,352 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-11 00:54:18,352 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-11 00:54:18,352 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-11 00:54:18,353 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-11 00:54:18,353 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-11 00:54:18,353 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-11 00:54:18,353 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-11 00:54:18,353 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-11 00:54:18,353 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:54:18,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:54:18 BoogieIcfgContainer [2020-07-11 00:54:18,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:54:18,361 INFO L168 Benchmark]: Toolchain (without parser) took 9018.29 ms. Allocated memory was 139.5 MB in the beginning and 337.6 MB in the end (delta: 198.2 MB). Free memory was 102.4 MB in the beginning and 274.1 MB in the end (delta: -171.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:54:18,362 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-11 00:54:18,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.07 ms. Allocated memory is still 139.5 MB. Free memory was 102.2 MB in the beginning and 91.0 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-11 00:54:18,364 INFO L168 Benchmark]: Boogie Preprocessor took 168.76 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 91.0 MB in the beginning and 180.0 MB in the end (delta: -89.0 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:54:18,365 INFO L168 Benchmark]: RCFGBuilder took 613.04 ms. Allocated memory is still 202.9 MB. Free memory was 179.3 MB in the beginning and 143.3 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. [2020-07-11 00:54:18,366 INFO L168 Benchmark]: TraceAbstraction took 7948.36 ms. Allocated memory was 202.9 MB in the beginning and 337.6 MB in the end (delta: 134.7 MB). Free memory was 142.6 MB in the beginning and 274.1 MB in the end (delta: -131.5 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:54:18,370 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.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.07 ms. Allocated memory is still 139.5 MB. Free memory was 102.2 MB in the beginning and 91.0 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 168.76 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 91.0 MB in the beginning and 180.0 MB in the end (delta: -89.0 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 613.04 ms. Allocated memory is still 202.9 MB. Free memory was 179.3 MB in the beginning and 143.3 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7948.36 ms. Allocated memory was 202.9 MB in the beginning and 337.6 MB in the end (delta: 134.7 MB). Free memory was 142.6 MB in the beginning and 274.1 MB in the end (delta: -131.5 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L58] CALL, EXPR nondet_tree() [L18] COND FALSE !(__VERIFIER_nondet_bool()) VAL [__VERIFIER_nondet_bool()=0] [L21] struct node *n = (struct node *)malloc(sizeof(struct node)); VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L22] n->data = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2147483647, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L23] CALL, EXPR nondet_tree() [L18] COND TRUE __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=1] [L19] return 0; VAL [\result={0:0}] [L23] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L23] n->left = nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L24] CALL, EXPR nondet_tree() [L18] COND TRUE __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=1] [L19] return 0; VAL [\result={0:0}] [L24] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L24] n->right = nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L25] return n; VAL [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L58] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L58] CALL task(nondet_tree()) VAL [n={-1:0}] [L53] CALL, EXPR max(n) VAL [n={-1:0}] [L30] COND FALSE !(!n) VAL [n={-1:0}, n={-1:0}] [L33] EXPR n->left VAL [n={-1:0}, n={-1:0}, n->left={0:0}] [L33] CALL, EXPR max(n->left) VAL [n={0:0}] [L30] COND TRUE !n VAL [n={0:0}, n={0:0}] [L31] return -2147483648; VAL [\result=-2147483648, n={0:0}, n={0:0}] [L33] RET, EXPR max(n->left) VAL [max(n->left)=-2147483648, n={-1:0}, n={-1:0}, n->left={0:0}] [L33] int a = max(n->left); VAL [a=-2147483648, max(n->left)=-2147483648, n={-1:0}, n={-1:0}, n->left={0:0}] [L34] EXPR n->right VAL [a=-2147483648, n={-1:0}, n={-1:0}, n->right={0:0}] [L34] CALL, EXPR max(n->right) VAL [n={0:0}] [L30] COND TRUE !n VAL [n={0:0}, n={0:0}] [L31] return -2147483648; VAL [\result=-2147483648, n={0:0}, n={0:0}] [L34] RET, EXPR max(n->right) VAL [a=-2147483648, max(n->right)=-2147483648, n={-1:0}, n={-1:0}, n->right={0:0}] [L34] int b = max(n->right); VAL [a=-2147483648, b=-2147483648, max(n->right)=-2147483648, n={-1:0}, n={-1:0}, n->right={0:0}] [L35] COND TRUE a >= b VAL [a=-2147483648, b=-2147483648, n={-1:0}, n={-1:0}] [L35] return a; VAL [\result=-2147483648, a=-2147483648, b=-2147483648, n={-1:0}, n={-1:0}] [L53] RET, EXPR max(n) VAL [max(n)=-2147483648, n={-1:0}, n={-1:0}] [L53] int a = max(n); VAL [a=-2147483648, max(n)=-2147483648, n={-1:0}, n={-1:0}] [L54] CALL check(n, a) VAL [\old(a)=-2147483648, n={-1:0}] [L41] COND TRUE \read(*n) VAL [\old(a)=-2147483648, a=-2147483648, n={-1:0}, n={-1:0}] [L42] EXPR n->data VAL [\old(a)=-2147483648, a=-2147483648, n={-1:0}, n={-1:0}, n->data=-2147483647] [L42] CALL __VERIFIER_assert(n->data <= a) VAL [\old(cond)=0] [L9] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L9] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.8s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 139 SDtfs, 269 SDslu, 374 SDs, 0 SdLazy, 921 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 13119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 11/11 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...