java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/test05_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:07:23,737 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:07:23,739 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:07:23,758 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:07:23,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:07:23,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:07:23,761 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:07:23,765 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:07:23,767 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:07:23,768 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:07:23,769 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:07:23,769 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:07:23,777 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:07:23,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:07:23,780 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:07:23,780 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:07:23,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:07:23,786 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:07:23,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:07:23,795 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:07:23,797 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:07:23,799 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:07:23,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:07:23,804 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:07:23,804 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:07:23,805 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:07:23,806 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:07:23,807 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:07:23,809 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:07:23,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:07:23,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:07:23,812 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:07:23,812 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:07:23,812 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:07:23,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:07:23,816 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:07:23,816 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:07:23,842 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:07:23,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:07:23,844 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:07:23,844 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:07:23,847 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:07:23,847 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:07:23,848 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:07:23,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:07:23,849 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:07:23,849 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:07:23,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:07:23,849 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:07:23,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:07:23,850 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:07:23,850 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:07:23,850 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:07:23,850 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:07:23,850 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:07:23,851 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:07:23,852 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:07:23,852 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:07:23,852 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:07:23,853 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:07:23,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:07:23,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:23,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:07:23,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:07:23,854 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:07:23,854 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:07:23,854 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:07:23,854 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:07:23,855 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:07:23,855 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:07:23,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:07:23,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:07:23,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:07:23,928 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:07:23,929 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:07:23,930 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test05_true-unreach-call_true-termination.c [2018-11-23 11:07:23,987 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226b4f020/00f1ed3e97ac4c06a5d0745ccacfc841/FLAGc4b7d515b [2018-11-23 11:07:24,439 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:07:24,440 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test05_true-unreach-call_true-termination.c [2018-11-23 11:07:24,447 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226b4f020/00f1ed3e97ac4c06a5d0745ccacfc841/FLAGc4b7d515b [2018-11-23 11:07:24,793 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226b4f020/00f1ed3e97ac4c06a5d0745ccacfc841 [2018-11-23 11:07:24,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:07:24,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:07:24,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:24,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:07:24,814 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:07:24,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:24" (1/1) ... [2018-11-23 11:07:24,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e407d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:24, skipping insertion in model container [2018-11-23 11:07:24,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:24" (1/1) ... [2018-11-23 11:07:24,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:07:24,856 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:07:25,074 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:25,099 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:07:25,123 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:25,146 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:07:25,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:25 WrapperNode [2018-11-23 11:07:25,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:25,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:25,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:07:25,148 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:07:25,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:25" (1/1) ... [2018-11-23 11:07:25,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:25" (1/1) ... [2018-11-23 11:07:25,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:25,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:07:25,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:07:25,187 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:07:25,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:25" (1/1) ... [2018-11-23 11:07:25,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:25" (1/1) ... [2018-11-23 11:07:25,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:25" (1/1) ... [2018-11-23 11:07:25,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:25" (1/1) ... [2018-11-23 11:07:25,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:25" (1/1) ... [2018-11-23 11:07:25,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:25" (1/1) ... [2018-11-23 11:07:25,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:25" (1/1) ... [2018-11-23 11:07:25,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:07:25,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:07:25,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:07:25,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:07:25,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:25" (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 [2018-11-23 11:07:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:07:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:07:25,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:07:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:07:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:07:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 11:07:25,412 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 11:07:25,412 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-23 11:07:25,412 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-23 11:07:25,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:07:25,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:07:25,413 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:07:25,413 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:07:25,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:07:25,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:07:25,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:07:26,305 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:07:26,306 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:07:26,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:26 BoogieIcfgContainer [2018-11-23 11:07:26,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:07:26,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:07:26,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:07:26,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:07:26,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:07:24" (1/3) ... [2018-11-23 11:07:26,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dabca21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:26, skipping insertion in model container [2018-11-23 11:07:26,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:25" (2/3) ... [2018-11-23 11:07:26,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dabca21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:26, skipping insertion in model container [2018-11-23 11:07:26,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:26" (3/3) ... [2018-11-23 11:07:26,316 INFO L112 eAbstractionObserver]: Analyzing ICFG test05_true-unreach-call_true-termination.c [2018-11-23 11:07:26,326 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:07:26,334 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:07:26,351 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:07:26,384 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:07:26,385 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:07:26,385 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:07:26,385 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:07:26,387 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:07:26,387 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:07:26,387 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:07:26,387 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:07:26,387 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:07:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 11:07:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:07:26,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:26,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:26,414 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:26,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:26,421 INFO L82 PathProgramCache]: Analyzing trace with hash -685779266, now seen corresponding path program 1 times [2018-11-23 11:07:26,426 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:26,427 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:26,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:26,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:27,077 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 11:07:27,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {28#true} is VALID [2018-11-23 11:07:27,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 11:07:27,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #34#return; {28#true} is VALID [2018-11-23 11:07:27,082 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2018-11-23 11:07:27,088 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4bv32);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4bv32);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4bv32);call write~intINTTYPE4(1bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~intINTTYPE4(5bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);#t~post3 := #t~mem2;call write~intINTTYPE4(~bvsub32(#t~post3, 1bv32), ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~post3;havoc #t~mem2;call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {48#(= (_ bv4 32) |main_#t~mem4|)} is VALID [2018-11-23 11:07:27,089 INFO L256 TraceCheckUtils]: 6: Hoare triple {48#(= (_ bv4 32) |main_#t~mem4|)} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {28#true} is VALID [2018-11-23 11:07:27,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#true} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {55#(= |f_#in~a| f_~a)} is VALID [2018-11-23 11:07:27,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {55#(= |f_#in~a| f_~a)} assume !(4bv32 == ~a);#res := 0bv32; {59#(not (= (bvadd |f_#in~a| (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:27,095 INFO L273 TraceCheckUtils]: 9: Hoare triple {59#(not (= (bvadd |f_#in~a| (_ bv4294967292 32)) (_ bv0 32)))} assume true; {59#(not (= (bvadd |f_#in~a| (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 11:07:27,097 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {59#(not (= (bvadd |f_#in~a| (_ bv4294967292 32)) (_ bv0 32)))} {48#(= (_ bv4 32) |main_#t~mem4|)} #38#return; {29#false} is VALID [2018-11-23 11:07:27,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} call write~intINTTYPE4(#t~ret5, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem4;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {29#false} is VALID [2018-11-23 11:07:27,098 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume 1bv32 != #t~mem6;havoc #t~mem6; {29#false} is VALID [2018-11-23 11:07:27,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 11:07:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:27,103 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:27,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:27,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:07:27,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 11:07:27,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:27,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:07:27,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:27,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:07:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:07:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:07:27,315 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2018-11-23 11:07:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:29,042 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 11:07:29,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:07:29,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 11:07:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:07:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-23 11:07:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:07:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-23 11:07:29,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2018-11-23 11:07:29,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:29,458 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:07:29,459 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:07:29,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:07:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:07:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:07:29,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:29,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:07:29,529 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:07:29,530 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:07:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:29,534 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:07:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:07:29,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:29,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:29,535 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:07:29,536 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:07:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:29,540 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:07:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:07:29,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:29,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:29,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:29,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:07:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 11:07:29,546 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 11:07:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:29,546 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 11:07:29,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:07:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:07:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:07:29,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:29,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:29,548 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:29,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:29,549 INFO L82 PathProgramCache]: Analyzing trace with hash 636648720, now seen corresponding path program 1 times [2018-11-23 11:07:29,550 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:29,550 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:29,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:29,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:29,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2018-11-23 11:07:29,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {194#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {194#true} is VALID [2018-11-23 11:07:29,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2018-11-23 11:07:29,791 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #34#return; {194#true} is VALID [2018-11-23 11:07:29,791 INFO L256 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret9 := main(); {194#true} is VALID [2018-11-23 11:07:29,791 INFO L273 TraceCheckUtils]: 5: Hoare triple {194#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4bv32);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4bv32);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4bv32);call write~intINTTYPE4(1bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~intINTTYPE4(5bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);#t~post3 := #t~mem2;call write~intINTTYPE4(~bvsub32(#t~post3, 1bv32), ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~post3;havoc #t~mem2;call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {194#true} is VALID [2018-11-23 11:07:29,792 INFO L256 TraceCheckUtils]: 6: Hoare triple {194#true} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {194#true} is VALID [2018-11-23 11:07:29,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {194#true} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {194#true} is VALID [2018-11-23 11:07:29,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {194#true} assume 4bv32 == ~a; {194#true} is VALID [2018-11-23 11:07:29,794 INFO L256 TraceCheckUtils]: 9: Hoare triple {194#true} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {194#true} is VALID [2018-11-23 11:07:29,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#true} ~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, 4bv32);~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, 4bv32);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4bv32);havoc #t~mem1.base, #t~mem1.offset;call write~intINTTYPE4(0bv32, ~pq~0.base, ~pq~0.offset, 4bv32); {194#true} is VALID [2018-11-23 11:07:29,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {194#true} assume true; {194#true} is VALID [2018-11-23 11:07:29,795 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {194#true} {194#true} #32#return; {194#true} is VALID [2018-11-23 11:07:29,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {194#true} #res := 1bv32; {238#(= (bvadd |f_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:07:29,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#(= (bvadd |f_#res| (_ bv4294967295 32)) (_ bv0 32))} assume true; {238#(= (bvadd |f_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:07:29,805 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {238#(= (bvadd |f_#res| (_ bv4294967295 32)) (_ bv0 32))} {194#true} #38#return; {245#(= (_ bv1 32) |main_#t~ret5|)} is VALID [2018-11-23 11:07:29,812 INFO L273 TraceCheckUtils]: 16: Hoare triple {245#(= (_ bv1 32) |main_#t~ret5|)} call write~intINTTYPE4(#t~ret5, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem4;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {249#(= (_ bv1 32) |main_#t~mem6|)} is VALID [2018-11-23 11:07:29,816 INFO L273 TraceCheckUtils]: 17: Hoare triple {249#(= (_ bv1 32) |main_#t~mem6|)} assume 1bv32 != #t~mem6;havoc #t~mem6; {195#false} is VALID [2018-11-23 11:07:29,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {195#false} assume !false; {195#false} is VALID [2018-11-23 11:07:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:29,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:29,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:29,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:07:29,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:07:29,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:29,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:07:29,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:29,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:07:29,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:07:29,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:07:29,898 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 5 states. [2018-11-23 11:07:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:32,035 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2018-11-23 11:07:32,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:07:32,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:07:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:07:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-23 11:07:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:07:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-23 11:07:32,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2018-11-23 11:07:32,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:32,100 INFO L225 Difference]: With dead ends: 23 [2018-11-23 11:07:32,100 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:07:32,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:07:32,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:07:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:07:32,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:32,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:07:32,115 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:07:32,115 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:07:32,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:32,118 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-23 11:07:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-23 11:07:32,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:32,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:32,119 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:07:32,120 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:07:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:32,122 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-23 11:07:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-23 11:07:32,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:32,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:32,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:32,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:07:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2018-11-23 11:07:32,126 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 19 [2018-11-23 11:07:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:32,126 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2018-11-23 11:07:32,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:07:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-11-23 11:07:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:07:32,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:32,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:32,128 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:32,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:32,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1738724303, now seen corresponding path program 1 times [2018-11-23 11:07:32,129 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:32,129 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:32,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:32,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:32,894 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 11:07:32,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:32,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-11-23 11:07:33,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-11-23 11:07:33,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,318 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:07:33,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 11:07:33,330 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:33,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:33,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:34,168 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:34,206 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:34,701 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:34,728 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 72 [2018-11-23 11:07:35,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:07:35,052 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:35,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2018-11-23 11:07:35,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-23 11:07:35,172 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:35,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-11-23 11:07:35,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:07:35,298 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:35,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 66 [2018-11-23 11:07:35,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 11:07:35,446 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,512 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,532 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,548 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,573 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,679 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:133, output treesize:46 [2018-11-23 11:07:35,853 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:35,854 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_23|, |main_~#b~0.base|, |main_~#b~0.offset|, |v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.base_21|, |v_#valid_22|]. (let ((.cse4 (store |v_#valid_22| |main_~#a~0.base| (_ bv1 1)))) (let ((.cse0 (select |v_#memory_$Pointer$.base_21| |main_~#a~0.base|)) (.cse1 (store .cse4 |main_~#b~0.base| (_ bv1 1)))) (and (= (store |v_#memory_$Pointer$.base_22| |main_~#a~0.base| (store (select |v_#memory_$Pointer$.base_22| |main_~#a~0.base|) |main_~#a~0.offset| (select .cse0 |main_~#a~0.offset|))) |v_#memory_$Pointer$.base_21|) (= (select (store .cse1 |main_~#p1~0.base| (_ bv1 1)) |main_~#p2~0.base|) (_ bv0 1)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_21| |main_~#a~0.base| (store .cse0 |main_~#a~0.offset| (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)))) (= |v_#memory_$Pointer$.base_22| (let ((.cse2 (let ((.cse3 (store |v_#memory_$Pointer$.base_23| |main_~#p1~0.base| (store (select |v_#memory_$Pointer$.base_23| |main_~#p1~0.base|) |main_~#p1~0.offset| |main_~#a~0.base|)))) (store .cse3 |main_~#p2~0.base| (store (select .cse3 |main_~#p2~0.base|) |main_~#p2~0.offset| |main_~#b~0.base|))))) (store .cse2 |main_~#b~0.base| (store (select .cse2 |main_~#b~0.base|) |main_~#b~0.offset| (select (select |v_#memory_$Pointer$.base_22| |main_~#b~0.base|) |main_~#b~0.offset|))))) (= (_ bv0 32) |main_~#p1~0.offset|) (= (select .cse1 |main_~#p1~0.base|) (_ bv0 1)) (= (_ bv0 1) (select .cse4 |main_~#b~0.base|)) (= (_ bv0 32) |main_~#p2~0.offset|)))) [2018-11-23 11:07:35,854 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|))) (and (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|) (not (= .cse0 |main_~#a~0.base|)) (not (= .cse0 |main_~#p1~0.base|)) (not (= |main_~#a~0.base| |main_~#p2~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= .cse0 |main_~#p2~0.base|)) (= (_ bv0 32) |main_~#p2~0.offset|))) [2018-11-23 11:07:36,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 11:07:36,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-23 11:07:36,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:36,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:36,534 INFO L303 Elim1Store]: Index analysis took 181 ms [2018-11-23 11:07:36,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 127 [2018-11-23 11:07:36,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 125 [2018-11-23 11:07:36,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:38,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107 [2018-11-23 11:07:38,608 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:40,824 INFO L303 Elim1Store]: Index analysis took 247 ms [2018-11-23 11:07:41,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 124 treesize of output 151 [2018-11-23 11:07:41,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 132 [2018-11-23 11:07:41,313 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-23 11:07:47,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 121 [2018-11-23 11:07:47,854 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 11:07:51,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 89 [2018-11-23 11:07:51,209 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:53,595 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-23 11:08:07,629 INFO L303 Elim1Store]: Index analysis took 205 ms [2018-11-23 11:08:07,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 121 treesize of output 150 [2018-11-23 11:08:07,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 102 [2018-11-23 11:08:07,878 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:10,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 113 [2018-11-23 11:08:10,762 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 11:08:13,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 132 [2018-11-23 11:08:13,353 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-11-23 11:08:17,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 105 [2018-11-23 11:08:17,165 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-23 11:08:18,641 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:08:20,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:08:21,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:08:21,172 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 2 variables, input treesize:142, output treesize:345 [2018-11-23 11:08:23,206 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:23,207 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_21|, |v_#memory_int_24|]. (let ((.cse1 (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (.cse2 (select (select |v_#memory_$Pointer$.offset_21| |g_#in~p2.base|) |g_#in~p2.offset|))) (and (= (let ((.cse0 (store |v_#memory_$Pointer$.offset_21| |g_#in~p1.base| (store (select |v_#memory_$Pointer$.offset_21| |g_#in~p1.base|) |g_#in~p1.offset| .cse2)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 (select (select |#memory_$Pointer$.offset| .cse1) .cse2)))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (let ((.cse3 (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| .cse1)))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 (select (select |#memory_$Pointer$.base| .cse1) .cse2))))) (= (store |v_#memory_int_24| .cse1 (store (select |v_#memory_int_24| .cse1) .cse2 (_ bv0 32))) |#memory_int|))) [2018-11-23 11:08:23,207 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse7 (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (let ((.cse6 (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| .cse7)))) (let ((.cse8 (select .cse6 .cse7)) (.cse9 (select |#memory_$Pointer$.base| .cse7)) (.cse4 (select |#memory_int| .cse7)) (.cse1 (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)) (.cse5 (= |g_#in~p2.base| .cse7)) (.cse10 (= |g_#in~p1.base| .cse7)) (.cse2 (= (select .cse4 .cse1) (_ bv0 32))) (.cse3 (= (store .cse6 .cse7 (store .cse8 .cse1 (select .cse9 .cse1))) |#memory_$Pointer$.base|))) (or (and (= .cse0 .cse1) .cse2 .cse3) (and (= (select .cse4 .cse0) (_ bv0 32)) (= .cse0 |g_#in~p2.offset|) .cse5 (= |#memory_$Pointer$.base| (store .cse6 .cse7 (store .cse8 .cse0 (select .cse9 .cse0))))) (and (= (store .cse6 .cse7 (store .cse8 |g_#in~p2.offset| (select .cse9 |g_#in~p2.offset|))) |#memory_$Pointer$.base|) .cse5 (= (select .cse4 |g_#in~p2.offset|) (_ bv0 32)) (= |g_#in~p1.offset| |g_#in~p2.offset|) .cse10) (and (= |g_#in~p1.offset| .cse1) .cse10 .cse2 .cse3)))))) [2018-11-23 11:08:24,351 WARN L180 SmtUtils]: Spent 950.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:08:25,355 WARN L180 SmtUtils]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:08:25,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:25,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:25,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:25,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 112 [2018-11-23 11:08:25,755 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 47 [2018-11-23 11:08:25,768 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 11:08:25,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 86 [2018-11-23 11:08:25,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-23 11:08:25,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:25,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:26,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:26,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:26,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:77 [2018-11-23 11:08:28,189 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:28,190 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_4|, |main_~#p2~0.base|]. (let ((.cse1 (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| |main_~#p1~0.base|)) (.cse0 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_4| |main_~#p2~0.base|) (_ bv0 32))) (.cse3 (select (select |#memory_$Pointer$.offset| |main_~#p2~0.base|) (_ bv0 32)))) (and (not (= |main_~#p1~0.base| .cse0)) (= (select .cse1 |main_~#p1~0.offset|) |main_~#a~0.base|) (= (let ((.cse2 (store |v_#memory_$Pointer$.base_BEFORE_CALL_4| |main_~#p1~0.base| (store .cse1 |main_~#p1~0.offset| .cse0)))) (store .cse2 .cse0 (store (select .cse2 .cse0) .cse3 (select (select |#memory_$Pointer$.base| .cse0) .cse3)))) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select |#memory_int| .cse0) .cse3)) (not (= |main_~#p2~0.base| .cse0)) (not (= |main_~#a~0.base| |main_~#p2~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= |main_~#a~0.base| .cse0)) (= .cse3 (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) [2018-11-23 11:08:28,190 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#p2~0.base|]. (let ((.cse2 (select |#memory_$Pointer$.base| |main_~#p2~0.base|))) (let ((.cse0 (select .cse2 (_ bv0 32))) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#p2~0.base|) (_ bv0 32)))) (and (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= .cse0 |main_~#p2~0.base|)) (= (select (select |#memory_int| .cse0) .cse1) (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#p2~0.base|)) (not (= (select .cse2 |main_~#p1~0.offset|) |main_~#a~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= |main_~#p1~0.base| .cse0)) (= .cse0 (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (= .cse1 (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|))))) [2018-11-23 11:08:28,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:28,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-11-23 11:08:28,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:08:28,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:28,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:28,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 51 [2018-11-23 11:08:28,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 11:08:28,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:28,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 75 [2018-11-23 11:08:29,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 11:08:29,031 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,069 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:29,172 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:118, output treesize:61 [2018-11-23 11:08:29,258 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:29,259 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_25|, |main_~#a~0.base|, |main_~#a~0.offset|, |v_main_#t~ret5_6|, |main_~#p2~0.base|, |v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_25|]. (let ((.cse2 (select |v_#memory_$Pointer$.base_25| |main_~#p2~0.base|))) (let ((.cse1 (select (select |v_#memory_$Pointer$.offset_22| |main_~#p2~0.base|) (_ bv0 32))) (.cse0 (select .cse2 (_ bv0 32)))) (and (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (= (store |v_#memory_$Pointer$.offset_22| |main_~#a~0.base| (store (select |v_#memory_$Pointer$.offset_22| |main_~#a~0.base|) |main_~#a~0.offset| (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_25| |main_~#a~0.base| (store (select |v_#memory_$Pointer$.base_25| |main_~#a~0.base|) |main_~#a~0.offset| (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)))) (= (_ bv0 32) (select (select |v_#memory_int_25| .cse0) .cse1)) (not (= (select .cse2 |main_~#p1~0.offset|) |main_~#a~0.base|)) (= .cse1 (select (select |v_#memory_$Pointer$.offset_22| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (= |#memory_int| (store |v_#memory_int_25| |main_~#a~0.base| (store (select |v_#memory_int_25| |main_~#a~0.base|) |main_~#a~0.offset| |v_main_#t~ret5_6|))) (not (= |main_~#a~0.base| |main_~#p2~0.base|)) (not (= |main_~#p1~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= .cse0 |main_~#p2~0.base|)) (= (select (select |v_#memory_$Pointer$.base_25| |main_~#p1~0.base|) |main_~#p1~0.offset|) .cse0) (not (= |main_~#p1~0.base| .cse0))))) [2018-11-23 11:08:29,259 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#p2~0.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32))) (.cse1 (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (.cse2 (select (select |#memory_$Pointer$.offset| |main_~#p2~0.base|) (_ bv0 32)))) (and (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= .cse0 |main_~#p2~0.base|)) (= (_ bv0 32) (select (select |#memory_int| .cse1) .cse2)) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= |main_~#p1~0.base| .cse0)) (= .cse0 .cse1) (= .cse2 (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) [2018-11-23 11:08:29,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-11-23 11:08:29,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 11:08:29,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-11-23 11:08:29,546 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-23 11:08:29,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 11:08:29,585 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 11:08:29,603 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,604 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,612 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:73, output treesize:3 [2018-11-23 11:08:29,620 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:29,620 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#p1~0.base|, |#memory_int|, |#memory_$Pointer$.offset|, |main_~#p2~0.base|]. (let ((.cse4 (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) (_ bv0 32)))) (let ((.cse1 (select |#memory_int| .cse4)) (.cse3 (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) (_ bv0 32))) (.cse2 (select (select |#memory_$Pointer$.offset| |main_~#p2~0.base|) (_ bv0 32))) (.cse0 (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)))) (and (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= .cse0 |main_~#p2~0.base|)) (= (_ bv0 32) (select .cse1 .cse2)) (= |main_#t~mem8| (select .cse1 .cse3)) (= .cse3 .cse2) (= .cse0 .cse4) (not (= |main_~#p1~0.base| .cse0))))) [2018-11-23 11:08:29,621 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) |main_#t~mem8|) [2018-11-23 11:08:29,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {360#true} call ULTIMATE.init(); {360#true} is VALID [2018-11-23 11:08:29,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {360#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {360#true} is VALID [2018-11-23 11:08:29,698 INFO L273 TraceCheckUtils]: 2: Hoare triple {360#true} assume true; {360#true} is VALID [2018-11-23 11:08:29,698 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {360#true} {360#true} #34#return; {360#true} is VALID [2018-11-23 11:08:29,699 INFO L256 TraceCheckUtils]: 4: Hoare triple {360#true} call #t~ret9 := main(); {360#true} is VALID [2018-11-23 11:08:29,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {360#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4bv32);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4bv32);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4bv32);call write~intINTTYPE4(1bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~intINTTYPE4(5bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);#t~post3 := #t~mem2;call write~intINTTYPE4(~bvsub32(#t~post3, 1bv32), ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~post3;havoc #t~mem2;call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {380#(and (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p1~0.base|)) (not (= |main_~#a~0.base| |main_~#p2~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= |main_~#p1~0.base| |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p2~0.base|)) (= (_ bv0 32) |main_~#p2~0.offset|))} is VALID [2018-11-23 11:08:29,709 INFO L256 TraceCheckUtils]: 6: Hoare triple {380#(and (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p1~0.base|)) (not (= |main_~#a~0.base| |main_~#p2~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= |main_~#p1~0.base| |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p2~0.base|)) (= (_ bv0 32) |main_~#p2~0.offset|))} call #t~ret5 := f(#t~mem4, ~#p1~0.base, ~#p1~0.offset, ~#p2~0.base, ~#p2~0.offset); {384#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-23 11:08:29,710 INFO L273 TraceCheckUtils]: 7: Hoare triple {384#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~a := #in~a;~p1.base, ~p1.offset := #in~p1.base, #in~p1.offset;~p2.base, ~p2.offset := #in~p2.base, #in~p2.offset; {388#(and (= f_~p2.offset |f_#in~p2.offset|) (= f_~p1.base |f_#in~p1.base|) (= f_~p2.base |f_#in~p2.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= f_~p1.offset |f_#in~p1.offset|))} is VALID [2018-11-23 11:08:29,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {388#(and (= f_~p2.offset |f_#in~p2.offset|) (= f_~p1.base |f_#in~p1.base|) (= f_~p2.base |f_#in~p2.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= f_~p1.offset |f_#in~p1.offset|))} assume 4bv32 == ~a; {388#(and (= f_~p2.offset |f_#in~p2.offset|) (= f_~p1.base |f_#in~p1.base|) (= f_~p2.base |f_#in~p2.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= f_~p1.offset |f_#in~p1.offset|))} is VALID [2018-11-23 11:08:29,712 INFO L256 TraceCheckUtils]: 9: Hoare triple {388#(and (= f_~p2.offset |f_#in~p2.offset|) (= f_~p1.base |f_#in~p1.base|) (= f_~p2.base |f_#in~p2.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= f_~p1.offset |f_#in~p1.offset|))} call g(~p1.base, ~p1.offset, ~p2.base, ~p2.offset); {384#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-23 11:08:29,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {384#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~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, 4bv32);~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, 4bv32);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~p1.base, ~p1.offset, 4bv32);havoc #t~mem1.base, #t~mem1.offset;call write~intINTTYPE4(0bv32, ~pq~0.base, ~pq~0.offset, 4bv32); {398#(or (and (= (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (_ bv0 32)) (= (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)))) |#memory_$Pointer$.base|)) (and (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) |g_#in~p2.offset|) (= |g_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))) (and (= (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) |g_#in~p2.offset| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) |g_#in~p2.offset|))) |#memory_$Pointer$.base|) (= |g_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) |g_#in~p2.offset|) (_ bv0 32)) (= |g_#in~p1.offset| |g_#in~p2.offset|) (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (and (= |g_#in~p1.offset| (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (_ bv0 32)) (= (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)))) |#memory_$Pointer$.base|)))} is VALID [2018-11-23 11:08:29,748 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(or (and (= (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (_ bv0 32)) (= (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)))) |#memory_$Pointer$.base|)) (and (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) |g_#in~p2.offset|) (= |g_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))) (and (= (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) |g_#in~p2.offset| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) |g_#in~p2.offset|))) |#memory_$Pointer$.base|) (= |g_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) |g_#in~p2.offset|) (_ bv0 32)) (= |g_#in~p1.offset| |g_#in~p2.offset|) (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (and (= |g_#in~p1.offset| (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (_ bv0 32)) (= (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)))) |#memory_$Pointer$.base|)))} assume true; {398#(or (and (= (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (_ bv0 32)) (= (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)))) |#memory_$Pointer$.base|)) (and (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) |g_#in~p2.offset|) (= |g_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))) (and (= (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) |g_#in~p2.offset| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) |g_#in~p2.offset|))) |#memory_$Pointer$.base|) (= |g_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) |g_#in~p2.offset|) (_ bv0 32)) (= |g_#in~p1.offset| |g_#in~p2.offset|) (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (and (= |g_#in~p1.offset| (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (_ bv0 32)) (= (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)))) |#memory_$Pointer$.base|)))} is VALID [2018-11-23 11:08:29,756 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {398#(or (and (= (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (_ bv0 32)) (= (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)))) |#memory_$Pointer$.base|)) (and (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) |g_#in~p2.offset|) (= |g_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p1.base|) |g_#in~p1.offset|)))))) (and (= (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) |g_#in~p2.offset| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) |g_#in~p2.offset|))) |#memory_$Pointer$.base|) (= |g_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) |g_#in~p2.offset|) (_ bv0 32)) (= |g_#in~p1.offset| |g_#in~p2.offset|) (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (and (= |g_#in~p1.offset| (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (= |g_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (= (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)) (_ bv0 32)) (= (store (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |g_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |g_#in~p1.base|) |g_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |g_#in~p2.base|) |g_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |g_#in~p2.base|) |g_#in~p2.offset|)))) |#memory_$Pointer$.base|)))} {388#(and (= f_~p2.offset |f_#in~p2.offset|) (= f_~p1.base |f_#in~p1.base|) (= f_~p2.base |f_#in~p2.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= f_~p1.offset |f_#in~p1.offset|))} #32#return; {405#(or (and (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset|)) (= |f_#in~p1.offset| |f_#in~p2.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset|)))) (= |f_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))))) (= (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (and (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))))) (= |f_#in~p1.offset| (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))))) (= |f_#in~p2.offset| (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)) (= |f_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)))))} is VALID [2018-11-23 11:08:29,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {405#(or (and (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset|)) (= |f_#in~p1.offset| |f_#in~p2.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset|)))) (= |f_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))))) (= (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (and (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))))) (= |f_#in~p1.offset| (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))))) (= |f_#in~p2.offset| (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)) (= |f_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)))))} #res := 1bv32; {405#(or (and (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset|)) (= |f_#in~p1.offset| |f_#in~p2.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset|)))) (= |f_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))))) (= (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (and (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))))) (= |f_#in~p1.offset| (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))))) (= |f_#in~p2.offset| (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)) (= |f_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)))))} is VALID [2018-11-23 11:08:29,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {405#(or (and (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset|)) (= |f_#in~p1.offset| |f_#in~p2.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset|)))) (= |f_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))))) (= (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (and (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))))) (= |f_#in~p1.offset| (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))))) (= |f_#in~p2.offset| (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)) (= |f_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)))))} assume true; {405#(or (and (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset|)) (= |f_#in~p1.offset| |f_#in~p2.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset|)))) (= |f_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))))) (= (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (and (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))))) (= |f_#in~p1.offset| (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))))) (= |f_#in~p2.offset| (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)) (= |f_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)))))} is VALID [2018-11-23 11:08:29,770 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {405#(or (and (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset|)) (= |f_#in~p1.offset| |f_#in~p2.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) |f_#in~p2.offset|)))) (= |f_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))))) (= (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))) (and (= |f_#in~p1.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))))) (= |f_#in~p1.offset| (select (select |#memory_$Pointer$.offset| |f_#in~p2.base|) |f_#in~p2.offset|))) (and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|) (store (select (store |old(#memory_$Pointer$.base)| |f_#in~p1.base| (store (select |old(#memory_$Pointer$.base)| |f_#in~p1.base|) |f_#in~p1.offset| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|))) (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|) (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|))))) (= |f_#in~p2.offset| (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)) (= |f_#in~p2.base| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |old(#memory_$Pointer$.base)| |f_#in~p2.base|) |f_#in~p2.offset|)) (select (select |#memory_$Pointer$.offset| |f_#in~p1.base|) |f_#in~p1.offset|)))))} {380#(and (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p1~0.base|)) (not (= |main_~#a~0.base| |main_~#p2~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= |main_~#p1~0.base| |main_~#a~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p2~0.offset|) |main_~#p2~0.base|)) (= (_ bv0 32) |main_~#p2~0.offset|))} #38#return; {415#(and (exists ((|main_~#p2~0.base| (_ BitVec 32))) (and (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)) |main_~#p2~0.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |main_~#p2~0.base|) (_ bv0 32))) (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#p2~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|)) (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#p2~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} is VALID [2018-11-23 11:08:29,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {415#(and (exists ((|main_~#p2~0.base| (_ BitVec 32))) (and (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)) |main_~#p2~0.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |main_~#p2~0.base|) (_ bv0 32))) (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#p2~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|)) (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#p2~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= |main_~#p1~0.base| |main_~#a~0.base|)))} call write~intINTTYPE4(#t~ret5, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~mem4;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32); {419#(and (exists ((|main_~#p2~0.base| (_ BitVec 32))) (and (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)) |main_~#p2~0.base|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p2~0.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#p2~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) (= (_ bv0 32) |main_~#p1~0.offset|))} is VALID [2018-11-23 11:08:29,784 INFO L273 TraceCheckUtils]: 17: Hoare triple {419#(and (exists ((|main_~#p2~0.base| (_ BitVec 32))) (and (not (= |main_~#p1~0.base| |main_~#p2~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)) |main_~#p2~0.base|)) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#p2~0.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|)) (not (= |main_~#p1~0.base| (select (select |#memory_$Pointer$.base| |main_~#p2~0.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#p2~0.base|) (_ bv0 32)) (select (select |#memory_$Pointer$.offset| |main_~#p1~0.base|) |main_~#p1~0.offset|)))) (= (_ bv0 32) |main_~#p1~0.offset|))} assume !(1bv32 != #t~mem6);havoc #t~mem6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4bv32);call #t~mem8 := read~intINTTYPE4(#t~mem7.base, #t~mem7.offset, 4bv32); {423#(= (_ bv0 32) |main_#t~mem8|)} is VALID [2018-11-23 11:08:29,785 INFO L273 TraceCheckUtils]: 18: Hoare triple {423#(= (_ bv0 32) |main_#t~mem8|)} assume 0bv32 != #t~mem8;havoc #t~mem7.base, #t~mem7.offset;havoc #t~mem8; {361#false} is VALID [2018-11-23 11:08:29,785 INFO L273 TraceCheckUtils]: 19: Hoare triple {361#false} assume !false; {361#false} is VALID [2018-11-23 11:08:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:08:29,792 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:08:29,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:08:29,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:08:29,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-23 11:08:29,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:29,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:08:29,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:29,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:08:29,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:08:29,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:08:29,946 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 10 states. [2018-11-23 11:08:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:43,230 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-23 11:08:43,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:08:43,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-23 11:08:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:08:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2018-11-23 11:08:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:08:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2018-11-23 11:08:43,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 20 transitions. [2018-11-23 11:08:43,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:43,393 INFO L225 Difference]: With dead ends: 21 [2018-11-23 11:08:43,394 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:08:43,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:08:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:08:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:08:43,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:43,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:43,396 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:43,396 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:43,396 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:08:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:08:43,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:43,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:43,397 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:43,397 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:08:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:43,397 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:08:43,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:08:43,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:43,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:43,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:43,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:08:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:08:43,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-23 11:08:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:43,399 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:08:43,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:08:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:08:43,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:43,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:08:43,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:08:43,671 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:08:43,671 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:08:43,671 INFO L444 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (= f_~p2.offset |f_#in~p2.offset|) (= |f_#in~a| f_~a) (= f_~p1.base |f_#in~p1.base|) (= f_~p2.base |f_#in~p2.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= f_~p1.offset |f_#in~p1.offset|)) [2018-11-23 11:08:43,671 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 17) no Hoare annotation was computed. [2018-11-23 11:08:43,671 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-11-23 11:08:43,671 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 11 18) no Hoare annotation was computed. [2018-11-23 11:08:43,671 INFO L444 ceAbstractionStarter]: At program point fENTRY(lines 11 18) the Hoare annotation is: (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) [2018-11-23 11:08:43,671 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 11 18) no Hoare annotation was computed. [2018-11-23 11:08:43,671 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-23 11:08:43,671 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 4 9) no Hoare annotation was computed. [2018-11-23 11:08:43,672 INFO L444 ceAbstractionStarter]: At program point gENTRY(lines 4 9) the Hoare annotation is: (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) [2018-11-23 11:08:43,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:08:43,672 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:08:43,672 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:08:43,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:08:43,672 INFO L444 ceAbstractionStarter]: 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 (= (select (select |#memory_$Pointer$.base| |main_~#p1~0.base|) |main_~#p1~0.offset|) |main_~#a~0.base|) (not (= .cse0 |main_~#a~0.base|)) (not (= .cse0 |main_~#p1~0.base|)) (not (= |main_~#a~0.base| |main_~#p2~0.base|)) (= (_ bv0 32) |main_~#p1~0.offset|) (not (= |main_~#p1~0.base| |main_~#a~0.base|)) (= (_ bv4 32) |main_#t~mem4|) (not (= .cse0 |main_~#p2~0.base|)) (= (_ bv0 32) |main_~#p2~0.offset|))) [2018-11-23 11:08:43,672 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-11-23 11:08:43,672 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 20 46) the Hoare annotation is: (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) [2018-11-23 11:08:43,672 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2018-11-23 11:08:43,672 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 20 46) no Hoare annotation was computed. [2018-11-23 11:08:43,673 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 20 46) no Hoare annotation was computed. [2018-11-23 11:08:43,673 INFO L444 ceAbstractionStarter]: At program point L39(lines 20 46) the Hoare annotation is: false [2018-11-23 11:08:43,673 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-23 11:08:43,673 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-11-23 11:08:43,674 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:08:43,674 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 11:08:43,674 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2018-11-23 11:08:43,680 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:08:43,680 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 11:08:43,680 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 11:08:43,680 WARN L170 areAnnotationChecker]: gFINAL has no Hoare annotation [2018-11-23 11:08:43,680 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:08:43,681 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 11:08:43,682 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:08:43,682 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-23 11:08:43,683 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2018-11-23 11:08:43,683 WARN L170 areAnnotationChecker]: gEXIT has no Hoare annotation [2018-11-23 11:08:43,683 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:08:43,683 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 11:08:43,684 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-23 11:08:43,684 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2018-11-23 11:08:43,684 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 11:08:43,684 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 11:08:43,684 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 11:08:43,684 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:08:43,684 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 11:08:43,685 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 11:08:43,685 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:08:43,685 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:08:43,685 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. [2018-11-23 11:08:43,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:08:43 BoogieIcfgContainer [2018-11-23 11:08:43,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:08:43,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:08:43,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:08:43,692 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:08:43,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:26" (3/4) ... [2018-11-23 11:08:43,696 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:08:43,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:08:43,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-11-23 11:08:43,702 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-11-23 11:08:43,703 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:08:43,709 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-23 11:08:43,710 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-23 11:08:43,710 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:08:43,710 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:08:43,766 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test05_true-unreach-call_true-termination.c-witness.graphml [2018-11-23 11:08:43,766 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:08:43,767 INFO L168 Benchmark]: Toolchain (without parser) took 78960.44 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 867.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -720.5 MB). Peak memory consumption was 147.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:43,768 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:43,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:43,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:43,769 INFO L168 Benchmark]: Boogie Preprocessor took 69.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:43,770 INFO L168 Benchmark]: RCFGBuilder took 1047.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 719.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -750.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:43,771 INFO L168 Benchmark]: TraceAbstraction took 77382.81 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 147.8 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 167.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:43,771 INFO L168 Benchmark]: Witness Printer took 74.68 ms. Allocated memory is still 2.4 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:43,774 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 338.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1047.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 719.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -750.8 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 77382.81 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 147.8 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 167.6 MB. Max. memory is 7.1 GB. * Witness Printer took 74.68 ms. Allocated memory is still 2.4 GB. Free memory is still 2.1 GB. There was no memory consumed. 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. SAFE Result, 77.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 17.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 53 SDtfs, 11 SDslu, 143 SDs, 0 SdLazy, 87 SolverSat, 4 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.0s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 81 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 58.3s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 50 ConstructedInterpolants, 2 QuantifiedInterpolants, 38131 SizeOfPredicates, 33 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...