/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_max_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:45:21,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:45:21,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:45:21,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:45:21,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:45:21,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:45:21,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:45:21,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:45:21,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:45:21,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:45:21,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:45:21,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:45:21,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:45:21,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:45:21,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:45:21,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:45:21,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:45:21,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:45:21,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:45:21,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:45:21,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:45:21,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:45:21,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:45:21,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:45:21,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:45:21,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:45:21,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:45:21,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:45:21,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:45:21,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:45:21,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:45:21,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:45:21,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:45:21,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:45:21,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:45:21,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:45:21,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:45:21,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:45:21,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:45:21,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:45:21,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:45:21,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:45:21,173 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:45:21,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:45:21,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:45:21,177 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:45:21,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:45:21,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:45:21,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:45:21,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:45:21,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:45:21,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:45:21,181 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:45:21,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:45:21,181 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:45:21,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:45:21,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:45:21,182 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:45:21,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:45:21,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:45:21,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:45:21,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:45:21,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:45:21,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:45:21,183 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:45:21,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:45:21,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:45:21,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:45:21,474 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:45:21,475 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:45:21,476 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-10 18:45:21,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e39384d/97d031aa7770494cab5d25e1763c3c8a/FLAG98ec766bc [2020-07-10 18:45:22,005 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:45:22,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_max_incorrect.c [2020-07-10 18:45:22,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e39384d/97d031aa7770494cab5d25e1763c3c8a/FLAG98ec766bc [2020-07-10 18:45:22,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e39384d/97d031aa7770494cab5d25e1763c3c8a [2020-07-10 18:45:22,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:45:22,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:45:22,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:45:22,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:45:22,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:45:22,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:45:22" (1/1) ... [2020-07-10 18:45:22,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b18847a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:22, skipping insertion in model container [2020-07-10 18:45:22,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:45:22" (1/1) ... [2020-07-10 18:45:22,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:45:22,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:45:22,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:45:22,645 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:45:22,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:45:22,695 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:45:22,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:22 WrapperNode [2020-07-10 18:45:22,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:45:22,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:45:22,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:45:22,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:45:22,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:22" (1/1) ... [2020-07-10 18:45:22,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:22" (1/1) ... [2020-07-10 18:45:22,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:22" (1/1) ... [2020-07-10 18:45:22,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:22" (1/1) ... [2020-07-10 18:45:22,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:22" (1/1) ... [2020-07-10 18:45:22,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:22" (1/1) ... [2020-07-10 18:45:22,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:22" (1/1) ... [2020-07-10 18:45:22,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:45:22,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:45:22,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:45:22,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:45:22,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:22" (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-10 18:45:22,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:45:22,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:45:22,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 18:45:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-10 18:45:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2020-07-10 18:45:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-10 18:45:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-10 18:45:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:45:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 18:45:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 18:45:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 18:45:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-10 18:45:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:45:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 18:45:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-10 18:45:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 18:45:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 18:45:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 18:45:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure max [2020-07-10 18:45:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 18:45:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-10 18:45:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 18:45:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-10 18:45:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:45:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:45:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:45:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 18:45:23,538 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:45:23,538 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 18:45:23,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:45:23 BoogieIcfgContainer [2020-07-10 18:45:23,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:45:23,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:45:23,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:45:23,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:45:23,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:45:22" (1/3) ... [2020-07-10 18:45:23,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c356c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:45:23, skipping insertion in model container [2020-07-10 18:45:23,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:45:22" (2/3) ... [2020-07-10 18:45:23,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c356c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:45:23, skipping insertion in model container [2020-07-10 18:45:23,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:45:23" (3/3) ... [2020-07-10 18:45:23,553 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_max_incorrect.c [2020-07-10 18:45:23,565 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:45:23,574 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:45:23,591 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:45:23,615 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:45:23,616 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:45:23,616 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:45:23,616 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:45:23,617 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:45:23,617 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:45:23,617 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:45:23,618 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:45:23,636 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2020-07-10 18:45:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 18:45:23,651 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:45:23,652 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-10 18:45:23,653 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:45:23,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:45:23,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1509507830, now seen corresponding path program 1 times [2020-07-10 18:45:23,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:45:23,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [353485465] [2020-07-10 18:45:23,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:45:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:24,132 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-10 18:45:24,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} #valid := #valid[0 := 0]; {86#true} is VALID [2020-07-10 18:45:24,135 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} assume 0 < #StackHeapBarrier; {86#true} is VALID [2020-07-10 18:45:24,136 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-10 18:45:24,136 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {86#true} {86#true} #122#return; {86#true} is VALID [2020-07-10 18:45:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:24,258 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-10 18:45:24,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} havoc #t~nondet1; {86#true} is VALID [2020-07-10 18:45:24,260 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-10 18:45:24,261 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-10 18:45:24,264 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-10 18:45:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:24,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {86#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {86#true} is VALID [2020-07-10 18:45:24,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} assume ~n.base == 0 && ~n.offset == 0; {86#true} is VALID [2020-07-10 18:45:24,281 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} #res := -2147483648; {86#true} is VALID [2020-07-10 18:45:24,281 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-10 18:45:24,284 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-10 18:45:24,286 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-10 18:45:24,286 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-10 18:45:24,286 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} #valid := #valid[0 := 0]; {86#true} is VALID [2020-07-10 18:45:24,287 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#true} assume 0 < #StackHeapBarrier; {86#true} is VALID [2020-07-10 18:45:24,287 INFO L280 TraceCheckUtils]: 4: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-10 18:45:24,288 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {86#true} {86#true} #122#return; {86#true} is VALID [2020-07-10 18:45:24,288 INFO L263 TraceCheckUtils]: 6: Hoare triple {86#true} call #t~ret16 := main(); {86#true} is VALID [2020-07-10 18:45:24,290 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-10 18:45:24,290 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-10 18:45:24,291 INFO L280 TraceCheckUtils]: 9: Hoare triple {86#true} havoc #t~nondet1; {86#true} is VALID [2020-07-10 18:45:24,293 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-10 18:45:24,294 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-10 18:45:24,296 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-10 18:45:24,298 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-10 18:45:24,299 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-10 18:45:24,300 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-10 18:45:24,300 INFO L280 TraceCheckUtils]: 16: Hoare triple {86#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {86#true} is VALID [2020-07-10 18:45:24,301 INFO L280 TraceCheckUtils]: 17: Hoare triple {86#true} assume ~n.base == 0 && ~n.offset == 0; {86#true} is VALID [2020-07-10 18:45:24,301 INFO L280 TraceCheckUtils]: 18: Hoare triple {86#true} #res := -2147483648; {86#true} is VALID [2020-07-10 18:45:24,301 INFO L280 TraceCheckUtils]: 19: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-10 18:45:24,303 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-10 18:45:24,305 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-10 18:45:24,306 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-10 18:45:24,307 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-10 18:45:24,309 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-10 18:45:24,310 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-10 18:45:24,312 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-10 18:45:24,313 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-10 18:45:24,314 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-10 18:45:24,314 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-10 18:45:24,315 INFO L280 TraceCheckUtils]: 30: Hoare triple {87#false} ~cond := #in~cond; {87#false} is VALID [2020-07-10 18:45:24,315 INFO L280 TraceCheckUtils]: 31: Hoare triple {87#false} assume 0 == ~cond; {87#false} is VALID [2020-07-10 18:45:24,315 INFO L280 TraceCheckUtils]: 32: Hoare triple {87#false} assume !false; {87#false} is VALID [2020-07-10 18:45:24,335 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-10 18:45:24,335 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:45:24,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [353485465] [2020-07-10 18:45:24,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:45:24,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 18:45:24,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955738126] [2020-07-10 18:45:24,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-10 18:45:24,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:45:24,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 18:45:24,418 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-10 18:45:24,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 18:45:24,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:45:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 18:45:24,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-10 18:45:24,433 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 10 states. [2020-07-10 18:45:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:45:27,446 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2020-07-10 18:45:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 18:45:27,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-10 18:45:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:45:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 18:45:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2020-07-10 18:45:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 18:45:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2020-07-10 18:45:27,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 160 transitions. [2020-07-10 18:45:27,767 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-10 18:45:27,786 INFO L225 Difference]: With dead ends: 134 [2020-07-10 18:45:27,786 INFO L226 Difference]: Without dead ends: 74 [2020-07-10 18:45:27,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-07-10 18:45:27,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-10 18:45:28,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-10 18:45:28,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:45:28,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2020-07-10 18:45:28,008 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-10 18:45:28,008 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-10 18:45:28,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:45:28,018 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2020-07-10 18:45:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2020-07-10 18:45:28,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:45:28,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:45:28,021 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-10 18:45:28,021 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-10 18:45:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:45:28,029 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2020-07-10 18:45:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2020-07-10 18:45:28,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:45:28,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:45:28,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:45:28,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:45:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-10 18:45:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2020-07-10 18:45:28,041 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 33 [2020-07-10 18:45:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:45:28,041 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2020-07-10 18:45:28,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 18:45:28,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 83 transitions. [2020-07-10 18:45:28,181 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-10 18:45:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2020-07-10 18:45:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-10 18:45:28,185 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:45:28,186 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-10 18:45:28,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:45:28,186 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:45:28,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:45:28,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1181568947, now seen corresponding path program 1 times [2020-07-10 18:45:28,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:45:28,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1888931865] [2020-07-10 18:45:28,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:45:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:28,359 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-10 18:45:28,359 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} #valid := #valid[0 := 0]; {694#true} is VALID [2020-07-10 18:45:28,359 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} assume 0 < #StackHeapBarrier; {694#true} is VALID [2020-07-10 18:45:28,360 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-10 18:45:28,360 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {694#true} {694#true} #122#return; {694#true} is VALID [2020-07-10 18:45:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:28,480 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-10 18:45:28,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-10 18:45:28,481 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-10 18:45:28,481 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-10 18:45:28,482 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-10 18:45:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:28,492 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-10 18:45:28,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-10 18:45:28,493 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-10 18:45:28,493 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-10 18:45:28,495 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-10 18:45:28,495 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-10 18:45:28,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-10 18:45:28,497 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-10 18:45:28,497 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-10 18:45:28,498 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-10 18:45:28,499 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-10 18:45:28,500 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-10 18:45:28,501 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-10 18:45:28,502 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-10 18:45:28,502 INFO L280 TraceCheckUtils]: 9: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-10 18:45:28,502 INFO L280 TraceCheckUtils]: 10: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-10 18:45:28,503 INFO L280 TraceCheckUtils]: 11: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-10 18:45:28,504 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-10 18:45:28,504 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-10 18:45:28,505 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-10 18:45:28,506 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-10 18:45:28,507 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-10 18:45:28,507 INFO L280 TraceCheckUtils]: 17: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-10 18:45:28,507 INFO L280 TraceCheckUtils]: 18: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-10 18:45:28,508 INFO L280 TraceCheckUtils]: 19: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-10 18:45:28,509 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-10 18:45:28,510 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-10 18:45:28,510 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-10 18:45:28,511 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-10 18:45:28,512 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-10 18:45:28,513 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-10 18:45:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:45:28,552 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-10 18:45:28,553 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-10 18:45:28,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {751#(= 0 |max_#in~n.base|)} #res := -2147483648; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-10 18:45:28,555 INFO L280 TraceCheckUtils]: 3: Hoare triple {751#(= 0 |max_#in~n.base|)} assume true; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-10 18:45:28,557 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-10 18:45:28,559 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-10 18:45:28,559 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-10 18:45:28,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} #valid := #valid[0 := 0]; {694#true} is VALID [2020-07-10 18:45:28,560 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#true} assume 0 < #StackHeapBarrier; {694#true} is VALID [2020-07-10 18:45:28,560 INFO L280 TraceCheckUtils]: 4: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-10 18:45:28,561 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {694#true} {694#true} #122#return; {694#true} is VALID [2020-07-10 18:45:28,561 INFO L263 TraceCheckUtils]: 6: Hoare triple {694#true} call #t~ret16 := main(); {694#true} is VALID [2020-07-10 18:45:28,563 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-10 18:45:28,563 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-10 18:45:28,564 INFO L280 TraceCheckUtils]: 9: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-10 18:45:28,565 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-10 18:45:28,567 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-10 18:45:28,569 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-10 18:45:28,569 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-10 18:45:28,570 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-10 18:45:28,572 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-10 18:45:28,572 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-10 18:45:28,572 INFO L280 TraceCheckUtils]: 17: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-10 18:45:28,573 INFO L280 TraceCheckUtils]: 18: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-10 18:45:28,573 INFO L280 TraceCheckUtils]: 19: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-10 18:45:28,574 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-10 18:45:28,576 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-10 18:45:28,578 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-10 18:45:28,580 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-10 18:45:28,581 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-10 18:45:28,581 INFO L280 TraceCheckUtils]: 25: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-10 18:45:28,581 INFO L280 TraceCheckUtils]: 26: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-10 18:45:28,581 INFO L280 TraceCheckUtils]: 27: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-10 18:45:28,583 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-10 18:45:28,584 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-10 18:45:28,587 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-10 18:45:28,588 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-10 18:45:28,588 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-10 18:45:28,590 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-10 18:45:28,591 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-10 18:45:28,592 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-10 18:45:28,592 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-10 18:45:28,592 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-10 18:45:28,593 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-10 18:45:28,594 INFO L280 TraceCheckUtils]: 39: Hoare triple {751#(= 0 |max_#in~n.base|)} #res := -2147483648; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-10 18:45:28,594 INFO L280 TraceCheckUtils]: 40: Hoare triple {751#(= 0 |max_#in~n.base|)} assume true; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-10 18:45:28,596 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-10 18:45:28,596 INFO L280 TraceCheckUtils]: 42: Hoare triple {695#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {695#false} is VALID [2020-07-10 18:45:28,596 INFO L280 TraceCheckUtils]: 43: Hoare triple {695#false} ~a~1 := #t~ret14; {695#false} is VALID [2020-07-10 18:45:28,596 INFO L280 TraceCheckUtils]: 44: Hoare triple {695#false} havoc #t~ret14; {695#false} is VALID [2020-07-10 18:45:28,597 INFO L263 TraceCheckUtils]: 45: Hoare triple {695#false} call check(~n.base, ~n.offset, ~a~1); {695#false} is VALID [2020-07-10 18:45:28,597 INFO L280 TraceCheckUtils]: 46: Hoare triple {695#false} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {695#false} is VALID [2020-07-10 18:45:28,597 INFO L280 TraceCheckUtils]: 47: Hoare triple {695#false} ~a := #in~a; {695#false} is VALID [2020-07-10 18:45:28,598 INFO L280 TraceCheckUtils]: 48: Hoare triple {695#false} assume ~n.base != 0 || ~n.offset != 0; {695#false} is VALID [2020-07-10 18:45:28,598 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-10 18:45:28,598 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-10 18:45:28,598 INFO L280 TraceCheckUtils]: 51: Hoare triple {695#false} ~cond := #in~cond; {695#false} is VALID [2020-07-10 18:45:28,599 INFO L280 TraceCheckUtils]: 52: Hoare triple {695#false} assume 0 == ~cond; {695#false} is VALID [2020-07-10 18:45:28,599 INFO L280 TraceCheckUtils]: 53: Hoare triple {695#false} assume !false; {695#false} is VALID [2020-07-10 18:45:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 18:45:28,605 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:45:28,605 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1888931865] [2020-07-10 18:45:28,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:45:28,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 18:45:28,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385638651] [2020-07-10 18:45:28,607 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2020-07-10 18:45:28,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:45:28,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 18:45:28,665 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-10 18:45:28,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 18:45:28,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:45:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 18:45:28,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-07-10 18:45:28,667 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 12 states. [2020-07-10 18:45:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:45:30,999 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2020-07-10 18:45:30,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 18:45:30,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2020-07-10 18:45:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:45:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 18:45:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 111 transitions. [2020-07-10 18:45:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 18:45:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 111 transitions. [2020-07-10 18:45:31,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 111 transitions. [2020-07-10 18:45:31,197 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-10 18:45:31,202 INFO L225 Difference]: With dead ends: 99 [2020-07-10 18:45:31,202 INFO L226 Difference]: Without dead ends: 76 [2020-07-10 18:45:31,204 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2020-07-10 18:45:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-10 18:45:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-07-10 18:45:31,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:45:31,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2020-07-10 18:45:31,378 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2020-07-10 18:45:31,378 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2020-07-10 18:45:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:45:31,385 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-07-10 18:45:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-10 18:45:31,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:45:31,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:45:31,387 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2020-07-10 18:45:31,387 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2020-07-10 18:45:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:45:31,393 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2020-07-10 18:45:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-10 18:45:31,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:45:31,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:45:31,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:45:31,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:45:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 18:45:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2020-07-10 18:45:31,400 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 54 [2020-07-10 18:45:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:45:31,400 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2020-07-10 18:45:31,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 18:45:31,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 86 transitions. [2020-07-10 18:45:31,556 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-10 18:45:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-10 18:45:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-07-10 18:45:31,560 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:45:31,560 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-10 18:45:31,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:45:31,560 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:45:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:45:31,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2103557100, now seen corresponding path program 1 times [2020-07-10 18:45:31,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:45:31,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1509551530] [2020-07-10 18:45:31,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:45:31,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:45:31,578 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-10 18:45:31,584 INFO L168 Benchmark]: Toolchain (without parser) took 9172.56 ms. Allocated memory was 138.9 MB in the beginning and 320.9 MB in the end (delta: 181.9 MB). Free memory was 102.9 MB in the beginning and 190.6 MB in the end (delta: -87.7 MB). Peak memory consumption was 94.2 MB. Max. memory is 7.1 GB. [2020-07-10 18:45:31,585 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 18:45:31,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.53 ms. Allocated memory is still 138.9 MB. Free memory was 102.7 MB in the beginning and 91.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-10 18:45:31,587 INFO L168 Benchmark]: Boogie Preprocessor took 143.34 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 91.6 MB in the beginning and 180.4 MB in the end (delta: -88.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-10 18:45:31,588 INFO L168 Benchmark]: RCFGBuilder took 703.32 ms. Allocated memory is still 203.4 MB. Free memory was 180.4 MB in the beginning and 143.8 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. [2020-07-10 18:45:31,589 INFO L168 Benchmark]: TraceAbstraction took 8036.01 ms. Allocated memory was 203.4 MB in the beginning and 320.9 MB in the end (delta: 117.4 MB). Free memory was 143.2 MB in the beginning and 190.6 MB in the end (delta: -47.4 MB). Peak memory consumption was 70.0 MB. Max. memory is 7.1 GB. [2020-07-10 18:45:31,593 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 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 284.53 ms. Allocated memory is still 138.9 MB. Free memory was 102.7 MB in the beginning and 91.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.34 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 91.6 MB in the beginning and 180.4 MB in the end (delta: -88.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 703.32 ms. Allocated memory is still 203.4 MB. Free memory was 180.4 MB in the beginning and 143.8 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8036.01 ms. Allocated memory was 203.4 MB in the beginning and 320.9 MB in the end (delta: 117.4 MB). Free memory was 143.2 MB in the beginning and 190.6 MB in the end (delta: -47.4 MB). Peak memory consumption was 70.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...