/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/ldv-regression/test21-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 05:13:31,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 05:13:31,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 05:13:31,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 05:13:31,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 05:13:31,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 05:13:31,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 05:13:31,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 05:13:31,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 05:13:31,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 05:13:31,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 05:13:31,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 05:13:31,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 05:13:31,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 05:13:31,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 05:13:31,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 05:13:31,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 05:13:31,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 05:13:31,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 05:13:31,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 05:13:31,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 05:13:31,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 05:13:31,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 05:13:31,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 05:13:31,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 05:13:31,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 05:13:31,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 05:13:31,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 05:13:31,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 05:13:31,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 05:13:31,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 05:13:31,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 05:13:31,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 05:13:31,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 05:13:31,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 05:13:31,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 05:13:31,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 05:13:31,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 05:13:31,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 05:13:31,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 05:13:31,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 05:13:31,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 05:13:31,949 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 05:13:31,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 05:13:31,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 05:13:31,951 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 05:13:31,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 05:13:31,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 05:13:31,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 05:13:31,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 05:13:31,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 05:13:31,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 05:13:31,952 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 05:13:31,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 05:13:31,953 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 05:13:31,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 05:13:31,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 05:13:31,953 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 05:13:31,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 05:13:31,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 05:13:31,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:13:31,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 05:13:31,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 05:13:31,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 05:13:31,955 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-18 05:13:32,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 05:13:32,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 05:13:32,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 05:13:32,243 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 05:13:32,244 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 05:13:32,244 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test21-1.c [2020-07-18 05:13:32,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a34956a/2e7adc6de1434f069b42b894446a256e/FLAG3b324496b [2020-07-18 05:13:32,751 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 05:13:32,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test21-1.c [2020-07-18 05:13:32,758 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a34956a/2e7adc6de1434f069b42b894446a256e/FLAG3b324496b [2020-07-18 05:13:33,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19a34956a/2e7adc6de1434f069b42b894446a256e [2020-07-18 05:13:33,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 05:13:33,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 05:13:33,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 05:13:33,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 05:13:33,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 05:13:33,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:13:33" (1/1) ... [2020-07-18 05:13:33,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3168b03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:13:33, skipping insertion in model container [2020-07-18 05:13:33,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:13:33" (1/1) ... [2020-07-18 05:13:33,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 05:13:33,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 05:13:33,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:13:33,456 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 05:13:33,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:13:33,498 INFO L208 MainTranslator]: Completed translation [2020-07-18 05:13:33,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:13:33 WrapperNode [2020-07-18 05:13:33,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 05:13:33,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 05:13:33,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 05:13:33,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 05:13:33,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:13:33" (1/1) ... [2020-07-18 05:13:33,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:13:33" (1/1) ... [2020-07-18 05:13:33,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:13:33" (1/1) ... [2020-07-18 05:13:33,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:13:33" (1/1) ... [2020-07-18 05:13:33,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:13:33" (1/1) ... [2020-07-18 05:13:33,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:13:33" (1/1) ... [2020-07-18 05:13:33,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:13:33" (1/1) ... [2020-07-18 05:13:33,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 05:13:33,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 05:13:33,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 05:13:33,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 05:13:33,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:13:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:13:33,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 05:13:33,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 05:13:33,695 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-18 05:13:33,695 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2020-07-18 05:13:33,695 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-18 05:13:33,695 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 05:13:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 05:13:33,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 05:13:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-18 05:13:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-18 05:13:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 05:13:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2020-07-18 05:13:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-18 05:13:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 05:13:33,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 05:13:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 05:13:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 05:13:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-18 05:13:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 05:13:33,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 05:13:34,174 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 05:13:34,174 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 05:13:34,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:13:34 BoogieIcfgContainer [2020-07-18 05:13:34,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 05:13:34,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 05:13:34,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 05:13:34,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 05:13:34,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 05:13:33" (1/3) ... [2020-07-18 05:13:34,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f052dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:13:34, skipping insertion in model container [2020-07-18 05:13:34,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:13:33" (2/3) ... [2020-07-18 05:13:34,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f052dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:13:34, skipping insertion in model container [2020-07-18 05:13:34,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:13:34" (3/3) ... [2020-07-18 05:13:34,188 INFO L109 eAbstractionObserver]: Analyzing ICFG test21-1.c [2020-07-18 05:13:34,199 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 05:13:34,206 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 05:13:34,217 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 05:13:34,238 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 05:13:34,238 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 05:13:34,238 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 05:13:34,239 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 05:13:34,239 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 05:13:34,239 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 05:13:34,239 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 05:13:34,239 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 05:13:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-18 05:13:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-18 05:13:34,268 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:13:34,269 INFO L422 BasicCegarLoop]: trace histogram [2, 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] [2020-07-18 05:13:34,269 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:13:34,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:13:34,275 INFO L82 PathProgramCache]: Analyzing trace with hash -487286935, now seen corresponding path program 1 times [2020-07-18 05:13:34,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:13:34,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1607027752] [2020-07-18 05:13:34,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:13:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:13:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:13:34,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {68#true} is VALID [2020-07-18 05:13:34,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-18 05:13:34,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-18 05:13:34,800 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {68#true} is VALID [2020-07-18 05:13:34,801 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {68#true} is VALID [2020-07-18 05:13:34,801 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {68#true} is VALID [2020-07-18 05:13:34,801 INFO L280 TraceCheckUtils]: 6: Hoare triple {68#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {68#true} is VALID [2020-07-18 05:13:34,802 INFO L280 TraceCheckUtils]: 7: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {68#true} is VALID [2020-07-18 05:13:34,802 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {68#true} is VALID [2020-07-18 05:13:34,802 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-18 05:13:34,803 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {68#true} {68#true} #82#return; {68#true} is VALID [2020-07-18 05:13:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:13:34,836 INFO L280 TraceCheckUtils]: 0: Hoare triple {124#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {68#true} is VALID [2020-07-18 05:13:34,837 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {68#true} is VALID [2020-07-18 05:13:34,837 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} havoc #t~nondet0; {68#true} is VALID [2020-07-18 05:13:34,837 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {68#true} is VALID [2020-07-18 05:13:34,838 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {68#true} is VALID [2020-07-18 05:13:34,838 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} havoc #t~nondet1; {68#true} is VALID [2020-07-18 05:13:34,839 INFO L280 TraceCheckUtils]: 6: Hoare triple {68#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {68#true} is VALID [2020-07-18 05:13:34,840 INFO L280 TraceCheckUtils]: 7: Hoare triple {68#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {68#true} is VALID [2020-07-18 05:13:34,840 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} havoc #t~nondet2; {68#true} is VALID [2020-07-18 05:13:34,840 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {68#true} is VALID [2020-07-18 05:13:34,841 INFO L280 TraceCheckUtils]: 10: Hoare triple {68#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {68#true} is VALID [2020-07-18 05:13:34,841 INFO L280 TraceCheckUtils]: 11: Hoare triple {68#true} havoc #t~nondet3; {68#true} is VALID [2020-07-18 05:13:34,842 INFO L280 TraceCheckUtils]: 12: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-18 05:13:34,842 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {68#true} {68#true} #74#return; {68#true} is VALID [2020-07-18 05:13:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:13:34,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {68#true} assume 0 != #t~nondet4 % 256; {68#true} is VALID [2020-07-18 05:13:34,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {125#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-18 05:13:34,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {125#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:34,921 INFO L280 TraceCheckUtils]: 3: Hoare triple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~ite5.base, #t~ite5.offset; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:34,922 INFO L280 TraceCheckUtils]: 4: Hoare triple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~nondet4; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:34,923 INFO L280 TraceCheckUtils]: 5: Hoare triple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:34,925 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {68#true} #76#return; {102#(and (= |~#d1~0.base| |main_#t~ret8.base|) (= |main_#t~ret8.offset| |~#d1~0.offset|))} is VALID [2020-07-18 05:13:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:13:34,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {68#true} assume 0 != #t~nondet4 % 256; {68#true} is VALID [2020-07-18 05:13:34,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {125#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-18 05:13:34,952 INFO L280 TraceCheckUtils]: 2: Hoare triple {125#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:34,953 INFO L280 TraceCheckUtils]: 3: Hoare triple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~ite5.base, #t~ite5.offset; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:34,954 INFO L280 TraceCheckUtils]: 4: Hoare triple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~nondet4; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:34,955 INFO L280 TraceCheckUtils]: 5: Hoare triple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:34,957 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {103#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #78#return; {111#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|))} is VALID [2020-07-18 05:13:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:13:35,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {68#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {127#(and (= |check_#in~s1.base| check_~s1.base) (= check_~s1.offset |check_#in~s1.offset|))} is VALID [2020-07-18 05:13:35,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {127#(and (= |check_#in~s1.base| check_~s1.base) (= check_~s1.offset |check_#in~s1.offset|))} ~s2.base, ~s2.offset := #in~s2.base, #in~s2.offset; {128#(and (or (= check_~s1.base check_~s2.base) (not (= |check_#in~s1.base| |check_#in~s2.base|))) (or (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (not (= check_~s1.base check_~s2.base)) (= check_~s1.offset check_~s2.offset)))} is VALID [2020-07-18 05:13:35,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {128#(and (or (= check_~s1.base check_~s2.base) (not (= |check_#in~s1.base| |check_#in~s2.base|))) (or (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (not (= check_~s1.base check_~s2.base)) (= check_~s1.offset check_~s2.offset)))} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {129#(or (= |check_#t~mem6| (select (select |#memory_int| check_~s2.base) check_~s2.offset)) (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)))} is VALID [2020-07-18 05:13:35,207 INFO L280 TraceCheckUtils]: 3: Hoare triple {129#(or (= |check_#t~mem6| (select (select |#memory_int| check_~s2.base) check_~s2.offset)) (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)))} SUMMARY for call #t~mem7 := read~int(~s2.base, ~s2.offset, 4); srcloc: L27-1 {130#(or (= |check_#t~mem7| |check_#t~mem6|) (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)))} is VALID [2020-07-18 05:13:35,208 INFO L280 TraceCheckUtils]: 4: Hoare triple {130#(or (= |check_#t~mem7| |check_#t~mem6|) (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)))} #res := (if #t~mem6 == #t~mem7 then 1 else 0); {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} is VALID [2020-07-18 05:13:35,209 INFO L280 TraceCheckUtils]: 5: Hoare triple {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} havoc #t~mem7; {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} is VALID [2020-07-18 05:13:35,210 INFO L280 TraceCheckUtils]: 6: Hoare triple {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} havoc #t~mem6; {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} is VALID [2020-07-18 05:13:35,211 INFO L280 TraceCheckUtils]: 7: Hoare triple {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} assume true; {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} is VALID [2020-07-18 05:13:35,213 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} {112#(and (= main_~pd2~0.offset main_~pd1~0.offset) (= main_~pd2~0.base main_~pd1~0.base))} #80#return; {122#(<= 1 |main_#t~ret10|)} is VALID [2020-07-18 05:13:35,216 INFO L263 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {123#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 05:13:35,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {123#(and (= |~#d2~0.offset| |old(~#d2~0.offset)|) (= |~#d1~0.base| |old(~#d1~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#d2~0.base| |old(~#d2~0.base)|) (= |~#d1~0.offset| |old(~#d1~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|))} #NULL.base, #NULL.offset := 0, 0; {68#true} is VALID [2020-07-18 05:13:35,217 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-18 05:13:35,217 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-18 05:13:35,217 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} SUMMARY for call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8); srcloc: L9 {68#true} is VALID [2020-07-18 05:13:35,218 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L9-1 {68#true} is VALID [2020-07-18 05:13:35,218 INFO L280 TraceCheckUtils]: 6: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L9-2 {68#true} is VALID [2020-07-18 05:13:35,218 INFO L280 TraceCheckUtils]: 7: Hoare triple {68#true} SUMMARY for call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8); srcloc: L9-3 {68#true} is VALID [2020-07-18 05:13:35,219 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L9-4 {68#true} is VALID [2020-07-18 05:13:35,219 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#true} SUMMARY for call write~init~int(0, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L9-5 {68#true} is VALID [2020-07-18 05:13:35,219 INFO L280 TraceCheckUtils]: 10: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-18 05:13:35,220 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {68#true} {68#true} #82#return; {68#true} is VALID [2020-07-18 05:13:35,220 INFO L263 TraceCheckUtils]: 12: Hoare triple {68#true} call #t~ret11 := main(); {68#true} is VALID [2020-07-18 05:13:35,221 INFO L263 TraceCheckUtils]: 13: Hoare triple {68#true} call init(); {124#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 05:13:35,221 INFO L280 TraceCheckUtils]: 14: Hoare triple {124#(= |#memory_int| |old(#memory_int)|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {68#true} is VALID [2020-07-18 05:13:35,222 INFO L280 TraceCheckUtils]: 15: Hoare triple {68#true} SUMMARY for call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4); srcloc: L13 {68#true} is VALID [2020-07-18 05:13:35,222 INFO L280 TraceCheckUtils]: 16: Hoare triple {68#true} havoc #t~nondet0; {68#true} is VALID [2020-07-18 05:13:35,222 INFO L280 TraceCheckUtils]: 17: Hoare triple {68#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {68#true} is VALID [2020-07-18 05:13:35,223 INFO L280 TraceCheckUtils]: 18: Hoare triple {68#true} SUMMARY for call write~int(#t~nondet1, ~#d1~0.base, 4 + ~#d1~0.offset, 4); srcloc: L14-1 {68#true} is VALID [2020-07-18 05:13:35,223 INFO L280 TraceCheckUtils]: 19: Hoare triple {68#true} havoc #t~nondet1; {68#true} is VALID [2020-07-18 05:13:35,223 INFO L280 TraceCheckUtils]: 20: Hoare triple {68#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {68#true} is VALID [2020-07-18 05:13:35,224 INFO L280 TraceCheckUtils]: 21: Hoare triple {68#true} SUMMARY for call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4); srcloc: L16-1 {68#true} is VALID [2020-07-18 05:13:35,224 INFO L280 TraceCheckUtils]: 22: Hoare triple {68#true} havoc #t~nondet2; {68#true} is VALID [2020-07-18 05:13:35,224 INFO L280 TraceCheckUtils]: 23: Hoare triple {68#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {68#true} is VALID [2020-07-18 05:13:35,224 INFO L280 TraceCheckUtils]: 24: Hoare triple {68#true} SUMMARY for call write~int(#t~nondet3, ~#d2~0.base, 4 + ~#d2~0.offset, 4); srcloc: L17-1 {68#true} is VALID [2020-07-18 05:13:35,225 INFO L280 TraceCheckUtils]: 25: Hoare triple {68#true} havoc #t~nondet3; {68#true} is VALID [2020-07-18 05:13:35,225 INFO L280 TraceCheckUtils]: 26: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-18 05:13:35,226 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {68#true} {68#true} #74#return; {68#true} is VALID [2020-07-18 05:13:35,226 INFO L263 TraceCheckUtils]: 28: Hoare triple {68#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {68#true} is VALID [2020-07-18 05:13:35,227 INFO L280 TraceCheckUtils]: 29: Hoare triple {68#true} assume 0 != #t~nondet4 % 256; {68#true} is VALID [2020-07-18 05:13:35,228 INFO L280 TraceCheckUtils]: 30: Hoare triple {68#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {125#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-18 05:13:35,229 INFO L280 TraceCheckUtils]: 31: Hoare triple {125#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:35,231 INFO L280 TraceCheckUtils]: 32: Hoare triple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~ite5.base, #t~ite5.offset; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:35,232 INFO L280 TraceCheckUtils]: 33: Hoare triple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~nondet4; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:35,233 INFO L280 TraceCheckUtils]: 34: Hoare triple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:35,235 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {68#true} #76#return; {102#(and (= |~#d1~0.base| |main_#t~ret8.base|) (= |main_#t~ret8.offset| |~#d1~0.offset|))} is VALID [2020-07-18 05:13:35,236 INFO L280 TraceCheckUtils]: 36: Hoare triple {102#(and (= |~#d1~0.base| |main_#t~ret8.base|) (= |main_#t~ret8.offset| |~#d1~0.offset|))} ~pd1~0.base, ~pd1~0.offset := #t~ret8.base, #t~ret8.offset; {103#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-18 05:13:35,237 INFO L280 TraceCheckUtils]: 37: Hoare triple {103#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} havoc #t~ret8.base, #t~ret8.offset; {103#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2020-07-18 05:13:35,238 INFO L263 TraceCheckUtils]: 38: Hoare triple {103#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {68#true} is VALID [2020-07-18 05:13:35,238 INFO L280 TraceCheckUtils]: 39: Hoare triple {68#true} assume 0 != #t~nondet4 % 256; {68#true} is VALID [2020-07-18 05:13:35,239 INFO L280 TraceCheckUtils]: 40: Hoare triple {68#true} #t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {125#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2020-07-18 05:13:35,240 INFO L280 TraceCheckUtils]: 41: Hoare triple {125#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:35,241 INFO L280 TraceCheckUtils]: 42: Hoare triple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~ite5.base, #t~ite5.offset; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:35,242 INFO L280 TraceCheckUtils]: 43: Hoare triple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} havoc #t~nondet4; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:35,243 INFO L280 TraceCheckUtils]: 44: Hoare triple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2020-07-18 05:13:35,244 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {126#(and (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {103#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #78#return; {111#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|))} is VALID [2020-07-18 05:13:35,245 INFO L280 TraceCheckUtils]: 46: Hoare triple {111#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret9.base, #t~ret9.offset; {112#(and (= main_~pd2~0.offset main_~pd1~0.offset) (= main_~pd2~0.base main_~pd1~0.base))} is VALID [2020-07-18 05:13:35,247 INFO L280 TraceCheckUtils]: 47: Hoare triple {112#(and (= main_~pd2~0.offset main_~pd1~0.offset) (= main_~pd2~0.base main_~pd1~0.base))} havoc #t~ret9.base, #t~ret9.offset; {112#(and (= main_~pd2~0.offset main_~pd1~0.offset) (= main_~pd2~0.base main_~pd1~0.base))} is VALID [2020-07-18 05:13:35,248 INFO L280 TraceCheckUtils]: 48: Hoare triple {112#(and (= main_~pd2~0.offset main_~pd1~0.offset) (= main_~pd2~0.base main_~pd1~0.base))} assume (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {112#(and (= main_~pd2~0.offset main_~pd1~0.offset) (= main_~pd2~0.base main_~pd1~0.base))} is VALID [2020-07-18 05:13:35,248 INFO L263 TraceCheckUtils]: 49: Hoare triple {112#(and (= main_~pd2~0.offset main_~pd1~0.offset) (= main_~pd2~0.base main_~pd1~0.base))} call #t~ret10 := check(~pd1~0.base, ~pd1~0.offset, ~pd2~0.base, ~pd2~0.offset); {68#true} is VALID [2020-07-18 05:13:35,249 INFO L280 TraceCheckUtils]: 50: Hoare triple {68#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset; {127#(and (= |check_#in~s1.base| check_~s1.base) (= check_~s1.offset |check_#in~s1.offset|))} is VALID [2020-07-18 05:13:35,251 INFO L280 TraceCheckUtils]: 51: Hoare triple {127#(and (= |check_#in~s1.base| check_~s1.base) (= check_~s1.offset |check_#in~s1.offset|))} ~s2.base, ~s2.offset := #in~s2.base, #in~s2.offset; {128#(and (or (= check_~s1.base check_~s2.base) (not (= |check_#in~s1.base| |check_#in~s2.base|))) (or (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (not (= check_~s1.base check_~s2.base)) (= check_~s1.offset check_~s2.offset)))} is VALID [2020-07-18 05:13:35,253 INFO L280 TraceCheckUtils]: 52: Hoare triple {128#(and (or (= check_~s1.base check_~s2.base) (not (= |check_#in~s1.base| |check_#in~s2.base|))) (or (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (not (= check_~s1.base check_~s2.base)) (= check_~s1.offset check_~s2.offset)))} SUMMARY for call #t~mem6 := read~int(~s1.base, ~s1.offset, 4); srcloc: L27 {129#(or (= |check_#t~mem6| (select (select |#memory_int| check_~s2.base) check_~s2.offset)) (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)))} is VALID [2020-07-18 05:13:35,254 INFO L280 TraceCheckUtils]: 53: Hoare triple {129#(or (= |check_#t~mem6| (select (select |#memory_int| check_~s2.base) check_~s2.offset)) (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)))} SUMMARY for call #t~mem7 := read~int(~s2.base, ~s2.offset, 4); srcloc: L27-1 {130#(or (= |check_#t~mem7| |check_#t~mem6|) (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)))} is VALID [2020-07-18 05:13:35,256 INFO L280 TraceCheckUtils]: 54: Hoare triple {130#(or (= |check_#t~mem7| |check_#t~mem6|) (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)))} #res := (if #t~mem6 == #t~mem7 then 1 else 0); {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} is VALID [2020-07-18 05:13:35,257 INFO L280 TraceCheckUtils]: 55: Hoare triple {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} havoc #t~mem7; {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} is VALID [2020-07-18 05:13:35,258 INFO L280 TraceCheckUtils]: 56: Hoare triple {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} havoc #t~mem6; {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} is VALID [2020-07-18 05:13:35,259 INFO L280 TraceCheckUtils]: 57: Hoare triple {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} assume true; {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} is VALID [2020-07-18 05:13:35,260 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {131#(or (not (= |check_#in~s1.base| |check_#in~s2.base|)) (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (<= 1 |check_#res|))} {112#(and (= main_~pd2~0.offset main_~pd1~0.offset) (= main_~pd2~0.base main_~pd1~0.base))} #80#return; {122#(<= 1 |main_#t~ret10|)} is VALID [2020-07-18 05:13:35,261 INFO L280 TraceCheckUtils]: 59: Hoare triple {122#(<= 1 |main_#t~ret10|)} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; {122#(<= 1 |main_#t~ret10|)} is VALID [2020-07-18 05:13:35,263 INFO L280 TraceCheckUtils]: 60: Hoare triple {122#(<= 1 |main_#t~ret10|)} assume 0 == #t~ret10; {69#false} is VALID [2020-07-18 05:13:35,263 INFO L280 TraceCheckUtils]: 61: Hoare triple {69#false} havoc #t~ret10; {69#false} is VALID [2020-07-18 05:13:35,263 INFO L280 TraceCheckUtils]: 62: Hoare triple {69#false} assume !false; {69#false} is VALID [2020-07-18 05:13:35,276 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-18 05:13:35,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1607027752] [2020-07-18 05:13:35,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:13:35,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-18 05:13:35,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986531808] [2020-07-18 05:13:35,288 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2020-07-18 05:13:35,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:13:35,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-18 05:13:35,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:13:35,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-18 05:13:35,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:13:35,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-18 05:13:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-07-18 05:13:35,415 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 16 states. [2020-07-18 05:13:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:13:39,853 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2020-07-18 05:13:39,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-18 05:13:39,853 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2020-07-18 05:13:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:13:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 05:13:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 105 transitions. [2020-07-18 05:13:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 05:13:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 105 transitions. [2020-07-18 05:13:39,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 105 transitions. [2020-07-18 05:13:40,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:13:40,104 INFO L225 Difference]: With dead ends: 96 [2020-07-18 05:13:40,105 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 05:13:40,111 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2020-07-18 05:13:40,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 05:13:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 05:13:40,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:13:40,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 05:13:40,138 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 05:13:40,138 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 05:13:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:13:40,139 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 05:13:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:13:40,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:13:40,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:13:40,140 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 05:13:40,140 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 05:13:40,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:13:40,140 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 05:13:40,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:13:40,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:13:40,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:13:40,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:13:40,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:13:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 05:13:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 05:13:40,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2020-07-18 05:13:40,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:13:40,144 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 05:13:40,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-18 05:13:40,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 05:13:40,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:13:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:13:40,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:13:40,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 05:13:40,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 05:13:41,371 INFO L264 CegarLoopResult]: At program point initENTRY(lines 11 18) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-18 05:13:41,371 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-18 05:13:41,371 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 05:13:41,372 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-18 05:13:41,372 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-18 05:13:41,372 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-07-18 05:13:41,372 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-18 05:13:41,372 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-18 05:13:41,373 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-18 05:13:41,373 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-18 05:13:41,373 INFO L271 CegarLoopResult]: At program point initEXIT(lines 11 18) the Hoare annotation is: true [2020-07-18 05:13:41,373 INFO L271 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: true [2020-07-18 05:13:41,373 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-18 05:13:41,373 INFO L271 CegarLoopResult]: At program point initFINAL(lines 11 18) the Hoare annotation is: true [2020-07-18 05:13:41,374 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 05:13:41,374 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-18 05:13:41,374 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 9) the Hoare annotation is: true [2020-07-18 05:13:41,374 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~#d2~0.base)| |~#d2~0.base|) (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |old(~#d2~0.offset)| |~#d2~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#d1~0.base)| |~#d1~0.base|) (= |old(~#d1~0.offset)| |~#d1~0.offset|) (= |old(#length)| |#length|)) [2020-07-18 05:13:41,374 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-18 05:13:41,374 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-18 05:13:41,375 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-18 05:13:41,375 INFO L271 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: true [2020-07-18 05:13:41,375 INFO L271 CegarLoopResult]: At program point L9-4(line 9) the Hoare annotation is: true [2020-07-18 05:13:41,375 INFO L271 CegarLoopResult]: At program point L9-5(line 9) the Hoare annotation is: true [2020-07-18 05:13:41,375 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 05:13:41,375 INFO L271 CegarLoopResult]: At program point L22-5(line 22) the Hoare annotation is: true [2020-07-18 05:13:41,376 INFO L271 CegarLoopResult]: At program point get_dummyFINAL(lines 20 23) the Hoare annotation is: true [2020-07-18 05:13:41,376 INFO L271 CegarLoopResult]: At program point get_dummyENTRY(lines 20 23) the Hoare annotation is: true [2020-07-18 05:13:41,376 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-18 05:13:41,376 INFO L271 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: true [2020-07-18 05:13:41,376 INFO L271 CegarLoopResult]: At program point get_dummyEXIT(lines 20 23) the Hoare annotation is: true [2020-07-18 05:13:41,376 INFO L271 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: true [2020-07-18 05:13:41,377 INFO L271 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: true [2020-07-18 05:13:41,377 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 05:13:41,377 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 05:13:41,377 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 05:13:41,377 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 05:13:41,377 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-07-18 05:13:41,377 INFO L264 CegarLoopResult]: At program point L35-2(lines 35 37) the Hoare annotation is: (and (= main_~pd2~0.offset main_~pd1~0.offset) (<= 1 |main_#t~ret10|) (= main_~pd2~0.base main_~pd1~0.base)) [2020-07-18 05:13:41,378 INFO L271 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-07-18 05:13:41,378 INFO L264 CegarLoopResult]: At program point L35-3(line 35) the Hoare annotation is: false [2020-07-18 05:13:41,378 INFO L271 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-07-18 05:13:41,378 INFO L264 CegarLoopResult]: At program point L35-4(line 35) the Hoare annotation is: (and (= main_~pd2~0.offset main_~pd1~0.offset) (<= 1 |main_#t~ret10|) (= main_~pd2~0.base main_~pd1~0.base)) [2020-07-18 05:13:41,378 INFO L271 CegarLoopResult]: At program point L33-3(line 33) the Hoare annotation is: true [2020-07-18 05:13:41,378 INFO L271 CegarLoopResult]: At program point L33-4(line 33) the Hoare annotation is: true [2020-07-18 05:13:41,379 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 30 44) the Hoare annotation is: true [2020-07-18 05:13:41,379 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 30 44) the Hoare annotation is: true [2020-07-18 05:13:41,379 INFO L264 CegarLoopResult]: At program point L36(lines 31 44) the Hoare annotation is: false [2020-07-18 05:13:41,379 INFO L271 CegarLoopResult]: At program point L34(lines 34 38) the Hoare annotation is: true [2020-07-18 05:13:41,379 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-07-18 05:13:41,379 INFO L271 CegarLoopResult]: At program point L34-2(lines 34 38) the Hoare annotation is: true [2020-07-18 05:13:41,380 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) the Hoare annotation is: false [2020-07-18 05:13:41,380 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 30 44) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-18 05:13:41,380 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: false [2020-07-18 05:13:41,380 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (= main_~pd2~0.offset main_~pd1~0.offset) (= main_~pd2~0.base main_~pd1~0.base)) [2020-07-18 05:13:41,380 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (= main_~pd2~0.offset main_~pd1~0.offset) (<= 1 |main_#t~ret10|) (= main_~pd2~0.base main_~pd1~0.base)) [2020-07-18 05:13:41,381 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 25 28) the Hoare annotation is: true [2020-07-18 05:13:41,381 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (= check_~s1.base check_~s2.base))) (and (= |check_#in~s1.base| check_~s1.base) (or .cse0 (not (= |check_#in~s1.base| |check_#in~s2.base|))) (= check_~s1.offset |check_#in~s1.offset|) (or (not (= |check_#in~s1.offset| |check_#in~s2.offset|)) (not .cse0) (= check_~s1.offset check_~s2.offset)))) [2020-07-18 05:13:41,381 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse1 (not (= |check_#in~s1.base| |check_#in~s2.base|))) (.cse2 (not (= |check_#in~s1.offset| |check_#in~s2.offset|))) (.cse0 (= check_~s1.base check_~s2.base))) (and (= |check_#in~s1.base| check_~s1.base) (or .cse0 .cse1) (= check_~s1.offset |check_#in~s1.offset|) (or (= |check_#t~mem6| (select (select |#memory_int| check_~s2.base) check_~s2.offset)) .cse1 .cse2) (or .cse2 (not .cse0) (= check_~s1.offset check_~s2.offset)))) [2020-07-18 05:13:41,381 INFO L264 CegarLoopResult]: At program point L25(lines 25 28) the Hoare annotation is: (and (= |check_#in~s1.base| check_~s1.base) (= check_~s1.offset |check_#in~s1.offset|)) [2020-07-18 05:13:41,382 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse0 (not (= |check_#in~s1.base| |check_#in~s2.base|))) (.cse1 (not (= |check_#in~s1.offset| |check_#in~s2.offset|))) (.cse2 (= check_~s1.base check_~s2.base))) (and (or (= |check_#t~mem7| |check_#t~mem6|) .cse0 .cse1) (= |check_#in~s1.base| check_~s1.base) (or .cse2 .cse0) (= check_~s1.offset |check_#in~s1.offset|) (or (= |check_#t~mem6| (select (select |#memory_int| check_~s2.base) check_~s2.offset)) .cse0 .cse1) (or .cse1 (not .cse2) (= check_~s1.offset check_~s2.offset)))) [2020-07-18 05:13:41,382 INFO L264 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (let ((.cse0 (not (= |check_#in~s1.base| |check_#in~s2.base|))) (.cse1 (not (= |check_#in~s1.offset| |check_#in~s2.offset|))) (.cse2 (= check_~s1.base check_~s2.base))) (and (or (= |check_#t~mem7| |check_#t~mem6|) .cse0 .cse1) (= |check_#in~s1.base| check_~s1.base) (or .cse2 .cse0) (= check_~s1.offset |check_#in~s1.offset|) (or .cse0 .cse1 (<= 1 |check_#res|)) (or (= |check_#t~mem6| (select (select |#memory_int| check_~s2.base) check_~s2.offset)) .cse0 .cse1) (or .cse1 (not .cse2) (= check_~s1.offset check_~s2.offset)))) [2020-07-18 05:13:41,382 INFO L264 CegarLoopResult]: At program point L27-4(line 27) the Hoare annotation is: (let ((.cse1 (not (= |check_#in~s1.base| |check_#in~s2.base|))) (.cse2 (not (= |check_#in~s1.offset| |check_#in~s2.offset|))) (.cse0 (= check_~s1.base check_~s2.base))) (and (= |check_#in~s1.base| check_~s1.base) (or .cse0 .cse1) (= check_~s1.offset |check_#in~s1.offset|) (or .cse1 .cse2 (<= 1 |check_#res|)) (or (= |check_#t~mem6| (select (select |#memory_int| check_~s2.base) check_~s2.offset)) .cse1 .cse2) (or .cse2 (not .cse0) (= check_~s1.offset check_~s2.offset)))) [2020-07-18 05:13:41,382 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 25 28) the Hoare annotation is: (let ((.cse1 (not (= |check_#in~s1.base| |check_#in~s2.base|))) (.cse2 (not (= |check_#in~s1.offset| |check_#in~s2.offset|))) (.cse0 (= check_~s1.base check_~s2.base))) (and (= |check_#in~s1.base| check_~s1.base) (or .cse0 .cse1) (= check_~s1.offset |check_#in~s1.offset|) (or .cse1 .cse2 (<= 1 |check_#res|)) (or .cse2 (not .cse0) (= check_~s1.offset check_~s2.offset)))) [2020-07-18 05:13:41,383 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 25 28) the Hoare annotation is: (let ((.cse1 (not (= |check_#in~s1.base| |check_#in~s2.base|))) (.cse2 (not (= |check_#in~s1.offset| |check_#in~s2.offset|))) (.cse0 (= check_~s1.base check_~s2.base))) (and (= |check_#in~s1.base| check_~s1.base) (or .cse0 .cse1) (= check_~s1.offset |check_#in~s1.offset|) (or .cse1 .cse2 (<= 1 |check_#res|)) (or .cse2 (not .cse0) (= check_~s1.offset check_~s2.offset)))) [2020-07-18 05:13:41,413 INFO L163 areAnnotationChecker]: CFG has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 05:13:41,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 05:13:41 BoogieIcfgContainer [2020-07-18 05:13:41,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 05:13:41,433 INFO L168 Benchmark]: Toolchain (without parser) took 8255.12 ms. Allocated memory was 144.2 MB in the beginning and 318.2 MB in the end (delta: 174.1 MB). Free memory was 102.0 MB in the beginning and 138.8 MB in the end (delta: -36.8 MB). Peak memory consumption was 137.3 MB. Max. memory is 7.1 GB. [2020-07-18 05:13:41,434 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 05:13:41,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.23 ms. Allocated memory is still 144.2 MB. Free memory was 101.6 MB in the beginning and 91.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-18 05:13:41,436 INFO L168 Benchmark]: Boogie Preprocessor took 129.06 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 91.0 MB in the beginning and 178.2 MB in the end (delta: -87.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-18 05:13:41,437 INFO L168 Benchmark]: RCFGBuilder took 550.69 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 148.9 MB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2020-07-18 05:13:41,438 INFO L168 Benchmark]: TraceAbstraction took 7250.20 ms. Allocated memory was 200.8 MB in the beginning and 318.2 MB in the end (delta: 117.4 MB). Free memory was 148.2 MB in the beginning and 138.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 126.9 MB. Max. memory is 7.1 GB. [2020-07-18 05:13:41,442 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 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 315.23 ms. Allocated memory is still 144.2 MB. Free memory was 101.6 MB in the beginning and 91.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.06 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 91.0 MB in the beginning and 178.2 MB in the end (delta: -87.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 550.69 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 148.9 MB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7250.20 ms. Allocated memory was 200.8 MB in the beginning and 318.2 MB in the end (delta: 117.4 MB). Free memory was 148.2 MB in the beginning and 138.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 126.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 11]: Procedure Contract for init Derived contract for procedure init: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for get_dummy Derived contract for procedure get_dummy: 1 - ProcedureContractResult [Line: 30]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 25]: Procedure Contract for check Derived contract for procedure check: (((s1 == s1 && (s1 == s2 || !(s1 == s2))) && s1 == s1) && ((!(s1 == s2) || !(s1 == s2)) || 1 <= \result)) && ((!(s1 == s2) || !(s1 == s2)) || s1 == s2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.9s, OverallIterations: 1, TraceHistogramMax: 2, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 SDtfs, 133 SDslu, 85 SDs, 0 SdLazy, 736 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 65 LocationsWithAnnotation, 90 PreInvPairs, 131 NumberOfFragments, 452 HoareAnnotationTreeSize, 90 FomulaSimplifications, 1319 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 65 FomulaSimplificationsInter, 1181 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 17980 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 7/7 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 correct! Received shutdown request...