/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:06:17,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:06:17,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:06:17,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:06:17,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:06:17,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:06:17,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:06:17,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:06:17,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:06:17,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:06:17,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:06:17,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:06:17,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:06:17,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:06:17,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:06:17,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:06:17,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:06:17,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:06:17,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:06:17,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:06:17,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:06:17,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:06:17,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:06:17,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:06:17,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:06:17,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:06:17,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:06:17,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:06:17,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:06:17,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:06:17,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:06:17,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:06:17,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:06:17,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:06:17,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:06:17,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:06:17,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:06:17,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:06:17,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:06:17,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:06:17,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:06:17,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:06:17,231 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:06:17,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:06:17,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:06:17,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:06:17,235 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:06:17,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:06:17,235 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:06:17,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:06:17,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:06:17,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:06:17,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:06:17,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:06:17,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:06:17,238 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:06:17,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:06:17,238 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:06:17,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:06:17,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:06:17,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:06:17,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:06:17,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:06:17,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:06:17,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:06:17,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:06:17,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:06:17,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:06:17,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:06:17,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:06:17,240 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:06:17,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:06:17,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:06:17,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:06:17,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:06:17,530 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:06:17,530 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:06:17,531 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test05.c [2020-07-10 15:06:17,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c43eef45/c2810a3662834c748e542c1be680f599/FLAG45c593795 [2020-07-10 15:06:18,060 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:06:18,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test05.c [2020-07-10 15:06:18,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c43eef45/c2810a3662834c748e542c1be680f599/FLAG45c593795 [2020-07-10 15:06:18,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c43eef45/c2810a3662834c748e542c1be680f599 [2020-07-10 15:06:18,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:06:18,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:06:18,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:06:18,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:06:18,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:06:18,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:06:18" (1/1) ... [2020-07-10 15:06:18,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d7ccd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:18, skipping insertion in model container [2020-07-10 15:06:18,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:06:18" (1/1) ... [2020-07-10 15:06:18,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:06:18,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:06:18,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:06:18,689 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:06:18,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:06:18,729 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:06:18,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:18 WrapperNode [2020-07-10 15:06:18,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:06:18,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:06:18,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:06:18,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:06:18,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:18" (1/1) ... [2020-07-10 15:06:18,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:18" (1/1) ... [2020-07-10 15:06:18,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:18" (1/1) ... [2020-07-10 15:06:18,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:18" (1/1) ... [2020-07-10 15:06:18,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:18" (1/1) ... [2020-07-10 15:06:18,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:18" (1/1) ... [2020-07-10 15:06:18,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:18" (1/1) ... [2020-07-10 15:06:18,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:06:18,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:06:18,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:06:18,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:06:18,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:18" (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 15:06:18,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:06:18,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:06:18,930 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2020-07-10 15:06:18,930 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-07-10 15:06:18,930 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:06:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:06:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure g [2020-07-10 15:06:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:06:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:06:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:06:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-07-10 15:06:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:06:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:06:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:06:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:06:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:06:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:06:19,395 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:06:19,396 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:06:19,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:06:19 BoogieIcfgContainer [2020-07-10 15:06:19,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:06:19,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:06:19,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:06:19,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:06:19,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:06:18" (1/3) ... [2020-07-10 15:06:19,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d817c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:06:19, skipping insertion in model container [2020-07-10 15:06:19,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:06:18" (2/3) ... [2020-07-10 15:06:19,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d817c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:06:19, skipping insertion in model container [2020-07-10 15:06:19,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:06:19" (3/3) ... [2020-07-10 15:06:19,412 INFO L109 eAbstractionObserver]: Analyzing ICFG test05.c [2020-07-10 15:06:19,423 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:06:19,431 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:06:19,443 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:06:19,465 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:06:19,465 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:06:19,465 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:06:19,465 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:06:19,465 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:06:19,465 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:06:19,466 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:06:19,466 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:06:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-07-10 15:06:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:06:19,487 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:19,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:06:19,488 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:19,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:19,495 INFO L82 PathProgramCache]: Analyzing trace with hash -685779266, now seen corresponding path program 1 times [2020-07-10 15:06:19,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:19,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116895222] [2020-07-10 15:06:19,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:19,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-10 15:06:19,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-10 15:06:19,792 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #34#return; {28#true} is VALID [2020-07-10 15:06:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:19,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {40#(= |f_#in~a| f_~a)} is VALID [2020-07-10 15:06:19,864 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#(= |f_#in~a| f_~a)} assume !(4 == ~a);#res := 0; {41#(not (= 4 |f_#in~a|))} is VALID [2020-07-10 15:06:19,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#(not (= 4 |f_#in~a|))} assume true; {41#(not (= 4 |f_#in~a|))} is VALID [2020-07-10 15:06:19,869 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#(not (= 4 |f_#in~a|))} {33#(= 4 |main_#t~mem4|)} #38#return; {29#false} is VALID [2020-07-10 15:06:19,871 INFO L263 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {38#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:06:19,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#true} is VALID [2020-07-10 15:06:19,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2020-07-10 15:06:19,872 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #34#return; {28#true} is VALID [2020-07-10 15:06:19,873 INFO L263 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2020-07-10 15:06:19,878 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.allocOnStack(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.allocOnStack(4);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {33#(= 4 |main_#t~mem4|)} is VALID [2020-07-10 15:06:19,881 INFO L263 TraceCheckUtils]: 6: Hoare triple {33#(= 4 |main_#t~mem4|)} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {39#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:06:19,883 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {40#(= |f_#in~a| f_~a)} is VALID [2020-07-10 15:06:19,884 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#(= |f_#in~a| f_~a)} assume !(4 == ~a);#res := 0; {41#(not (= 4 |f_#in~a|))} is VALID [2020-07-10 15:06:19,885 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#(not (= 4 |f_#in~a|))} assume true; {41#(not (= 4 |f_#in~a|))} is VALID [2020-07-10 15:06:19,888 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {41#(not (= 4 |f_#in~a|))} {33#(= 4 |main_#t~mem4|)} #38#return; {29#false} is VALID [2020-07-10 15:06:19,889 INFO L280 TraceCheckUtils]: 11: Hoare triple {29#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;havoc #t~mem4;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {29#false} is VALID [2020-07-10 15:06:19,889 INFO L280 TraceCheckUtils]: 12: Hoare triple {29#false} assume 1 != #t~mem6;havoc #t~mem6; {29#false} is VALID [2020-07-10 15:06:19,890 INFO L280 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2020-07-10 15:06:19,892 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 15:06:19,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116895222] [2020-07-10 15:06:19,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:19,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:06:19,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665036371] [2020-07-10 15:06:19,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-10 15:06:19,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:19,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:06:19,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:19,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:06:19,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:19,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:06:19,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:06:19,963 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 7 states. [2020-07-10 15:06:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:20,574 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-10 15:06:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:06:20,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-07-10 15:06:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:06:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-10 15:06:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:06:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-10 15:06:20,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 39 transitions. [2020-07-10 15:06:20,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:20,669 INFO L225 Difference]: With dead ends: 36 [2020-07-10 15:06:20,670 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 15:06:20,673 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:06:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 15:06:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-10 15:06:20,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:20,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-10 15:06:20,738 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 15:06:20,739 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 15:06:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:20,743 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-10 15:06:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 15:06:20,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:20,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:20,744 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 15:06:20,744 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 15:06:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:20,749 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-10 15:06:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 15:06:20,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:20,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:20,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:20,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:06:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2020-07-10 15:06:20,754 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2020-07-10 15:06:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:20,755 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2020-07-10 15:06:20,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:06:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 15:06:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:06:20,756 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:20,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:06:20,757 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:06:20,757 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash 636648720, now seen corresponding path program 1 times [2020-07-10 15:06:20,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:20,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904099034] [2020-07-10 15:06:20,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:20,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {187#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {171#true} is VALID [2020-07-10 15:06:20,881 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-10 15:06:20,882 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #34#return; {171#true} is VALID [2020-07-10 15:06:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:20,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {171#true} is VALID [2020-07-10 15:06:20,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-10 15:06:20,950 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #32#return; {171#true} is VALID [2020-07-10 15:06:20,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {171#true} is VALID [2020-07-10 15:06:20,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#true} assume 4 == ~a; {171#true} is VALID [2020-07-10 15:06:20,953 INFO L263 TraceCheckUtils]: 2: Hoare triple {171#true} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:06:20,954 INFO L280 TraceCheckUtils]: 3: Hoare triple {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {171#true} is VALID [2020-07-10 15:06:20,954 INFO L280 TraceCheckUtils]: 4: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-10 15:06:20,954 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {171#true} {171#true} #32#return; {171#true} is VALID [2020-07-10 15:06:20,955 INFO L280 TraceCheckUtils]: 6: Hoare triple {171#true} #res := 1; {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} is VALID [2020-07-10 15:06:20,956 INFO L280 TraceCheckUtils]: 7: Hoare triple {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} assume true; {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} is VALID [2020-07-10 15:06:20,959 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} {171#true} #38#return; {185#(= 1 |main_#t~ret5|)} is VALID [2020-07-10 15:06:20,960 INFO L263 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {187#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:06:20,961 INFO L280 TraceCheckUtils]: 1: Hoare triple {187#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {171#true} is VALID [2020-07-10 15:06:20,961 INFO L280 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-10 15:06:20,961 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #34#return; {171#true} is VALID [2020-07-10 15:06:20,962 INFO L263 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret9 := main(); {171#true} is VALID [2020-07-10 15:06:20,962 INFO L280 TraceCheckUtils]: 5: Hoare triple {171#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.allocOnStack(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.allocOnStack(4);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {171#true} is VALID [2020-07-10 15:06:20,964 INFO L263 TraceCheckUtils]: 6: Hoare triple {171#true} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:06:20,965 INFO L280 TraceCheckUtils]: 7: Hoare triple {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {171#true} is VALID [2020-07-10 15:06:20,965 INFO L280 TraceCheckUtils]: 8: Hoare triple {171#true} assume 4 == ~a; {171#true} is VALID [2020-07-10 15:06:20,970 INFO L263 TraceCheckUtils]: 9: Hoare triple {171#true} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:06:20,971 INFO L280 TraceCheckUtils]: 10: Hoare triple {188#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {171#true} is VALID [2020-07-10 15:06:20,971 INFO L280 TraceCheckUtils]: 11: Hoare triple {171#true} assume true; {171#true} is VALID [2020-07-10 15:06:20,972 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {171#true} {171#true} #32#return; {171#true} is VALID [2020-07-10 15:06:20,973 INFO L280 TraceCheckUtils]: 13: Hoare triple {171#true} #res := 1; {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} is VALID [2020-07-10 15:06:20,978 INFO L280 TraceCheckUtils]: 14: Hoare triple {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} assume true; {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} is VALID [2020-07-10 15:06:20,980 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {192#(and (<= 1 |f_#res|) (<= |f_#res| 1))} {171#true} #38#return; {185#(= 1 |main_#t~ret5|)} is VALID [2020-07-10 15:06:20,982 INFO L280 TraceCheckUtils]: 16: Hoare triple {185#(= 1 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;havoc #t~mem4;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {186#(= 1 |main_#t~mem6|)} is VALID [2020-07-10 15:06:20,983 INFO L280 TraceCheckUtils]: 17: Hoare triple {186#(= 1 |main_#t~mem6|)} assume 1 != #t~mem6;havoc #t~mem6; {172#false} is VALID [2020-07-10 15:06:20,983 INFO L280 TraceCheckUtils]: 18: Hoare triple {172#false} assume !false; {172#false} is VALID [2020-07-10 15:06:20,988 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 15:06:20,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904099034] [2020-07-10 15:06:20,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:20,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:06:20,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300048149] [2020-07-10 15:06:20,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-10 15:06:20,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:20,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:06:21,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:21,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:06:21,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:21,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:06:21,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:06:21,032 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2020-07-10 15:06:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:21,497 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2020-07-10 15:06:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:06:21,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-07-10 15:06:21,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:06:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2020-07-10 15:06:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:06:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2020-07-10 15:06:21,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2020-07-10 15:06:21,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:21,556 INFO L225 Difference]: With dead ends: 23 [2020-07-10 15:06:21,556 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 15:06:21,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:06:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 15:06:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-10 15:06:21,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:21,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-10 15:06:21,588 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 15:06:21,589 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 15:06:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:21,592 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-10 15:06:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-07-10 15:06:21,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:21,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:21,595 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 15:06:21,595 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 15:06:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:21,601 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-10 15:06:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-07-10 15:06:21,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:21,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:21,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:21,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:06:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2020-07-10 15:06:21,610 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 19 [2020-07-10 15:06:21,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:21,613 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2020-07-10 15:06:21,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:06:21,613 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-07-10 15:06:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:06:21,614 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:06:21,614 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] [2020-07-10 15:06:21,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:06:21,615 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:06:21,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:06:21,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1738724303, now seen corresponding path program 1 times [2020-07-10 15:06:21,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:06:21,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647880261] [2020-07-10 15:06:21,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:06:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:21,941 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {305#true} is VALID [2020-07-10 15:06:21,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-10 15:06:21,942 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {305#true} {305#true} #34#return; {305#true} is VALID [2020-07-10 15:06:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:06:22,096 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2020-07-10 15:06:22,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} assume true; {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2020-07-10 15:06:22,100 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} #32#return; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-10 15:06:22,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} is VALID [2020-07-10 15:06:22,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} assume 4 == ~a; {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} is VALID [2020-07-10 15:06:22,106 INFO L263 TraceCheckUtils]: 2: Hoare triple {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:06:22,109 INFO L280 TraceCheckUtils]: 3: Hoare triple {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2020-07-10 15:06:22,110 INFO L280 TraceCheckUtils]: 4: Hoare triple {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} assume true; {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2020-07-10 15:06:22,112 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} #32#return; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-10 15:06:22,114 INFO L280 TraceCheckUtils]: 6: Hoare triple {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} #res := 1; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-10 15:06:22,115 INFO L280 TraceCheckUtils]: 7: Hoare triple {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} assume true; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-10 15:06:22,118 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} {310#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p1~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} #38#return; {320#(and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} is VALID [2020-07-10 15:06:22,120 INFO L263 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:06:22,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {305#true} is VALID [2020-07-10 15:06:22,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-10 15:06:22,121 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #34#return; {305#true} is VALID [2020-07-10 15:06:22,122 INFO L263 TraceCheckUtils]: 4: Hoare triple {305#true} call #t~ret9 := main(); {305#true} is VALID [2020-07-10 15:06:22,126 INFO L280 TraceCheckUtils]: 5: Hoare triple {305#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4);call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(4);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.allocOnStack(4);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.allocOnStack(4);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4);call write~int(1, ~#b~0.base, ~#b~0.offset, 4);call write~int(5, ~#a~0.base, ~#a~0.offset, 4);call #t~mem2 := read~int(~#a~0.base, ~#a~0.offset, 4);#t~post3 := #t~mem2;call write~int(#t~post3 - 1, ~#a~0.base, ~#a~0.offset, 4);havoc #t~mem2;havoc #t~post3;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset, 4); {310#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p1~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} is VALID [2020-07-10 15:06:22,128 INFO L263 TraceCheckUtils]: 6: Hoare triple {310#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p1~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:06:22,130 INFO L280 TraceCheckUtils]: 7: Hoare triple {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} is VALID [2020-07-10 15:06:22,131 INFO L280 TraceCheckUtils]: 8: Hoare triple {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} assume 4 == ~a; {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} is VALID [2020-07-10 15:06:22,133 INFO L263 TraceCheckUtils]: 9: Hoare triple {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:06:22,135 INFO L280 TraceCheckUtils]: 10: Hoare triple {324#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);~pq~0.base, ~pq~0.offset := #t~mem0.base, #t~mem0.offset;havoc #t~mem0.base, #t~mem0.offset;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~p2.base, ~p2.offset, 4);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4);havoc #t~mem1.base, #t~mem1.offset;call write~int(0, ~pq~0.base, ~pq~0.offset, 4); {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2020-07-10 15:06:22,136 INFO L280 TraceCheckUtils]: 11: Hoare triple {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} assume true; {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} is VALID [2020-07-10 15:06:22,138 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {330#(or (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |g_#in~p1.base|) |g_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))} {325#(and (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|))} #32#return; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-10 15:06:22,139 INFO L280 TraceCheckUtils]: 13: Hoare triple {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} #res := 1; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-10 15:06:22,140 INFO L280 TraceCheckUtils]: 14: Hoare triple {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} assume true; {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} is VALID [2020-07-10 15:06:22,144 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {329#(or (and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| |f_#in~p1.base|) |f_#in~p1.offset|))) (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)))} {310#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p1~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} #38#return; {320#(and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} is VALID [2020-07-10 15:06:22,146 INFO L280 TraceCheckUtils]: 16: Hoare triple {320#(and (= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;call write~int(#t~ret5, ~#a~0.base, ~#a~0.offset, 4);havoc #t~ret5;havoc #t~mem4;call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset, 4); {321#(= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))} is VALID [2020-07-10 15:06:22,147 INFO L280 TraceCheckUtils]: 17: Hoare triple {321#(= 0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))} assume !(1 != #t~mem6);havoc #t~mem6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, #t~mem7.offset, 4); {322#(= 0 |main_#t~mem8|)} is VALID [2020-07-10 15:06:22,148 INFO L280 TraceCheckUtils]: 18: Hoare triple {322#(= 0 |main_#t~mem8|)} assume 0 != #t~mem8;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8; {306#false} is VALID [2020-07-10 15:06:22,148 INFO L280 TraceCheckUtils]: 19: Hoare triple {306#false} assume !false; {306#false} is VALID [2020-07-10 15:06:22,151 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 15:06:22,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647880261] [2020-07-10 15:06:22,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:06:22,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 15:06:22,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885713151] [2020-07-10 15:06:22,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-10 15:06:22,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:06:22,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:06:22,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:22,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:06:22,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:06:22,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:06:22,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:06:22,188 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 11 states. [2020-07-10 15:06:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:23,060 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-10 15:06:23,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:06:23,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-10 15:06:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:06:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:06:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2020-07-10 15:06:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:06:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2020-07-10 15:06:23,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 20 transitions. [2020-07-10 15:06:23,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:06:23,114 INFO L225 Difference]: With dead ends: 21 [2020-07-10 15:06:23,114 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:06:23,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:06:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:06:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:06:23,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:06:23,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:23,116 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:23,116 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:23,116 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:06:23,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:23,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:23,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:23,117 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:23,117 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:06:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:06:23,117 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:06:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:23,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:23,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:06:23,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:06:23,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:06:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:06:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:06:23,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2020-07-10 15:06:23,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:06:23,119 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:06:23,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:06:23,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:06:23,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:06:23,120 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:06:23,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:06:23,291 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:06:23,291 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 15:06:23,291 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:06:23,292 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (= |f_#in~a| f_~a) (= |f_#in~p1.base| f_~p1.base) (= f_~p1.offset |f_#in~p1.offset|) (= |f_#in~p2.base| f_~p2.base) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_~p2.offset |f_#in~p2.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 15:06:23,292 INFO L268 CegarLoopResult]: For program point L12(lines 12 17) no Hoare annotation was computed. [2020-07-10 15:06:23,292 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-10 15:06:23,292 INFO L268 CegarLoopResult]: For program point fEXIT(lines 11 18) no Hoare annotation was computed. [2020-07-10 15:06:23,292 INFO L264 CegarLoopResult]: At program point fENTRY(lines 11 18) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 15:06:23,292 INFO L268 CegarLoopResult]: For program point fFINAL(lines 11 18) no Hoare annotation was computed. [2020-07-10 15:06:23,292 INFO L268 CegarLoopResult]: For program point gEXIT(lines 4 9) no Hoare annotation was computed. [2020-07-10 15:06:23,292 INFO L268 CegarLoopResult]: For program point gFINAL(lines 4 9) no Hoare annotation was computed. [2020-07-10 15:06:23,292 INFO L264 CegarLoopResult]: At program point gENTRY(lines 4 9) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 15:06:23,293 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:06:23,293 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:06:23,293 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:06:23,293 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:06:23,293 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|))) (and (not (= .cse0 |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= |main_~#p2~0.base| |main_~#a~0.base|)) (not (= .cse0 |main_~#p1~0.base|)) (= 4 |main_#t~mem4|) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))) [2020-07-10 15:06:23,293 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2020-07-10 15:06:23,294 INFO L268 CegarLoopResult]: For program point L32-1(line 32) no Hoare annotation was computed. [2020-07-10 15:06:23,294 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 20 46) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 15:06:23,294 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 20 46) no Hoare annotation was computed. [2020-07-10 15:06:23,294 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 20 46) no Hoare annotation was computed. [2020-07-10 15:06:23,294 INFO L264 CegarLoopResult]: At program point L39(lines 20 46) the Hoare annotation is: false [2020-07-10 15:06:23,294 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-07-10 15:06:23,294 INFO L268 CegarLoopResult]: For program point L34(lines 34 36) no Hoare annotation was computed. [2020-07-10 15:06:23,298 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:06:23,298 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 15:06:23,298 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2020-07-10 15:06:23,302 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:06:23,302 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 15:06:23,302 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 15:06:23,302 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2020-07-10 15:06:23,303 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:06:23,303 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-10 15:06:23,304 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:06:23,304 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:06:23,306 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2020-07-10 15:06:23,306 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2020-07-10 15:06:23,306 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:06:23,307 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-10 15:06:23,307 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:06:23,307 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2020-07-10 15:06:23,307 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 15:06:23,307 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-10 15:06:23,307 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:06:23,307 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:06:23,307 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 15:06:23,307 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 15:06:23,307 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:06:23,307 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:06:23,308 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:06:23,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:06:23 BoogieIcfgContainer [2020-07-10 15:06:23,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:06:23,319 INFO L168 Benchmark]: Toolchain (without parser) took 4876.64 ms. Allocated memory was 145.8 MB in the beginning and 277.3 MB in the end (delta: 131.6 MB). Free memory was 102.5 MB in the beginning and 223.2 MB in the end (delta: -120.7 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:23,320 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:06:23,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.55 ms. Allocated memory is still 145.8 MB. Free memory was 102.3 MB in the beginning and 91.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:23,321 INFO L168 Benchmark]: Boogie Preprocessor took 133.20 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 91.7 MB in the beginning and 181.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:23,322 INFO L168 Benchmark]: RCFGBuilder took 534.56 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 154.1 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:23,323 INFO L168 Benchmark]: TraceAbstraction took 3914.76 ms. Allocated memory was 203.4 MB in the beginning and 277.3 MB in the end (delta: 73.9 MB). Free memory was 153.5 MB in the beginning and 223.2 MB in the end (delta: -69.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:06:23,327 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.25 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 288.55 ms. Allocated memory is still 145.8 MB. Free memory was 102.3 MB in the beginning and 91.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.20 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 91.7 MB in the beginning and 181.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 534.56 ms. Allocated memory is still 203.4 MB. Free memory was 181.0 MB in the beginning and 154.1 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3914.76 ms. Allocated memory was 203.4 MB in the beginning and 277.3 MB in the end (delta: 73.9 MB). Free memory was 153.5 MB in the beginning and 223.2 MB in the end (delta: -69.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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: 20]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.6s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 44 SDtfs, 34 SDslu, 88 SDs, 0 SdLazy, 237 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 103 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 7654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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...