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/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:04:45,732 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:04:45,734 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:04:45,748 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:04:45,748 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:04:45,750 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:04:45,751 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:04:45,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:04:45,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:04:45,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:04:45,757 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:04:45,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:04:45,758 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:04:45,759 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:04:45,760 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:04:45,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:04:45,762 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:04:45,763 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:04:45,765 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:04:45,767 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:04:45,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:04:45,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:04:45,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:04:45,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:04:45,778 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:04:45,782 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:04:45,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:04:45,784 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:04:45,785 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:04:45,786 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:04:45,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:04:45,790 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:04:45,790 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:04:45,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:04:45,791 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:04:45,794 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:04:45,795 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:04:45,819 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:04:45,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:04:45,820 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:04:45,821 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:04:45,821 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:04:45,822 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:04:45,822 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:04:45,822 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:04:45,822 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:04:45,822 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:04:45,823 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:04:45,823 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:04:45,823 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:04:45,823 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:04:45,823 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:04:45,824 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:04:45,824 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:04:45,824 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:04:45,824 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:04:45,824 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:04:45,825 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:04:45,825 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:04:45,825 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:04:45,825 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:04:45,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:04:45,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:04:45,826 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:04:45,826 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:04:45,826 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:04:45,826 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:04:45,827 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:04:45,827 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:04:45,827 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:04:45,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:04:45,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:04:45,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:04:45,893 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:04:45,893 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:04:45,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:04:45,957 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32e7260b/e6851db4f2fc4ee580662e2b2fc4bcae/FLAG5e20d0214 [2018-11-23 11:04:46,521 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:04:46,522 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:04:46,535 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32e7260b/e6851db4f2fc4ee580662e2b2fc4bcae/FLAG5e20d0214 [2018-11-23 11:04:46,818 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d32e7260b/e6851db4f2fc4ee580662e2b2fc4bcae [2018-11-23 11:04:46,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:04:46,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:04:46,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:04:46,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:04:46,835 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:04:46,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:04:46" (1/1) ... [2018-11-23 11:04:46,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a6561f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:46, skipping insertion in model container [2018-11-23 11:04:46,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:04:46" (1/1) ... [2018-11-23 11:04:46,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:04:46,911 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:04:47,376 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:04:47,397 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:04:47,490 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:04:47,637 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:04:47,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:47 WrapperNode [2018-11-23 11:04:47,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:04:47,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:04:47,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:04:47,640 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:04:47,650 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:04:47" (1/1) ... [2018-11-23 11:04:47,680 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:04:47" (1/1) ... [2018-11-23 11:04:47,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:04:47,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:04:47,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:04:47,690 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:04:47,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:47" (1/1) ... [2018-11-23 11:04:47,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:47" (1/1) ... [2018-11-23 11:04:47,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:47" (1/1) ... [2018-11-23 11:04:47,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:47" (1/1) ... [2018-11-23 11:04:47,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:47" (1/1) ... [2018-11-23 11:04:47,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:47" (1/1) ... [2018-11-23 11:04:47,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:47" (1/1) ... [2018-11-23 11:04:47,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:04:47,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:04:47,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:04:47,752 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:04:47,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:47" (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:04:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:04:47,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:04:47,807 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:04:47,807 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:04:47,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:04:47,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:04:47,808 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:04:47,808 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:04:47,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:04:47,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:04:47,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:04:47,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:04:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:04:47,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:04:48,709 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:04:48,709 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:04:48,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:04:48 BoogieIcfgContainer [2018-11-23 11:04:48,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:04:48,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:04:48,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:04:48,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:04:48,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:04:46" (1/3) ... [2018-11-23 11:04:48,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35639546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:04:48, skipping insertion in model container [2018-11-23 11:04:48,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:47" (2/3) ... [2018-11-23 11:04:48,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35639546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:04:48, skipping insertion in model container [2018-11-23 11:04:48,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:04:48" (3/3) ... [2018-11-23 11:04:48,720 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:04:48,732 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:04:48,744 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:04:48,763 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:04:48,806 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:04:48,807 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:04:48,807 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:04:48,807 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:04:48,808 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:04:48,808 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:04:48,808 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:04:48,808 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:04:48,808 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:04:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-23 11:04:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:04:48,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:04:48,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:04:48,840 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:04:48,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:04:48,847 INFO L82 PathProgramCache]: Analyzing trace with hash 545881779, now seen corresponding path program 1 times [2018-11-23 11:04:48,852 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:04:48,853 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:04:48,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:04:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:48,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:04:49,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-23 11:04:49,061 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {37#true} is VALID [2018-11-23 11:04:49,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-23 11:04:49,062 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #96#return; {37#true} is VALID [2018-11-23 11:04:49,062 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret10 := main(); {37#true} is VALID [2018-11-23 11:04:49,062 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} ~flag~0 := 1bv32;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {37#true} is VALID [2018-11-23 11:04:49,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {37#true} is VALID [2018-11-23 11:04:49,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {37#true} is VALID [2018-11-23 11:04:49,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {37#true} is VALID [2018-11-23 11:04:49,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#true} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1bv32; {69#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:04:49,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {69#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {69#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:04:49,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {69#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(3bv32 != #t~mem4);havoc #t~mem4; {69#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:04:49,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {69#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~flag~0);~flag~0 := 1bv32;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {38#false} is VALID [2018-11-23 11:04:49,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume 2bv32 != #t~mem6;havoc #t~mem6; {38#false} is VALID [2018-11-23 11:04:49,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-23 11:04:49,088 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:04:49,089 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:04:49,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:04:49,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:04:49,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:04:49,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:04:49,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:04:49,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:49,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:04:49,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:04:49,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:04:49,167 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2018-11-23 11:04:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:49,863 INFO L93 Difference]: Finished difference Result 78 states and 108 transitions. [2018-11-23 11:04:49,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:04:49,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:04:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:04:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:04:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2018-11-23 11:04:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:04:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2018-11-23 11:04:49,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 108 transitions. [2018-11-23 11:04:50,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:50,465 INFO L225 Difference]: With dead ends: 78 [2018-11-23 11:04:50,465 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:04:50,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:04:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:04:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-11-23 11:04:50,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:04:50,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 31 states. [2018-11-23 11:04:50,515 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 31 states. [2018-11-23 11:04:50,516 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 31 states. [2018-11-23 11:04:50,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:50,520 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 11:04:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 11:04:50,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:50,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:50,522 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 34 states. [2018-11-23 11:04:50,522 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 34 states. [2018-11-23 11:04:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:50,526 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 11:04:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 11:04:50,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:50,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:50,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:04:50,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:04:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:04:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 11:04:50,533 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 15 [2018-11-23 11:04:50,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:04:50,533 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 11:04:50,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:04:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 11:04:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:04:50,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:04:50,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:04:50,535 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:04:50,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:04:50,536 INFO L82 PathProgramCache]: Analyzing trace with hash 545874835, now seen corresponding path program 1 times [2018-11-23 11:04:50,536 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:04:50,537 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:04:50,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:04:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:50,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:04:50,877 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 11 treesize of output 8 [2018-11-23 11:04:50,884 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:04:50,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:50,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:50,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:50,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:04:51,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2018-11-23 11:04:51,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {294#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {294#true} is VALID [2018-11-23 11:04:51,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2018-11-23 11:04:51,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #96#return; {294#true} is VALID [2018-11-23 11:04:51,082 INFO L256 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret10 := main(); {294#true} is VALID [2018-11-23 11:04:51,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {294#true} ~flag~0 := 1bv32;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {314#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:04:51,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {314#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {314#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:04:51,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {314#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {321#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:04:51,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {321#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {321#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:04:51,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {321#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1bv32; {328#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:04:51,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {328#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {332#(and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem4|) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:04:51,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {332#(and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem4|) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !!(3bv32 != #t~mem4);havoc #t~mem4; {295#false} is VALID [2018-11-23 11:04:51,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {295#false} assume 0bv32 != ~flag~0;~flag~0 := 0bv32;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {295#false} is VALID [2018-11-23 11:04:51,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {295#false} assume 1bv32 != #t~mem5;havoc #t~mem5; {295#false} is VALID [2018-11-23 11:04:51,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {295#false} assume !false; {295#false} is VALID [2018-11-23 11:04:51,093 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:04:51,094 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:04:51,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:04:51,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:04:51,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 11:04:51,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:04:51,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:04:51,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:51,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:04:51,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:04:51,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:04:51,142 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 6 states. [2018-11-23 11:04:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:51,857 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-23 11:04:51,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:04:51,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 11:04:51,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:04:51,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:04:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 11:04:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:04:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 11:04:51,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2018-11-23 11:04:51,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:51,998 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:04:51,999 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 11:04:52,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:04:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 11:04:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-11-23 11:04:52,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:04:52,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 32 states. [2018-11-23 11:04:52,037 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 32 states. [2018-11-23 11:04:52,038 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 32 states. [2018-11-23 11:04:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:52,042 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 11:04:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 11:04:52,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:52,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:52,043 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 43 states. [2018-11-23 11:04:52,043 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 43 states. [2018-11-23 11:04:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:52,046 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 11:04:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 11:04:52,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:52,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:52,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:04:52,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:04:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:04:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 11:04:52,051 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 15 [2018-11-23 11:04:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:04:52,051 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 11:04:52,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:04:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 11:04:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:04:52,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:04:52,053 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:04:52,053 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:04:52,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:04:52,054 INFO L82 PathProgramCache]: Analyzing trace with hash 617946346, now seen corresponding path program 1 times [2018-11-23 11:04:52,054 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:04:52,054 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:04:52,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:04:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:52,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:04:52,188 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 6 treesize of output 5 [2018-11-23 11:04:52,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:04:52,214 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:04:52,214 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_15|]. (and (= |#valid| (store |v_#valid_15| main_~a~0.base (_ bv1 1))) (= main_~a~0.offset (_ bv0 32))) [2018-11-23 11:04:52,215 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:04:52,353 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 11 treesize of output 8 [2018-11-23 11:04:52,359 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:04:52,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 11:04:52,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:04:52,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:04:52,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:04:52,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:21 [2018-11-23 11:04:52,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 11:04:52,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:04:52,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 11:04:52,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 11:04:52,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 11:04:52,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 8 treesize of output 7 [2018-11-23 11:04:52,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:04:52,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-23 11:04:52,774 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:04:52,774 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (select (select |v_#memory_int_18| main_~p~0.base) (_ bv0 32)) (_ bv1 32)) (= (store |v_#memory_int_18| v_main_~p~0.base_20 (store (select |v_#memory_int_18| v_main_~p~0.base_20) v_main_~p~0.offset_20 (_ bv3 32))) |#memory_int|)) [2018-11-23 11:04:52,774 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_20, v_main_~p~0.offset_20]. (and (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) (_ bv3 32)) (= (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv1 32))) [2018-11-23 11:04:52,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-23 11:04:52,978 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 13 treesize of output 5 [2018-11-23 11:04:52,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,992 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:04:52,993 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:52,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:53,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:53,006 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:5 [2018-11-23 11:04:53,010 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:04:53,010 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_main_~p~0.base_20, v_main_~p~0.offset_20]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (bvadd .cse0 (_ bv4294967295 32)) (_ bv0 32)) (= .cse0 |main_#t~mem5|) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) (_ bv4294967293 32)) (_ bv0 32)))) [2018-11-23 11:04:53,010 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem5| (_ bv4294967295 32))) [2018-11-23 11:04:53,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {550#true} call ULTIMATE.init(); {550#true} is VALID [2018-11-23 11:04:53,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {550#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {550#true} is VALID [2018-11-23 11:04:53,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {550#true} assume true; {550#true} is VALID [2018-11-23 11:04:53,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} #96#return; {550#true} is VALID [2018-11-23 11:04:53,094 INFO L256 TraceCheckUtils]: 4: Hoare triple {550#true} call #t~ret10 := main(); {550#true} is VALID [2018-11-23 11:04:53,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {550#true} ~flag~0 := 1bv32;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {570#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:04:53,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {570#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {570#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:04:53,129 INFO L273 TraceCheckUtils]: 7: Hoare triple {570#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {577#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:04:53,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {577#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1; {577#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:04:53,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {577#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume 0bv32 != ~flag~0;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);~flag~0 := 0bv32; {584#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:04:53,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {584#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {588#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:04:53,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {588#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {588#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:04:53,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {588#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {595#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:04:53,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {595#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {595#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:04:53,196 INFO L273 TraceCheckUtils]: 14: Hoare triple {595#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1bv32; {602#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_20 (_ BitVec 32)) (v_main_~p~0.offset_20 (_ BitVec 32))) (and (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) (_ bv4294967293 32)) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:04:53,197 INFO L273 TraceCheckUtils]: 15: Hoare triple {602#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_20 (_ BitVec 32)) (v_main_~p~0.offset_20 (_ BitVec 32))) (and (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) (_ bv4294967293 32)) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {602#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_20 (_ BitVec 32)) (v_main_~p~0.offset_20 (_ BitVec 32))) (and (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) (_ bv4294967293 32)) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:04:53,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {602#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_20 (_ BitVec 32)) (v_main_~p~0.offset_20 (_ BitVec 32))) (and (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) (_ bv4294967293 32)) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(3bv32 != #t~mem4);havoc #t~mem4; {602#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_20 (_ BitVec 32)) (v_main_~p~0.offset_20 (_ BitVec 32))) (and (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) (_ bv4294967293 32)) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:04:53,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {602#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_20 (_ BitVec 32)) (v_main_~p~0.offset_20 (_ BitVec 32))) (and (not (= v_main_~p~0.base_20 main_~p~0.base)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) (_ bv4294967293 32)) (_ bv0 32)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 != ~flag~0;~flag~0 := 0bv32;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {612#(= (_ bv1 32) |main_#t~mem5|)} is VALID [2018-11-23 11:04:53,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {612#(= (_ bv1 32) |main_#t~mem5|)} assume 1bv32 != #t~mem5;havoc #t~mem5; {551#false} is VALID [2018-11-23 11:04:53,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {551#false} assume !false; {551#false} is VALID [2018-11-23 11:04:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:04:53,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:04:53,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:53,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:53,551 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:04:53,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:04:53,593 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 2 xjuncts. [2018-11-23 11:04:53,594 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-23 11:04:53,605 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:04:53,606 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_20|, v_subst_1]. (or (= (_ bv0 32) (bvadd (select (select (store |v_#memory_int_20| main_~t~0.base (store (select |v_#memory_int_20| main_~t~0.base) v_subst_1 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32))) (not (= (store |#memory_int| main_~p~0.base (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (store (select |#memory_int| main_~p~0.base) .cse0 (select (select |v_#memory_int_20| main_~p~0.base) .cse0)))) |v_#memory_int_20|))) [2018-11-23 11:04:53,606 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_4]. (and (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_4)) main_~a~0.base) main_~a~0.offset)) (not (= main_~t~0.base main_~a~0.base))) [2018-11-23 11:04:59,876 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:05:00,010 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 28 treesize of output 26 [2018-11-23 11:05:00,017 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-11-23 11:05:00,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 11:05:00,153 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:00,159 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 15 treesize of output 6 [2018-11-23 11:05:00,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:00,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:00,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:00,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-11-23 11:05:00,280 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-11-23 11:05:00,354 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 15 treesize of output 6 [2018-11-23 11:05:00,356 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:00,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:05:00,366 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:00,414 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:00,485 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 21 treesize of output 19 [2018-11-23 11:05:00,550 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:00,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-23 11:05:00,587 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:00,650 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:05:00,652 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 27 treesize of output 33 [2018-11-23 11:05:00,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-23 11:05:00,738 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:00,758 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:00,803 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:00,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-23 11:05:00,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-23 11:05:00,817 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:00,824 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:00,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-23 11:05:00,895 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:34, output treesize:42 [2018-11-23 11:05:00,903 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:00,904 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, v_DerPreprocessor_4, |v_main_#t~malloc2.base_2|]. (and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_4)) main_~a~0.base) main_~a~0.offset)) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))))) [2018-11-23 11:05:00,904 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [|v_main_#t~malloc2.base_2|, v_prenex_3, v_prenex_2]. (let ((.cse0 (= main_~a~0.offset main_~p~0.offset))) (and (or (= (bvadd main_~p~0.offset (_ bv4 32)) main_~a~0.offset) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) .cse0) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (not (= (select |#valid| v_prenex_3) (_ bv0 1)))) (or (not (= (select |#valid| v_prenex_2) (_ bv0 1))) .cse0))) [2018-11-23 11:05:01,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {551#false} assume !false; {551#false} is VALID [2018-11-23 11:05:01,101 INFO L273 TraceCheckUtils]: 18: Hoare triple {612#(= (_ bv1 32) |main_#t~mem5|)} assume 1bv32 != #t~mem5;havoc #t~mem5; {551#false} is VALID [2018-11-23 11:05:01,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {625#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~flag~0;~flag~0 := 0bv32;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {612#(= (_ bv1 32) |main_#t~mem5|)} is VALID [2018-11-23 11:05:01,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {625#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} assume !!(3bv32 != #t~mem4);havoc #t~mem4; {625#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:01,107 INFO L273 TraceCheckUtils]: 15: Hoare triple {625#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {625#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:01,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {635#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1bv32; {625#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:01,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {635#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {635#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:01,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {642#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_DerPreprocessor_4 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_4)) main_~a~0.base) main_~a~0.offset))))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {635#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:01,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {642#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_DerPreprocessor_4 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_4)) main_~a~0.base) main_~a~0.offset))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {642#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_DerPreprocessor_4 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_4)) main_~a~0.base) main_~a~0.offset))))} is VALID [2018-11-23 11:05:01,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {649#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1)))) (forall ((v_DerPreprocessor_4 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_4)) main_~a~0.base) main_~a~0.offset)))))} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {642#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_DerPreprocessor_4 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_4)) main_~a~0.base) main_~a~0.offset))))} is VALID [2018-11-23 11:05:01,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {653#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (select |#valid| v_prenex_2) (_ bv0 1)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_3 (_ BitVec 32))) (not (= (select |#valid| v_prenex_3) (_ bv0 1))))))} assume 0bv32 != ~flag~0;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);~flag~0 := 0bv32; {649#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((|v_main_#t~malloc2.base_2| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1)))) (forall ((v_DerPreprocessor_4 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_4)) main_~a~0.base) main_~a~0.offset)))))} is VALID [2018-11-23 11:05:01,153 INFO L273 TraceCheckUtils]: 8: Hoare triple {653#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (select |#valid| v_prenex_2) (_ bv0 1)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_3 (_ BitVec 32))) (not (= (select |#valid| v_prenex_3) (_ bv0 1))))))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1; {653#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (select |#valid| v_prenex_2) (_ bv0 1)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_3 (_ BitVec 32))) (not (= (select |#valid| v_prenex_3) (_ bv0 1))))))} is VALID [2018-11-23 11:05:01,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {660#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {653#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (select |#valid| v_prenex_2) (_ bv0 1)))) (= main_~a~0.offset main_~p~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_3 (_ BitVec 32))) (not (= (select |#valid| v_prenex_3) (_ bv0 1))))))} is VALID [2018-11-23 11:05:01,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {660#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {660#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:05:01,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {550#true} ~flag~0 := 1bv32;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {660#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:05:01,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {550#true} call #t~ret10 := main(); {550#true} is VALID [2018-11-23 11:05:01,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} #96#return; {550#true} is VALID [2018-11-23 11:05:01,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {550#true} assume true; {550#true} is VALID [2018-11-23 11:05:01,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {550#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {550#true} is VALID [2018-11-23 11:05:01,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {550#true} call ULTIMATE.init(); {550#true} is VALID [2018-11-23 11:05:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:01,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:05:01,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-23 11:05:01,172 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-11-23 11:05:01,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:01,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:05:01,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:01,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:05:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:05:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=166, Unknown=1, NotChecked=0, Total=210 [2018-11-23 11:05:01,254 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 15 states. [2018-11-23 11:05:02,751 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-11-23 11:05:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:03,517 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 11:05:03,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:05:03,517 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-11-23 11:05:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:05:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2018-11-23 11:05:03,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:05:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2018-11-23 11:05:03,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 41 transitions. [2018-11-23 11:05:03,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:03,633 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:05:03,633 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:05:03,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=100, Invalid=279, Unknown=1, NotChecked=0, Total=380 [2018-11-23 11:05:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:05:03,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-11-23 11:05:03,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:03,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 36 states. [2018-11-23 11:05:03,713 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 36 states. [2018-11-23 11:05:03,714 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 36 states. [2018-11-23 11:05:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:03,716 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 11:05:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:05:03,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:03,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:03,718 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 41 states. [2018-11-23 11:05:03,718 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 41 states. [2018-11-23 11:05:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:03,721 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 11:05:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:05:03,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:03,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:03,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:03,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:05:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 11:05:03,724 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2018-11-23 11:05:03,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:03,725 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 11:05:03,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:05:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 11:05:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:05:03,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:03,726 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:03,726 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:03,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash 999549951, now seen corresponding path program 1 times [2018-11-23 11:05:03,727 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:03,728 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:05:03,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:03,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:03,847 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 6 treesize of output 5 [2018-11-23 11:05:03,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:03,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:03,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:05:03,861 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:03,861 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_22|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_22| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:05:03,862 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:05:03,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:03,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:03,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:05:03,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:03,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:03,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2018-11-23 11:05:04,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:05:04,060 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 10 treesize of output 9 [2018-11-23 11:05:04,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:04,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:04,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:05:04,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 11:05:04,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:04,126 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:04,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:04,210 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:32 [2018-11-23 11:05:04,234 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:04,235 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_16|, main_~t~0.offset, |v_#memory_$Pointer$.base_17|, main_~t~0.base]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~a~0.offset (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_16| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_16| main_~a~0.base) .cse0 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0) main_~p~0.base) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_17| main_~a~0.base (store (select |v_#memory_$Pointer$.base_17| main_~a~0.base) .cse0 main_~t~0.base))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (not (= main_~t~0.base main_~a~0.base)))) [2018-11-23 11:05:04,235 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse1))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse1))))) [2018-11-23 11:05:04,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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:05:04,393 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:05:04,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:04,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:04,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 87 [2018-11-23 11:05:04,659 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 1 [2018-11-23 11:05:04,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:04,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:04,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-11-23 11:05:04,741 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 1 [2018-11-23 11:05:04,742 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:04,749 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:04,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:04,760 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2018-11-23 11:05:04,899 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:04,900 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_18|, |v_#memory_int_22|, |v_#memory_$Pointer$.offset_17|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_18| main_~p~0.base) (_ bv4 32))) (.cse1 (select (select |v_#memory_$Pointer$.offset_17| main_~p~0.base) (_ bv4 32)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_18| .cse0 (store (select |v_#memory_$Pointer$.base_18| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (= main_~p~0.offset (_ bv0 32)) (not (= .cse0 main_~p~0.base)) (= (store |v_#memory_int_22| .cse0 (store (select |v_#memory_int_22| .cse0) .cse1 (_ bv3 32))) |#memory_int|) (= (store |v_#memory_$Pointer$.offset_17| .cse0 (store (select |v_#memory_$Pointer$.offset_17| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|))) [2018-11-23 11:05:04,900 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv3 32)) (not (= .cse0 main_~p~0.base)))) [2018-11-23 11:05:04,968 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 25 treesize of output 21 [2018-11-23 11:05:05,002 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 21 treesize of output 13 [2018-11-23 11:05:05,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:05,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:05,042 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 29 treesize of output 23 [2018-11-23 11:05:05,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-23 11:05:05,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:05,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:05,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:05,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:9 [2018-11-23 11:05:05,084 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:05,084 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_26, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_26) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_26) (_ bv4 32)))) (and (= .cse0 main_~p~0.base) (not (= v_main_~p~0.base_26 .cse0)) (= main_~p~0.offset .cse1) (= (_ bv0 32) (bvadd (select (select |#memory_int| .cse0) .cse1) (_ bv4294967293 32))))) [2018-11-23 11:05:05,085 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32))) [2018-11-23 11:05:05,200 INFO L256 TraceCheckUtils]: 0: Hoare triple {878#true} call ULTIMATE.init(); {878#true} is VALID [2018-11-23 11:05:05,200 INFO L273 TraceCheckUtils]: 1: Hoare triple {878#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {878#true} is VALID [2018-11-23 11:05:05,200 INFO L273 TraceCheckUtils]: 2: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-23 11:05:05,200 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {878#true} {878#true} #96#return; {878#true} is VALID [2018-11-23 11:05:05,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {878#true} call #t~ret10 := main(); {878#true} is VALID [2018-11-23 11:05:05,202 INFO L273 TraceCheckUtils]: 5: Hoare triple {878#true} ~flag~0 := 1bv32;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {898#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:05,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {898#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {898#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:05,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {898#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {905#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:05,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {905#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1; {905#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:05,206 INFO L273 TraceCheckUtils]: 9: Hoare triple {905#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume 0bv32 != ~flag~0;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);~flag~0 := 0bv32; {905#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:05,207 INFO L273 TraceCheckUtils]: 10: Hoare triple {905#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {915#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:05:05,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {915#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {915#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:05:05,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {915#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {922#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:05:05,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {922#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {922#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:05:05,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {922#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1bv32; {929#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:05:05,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {929#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {929#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:05:05,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {929#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !!(3bv32 != #t~mem4);havoc #t~mem4; {929#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:05:05,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {929#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume 0bv32 != ~flag~0;~flag~0 := 0bv32;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {929#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:05:05,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {929#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !(1bv32 != #t~mem5);havoc #t~mem5; {929#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:05:05,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {929#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {945#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:05:05,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {945#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {949#(and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem4|) (= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:05:05,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {949#(and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem4|) (= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))} assume !!(3bv32 != #t~mem4);havoc #t~mem4; {879#false} is VALID [2018-11-23 11:05:05,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {879#false} assume !(0bv32 != ~flag~0);~flag~0 := 1bv32;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {879#false} is VALID [2018-11-23 11:05:05,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {879#false} assume 2bv32 != #t~mem6;havoc #t~mem6; {879#false} is VALID [2018-11-23 11:05:05,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {879#false} assume !false; {879#false} is VALID [2018-11-23 11:05:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:05,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:05:05,527 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2018-11-23 11:05:05,533 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 21 treesize of output 13 [2018-11-23 11:05:05,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 11:05:05,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:05,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:05,606 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:05,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:05,625 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:05,633 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:05,680 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:05,688 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:05,698 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:05,705 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:05,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:05:05,726 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:62, output treesize:35 [2018-11-23 11:05:05,826 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:05,826 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |v_#memory_$Pointer$.base_19|, |v_#memory_$Pointer$.offset_18|]. (or (not (= (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.base_19| main_~p~0.base) main_~p~0.offset))) |v_#memory_$Pointer$.base_19|)) (not (= |v_#memory_$Pointer$.offset_18| (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_18| main_~p~0.base) main_~p~0.offset))))) (= (bvadd (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) (select (select |v_#memory_$Pointer$.base_19| main_~a~0.base) .cse0)) (select (select |v_#memory_$Pointer$.offset_18| main_~a~0.base) .cse0))) (_ bv4294967293 32)) (_ bv0 32))) [2018-11-23 11:05:05,826 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_6, v_DerPreprocessor_12]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_6)) main_~a~0.base) .cse0)) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_12)) main_~a~0.base) .cse0) main_~p~0.base))) [2018-11-23 11:05:06,010 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-23 11:05:06,107 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 11 treesize of output 10 [2018-11-23 11:05:06,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:06,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-11-23 11:05:06,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 11:05:06,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:06,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:05:06,270 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:06,315 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 12 treesize of output 3 [2018-11-23 11:05:06,318 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:06,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:06,334 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 21 treesize of output 19 [2018-11-23 11:05:06,343 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 8 treesize of output 1 [2018-11-23 11:05:06,343 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:06,351 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:06,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:05:06,542 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-23 11:05:06,661 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 11 treesize of output 10 [2018-11-23 11:05:06,683 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:06,795 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 21 treesize of output 19 [2018-11-23 11:05:06,831 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 8 treesize of output 1 [2018-11-23 11:05:06,832 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:06,839 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:06,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-11-23 11:05:06,889 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 19 treesize of output 11 [2018-11-23 11:05:06,891 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:06,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 11:05:06,937 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:06,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:05:06,975 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:06,988 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:07,024 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:05:07,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:05:07,199 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:75, output treesize:33 [2018-11-23 11:05:07,237 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:07,238 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.base|, v_prenex_4, v_DerPreprocessor_12, |#memory_$Pointer$.offset|, main_~t~0.offset, v_DerPreprocessor_6]. (let ((.cse1 (bvadd main_~p~0.offset (_ bv4 32))) (.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~t~0.base (select (select (let ((.cse0 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse1 main_~t~0.base)))) (store .cse0 main_~t~0.base (store (select .cse0 main_~t~0.base) v_prenex_4 v_DerPreprocessor_12))) main_~a~0.base) .cse2)) (= (select (select (let ((.cse3 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse1 main_~t~0.offset)))) (store .cse3 main_~t~0.base (store (select .cse3 main_~t~0.base) main_~t~0.offset v_DerPreprocessor_6))) main_~a~0.base) .cse2) main_~t~0.offset))) [2018-11-23 11:05:07,238 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (= main_~p~0.base main_~a~0.base)) (.cse1 (= (bvadd main_~p~0.offset (_ bv4 32)) (bvadd main_~a~0.offset (_ bv4 32)))) (.cse2 (= main_~t~0.base main_~a~0.base))) (and .cse0 .cse1 (not .cse2) (or .cse0 .cse2) (or .cse1 .cse2))) [2018-11-23 11:05:07,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {879#false} assume !false; {879#false} is VALID [2018-11-23 11:05:07,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {879#false} assume 2bv32 != #t~mem6;havoc #t~mem6; {879#false} is VALID [2018-11-23 11:05:07,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {879#false} assume !(0bv32 != ~flag~0);~flag~0 := 1bv32;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {879#false} is VALID [2018-11-23 11:05:07,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {971#(= (_ bv3 32) |main_#t~mem4|)} assume !!(3bv32 != #t~mem4);havoc #t~mem4; {879#false} is VALID [2018-11-23 11:05:07,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {945#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {971#(= (_ bv3 32) |main_#t~mem4|)} is VALID [2018-11-23 11:05:07,520 INFO L273 TraceCheckUtils]: 19: Hoare triple {978#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {945#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:05:07,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {978#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume !(1bv32 != #t~mem5);havoc #t~mem5; {978#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:07,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {978#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume 0bv32 != ~flag~0;~flag~0 := 0bv32;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {978#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:07,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {978#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume !!(3bv32 != #t~mem4);havoc #t~mem4; {978#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:07,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {978#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {978#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:07,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {994#(and (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_12)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_6 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_6)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1bv32; {978#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:07,533 INFO L273 TraceCheckUtils]: 13: Hoare triple {994#(and (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_12)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_6 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_6)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {994#(and (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_12)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_6 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_6)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:05:07,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {1001#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {994#(and (forall ((v_DerPreprocessor_12 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_12)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_6 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_6)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:05:07,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {1001#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1001#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:05:07,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {1008#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((v_main_~t~0.base_8 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_8))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_7 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_7))))))} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {1001#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:05:07,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {1008#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((v_main_~t~0.base_8 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_8))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_7 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_7))))))} assume 0bv32 != ~flag~0;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);~flag~0 := 0bv32; {1008#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((v_main_~t~0.base_8 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_8))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_7 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_7))))))} is VALID [2018-11-23 11:05:07,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {1008#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((v_main_~t~0.base_8 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_8))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_7 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_7))))))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1; {1008#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((v_main_~t~0.base_8 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_8))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_7 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_7))))))} is VALID [2018-11-23 11:05:07,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {1018#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1008#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((v_main_~t~0.base_8 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_8))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_7 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_7))))))} is VALID [2018-11-23 11:05:07,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {1018#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1018#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:05:07,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {878#true} ~flag~0 := 1bv32;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1018#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:05:07,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {878#true} call #t~ret10 := main(); {878#true} is VALID [2018-11-23 11:05:07,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {878#true} {878#true} #96#return; {878#true} is VALID [2018-11-23 11:05:07,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-23 11:05:07,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {878#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {878#true} is VALID [2018-11-23 11:05:07,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {878#true} call ULTIMATE.init(); {878#true} is VALID [2018-11-23 11:05:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:07,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:05:07,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-23 11:05:07,612 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-23 11:05:07,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:07,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:05:07,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:07,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:05:07,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:05:07,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:05:07,693 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 15 states. [2018-11-23 11:05:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:09,675 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-11-23 11:05:09,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:05:09,676 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-11-23 11:05:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:05:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2018-11-23 11:05:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:05:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2018-11-23 11:05:09,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2018-11-23 11:05:09,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:09,808 INFO L225 Difference]: With dead ends: 69 [2018-11-23 11:05:09,808 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:05:09,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:05:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:05:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2018-11-23 11:05:09,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:09,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 41 states. [2018-11-23 11:05:09,868 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 41 states. [2018-11-23 11:05:09,868 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 41 states. [2018-11-23 11:05:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:09,872 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 11:05:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 11:05:09,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:09,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:09,873 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 49 states. [2018-11-23 11:05:09,873 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 49 states. [2018-11-23 11:05:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:09,875 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 11:05:09,875 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 11:05:09,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:09,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:09,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:09,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:09,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:05:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-23 11:05:09,879 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 25 [2018-11-23 11:05:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:09,879 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-23 11:05:09,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:05:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:05:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:05:09,880 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:09,880 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:09,880 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:09,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:09,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1076420692, now seen corresponding path program 1 times [2018-11-23 11:05:09,881 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:09,881 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:05:09,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:10,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:10,143 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 6 treesize of output 5 [2018-11-23 11:05:10,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:10,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:10,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:05:10,155 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:10,155 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_29|]. (and (= (store |v_#valid_29| main_~a~0.base (_ bv1 1)) |#valid|) (= main_~a~0.offset (_ bv0 32))) [2018-11-23 11:05:10,155 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:05:10,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:10,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:10,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-23 11:05:10,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:10,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:10,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:29 [2018-11-23 11:05:10,484 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:10,484 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_30|]. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_30| main_~t~0.base (_ bv1 1))) (= (select |v_#valid_30| main_~t~0.base) (_ bv0 1)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (= (bvadd (select |v_#valid_30| main_~a~0.base) (_ bv1 1)) (_ bv0 1))) [2018-11-23 11:05:10,484 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= (select |#valid| main_~t~0.base) (_ bv1 1)) (not (= main_~t~0.base main_~a~0.base))) [2018-11-23 11:05:10,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:05:10,572 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 10 treesize of output 9 [2018-11-23 11:05:10,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:10,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:10,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:05:10,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 11:05:10,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:10,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:10,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:10,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:61 [2018-11-23 11:05:10,781 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:10,781 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_22|, main_~t~0.base, |v_#memory_$Pointer$.offset_21|]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0) main_~p~0.base) (= (store |v_#memory_$Pointer$.offset_21| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_21| main_~a~0.base) .cse0 (_ bv0 32))) |#memory_$Pointer$.offset|) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (not (= main_~t~0.base main_~a~0.base)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_22| main_~a~0.base (store (select |v_#memory_$Pointer$.base_22| main_~a~0.base) .cse0 main_~t~0.base))) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))) [2018-11-23 11:05:10,781 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse2)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse2))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= (_ bv0 32) .cse1) (= (bvadd (select |#valid| .cse0) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset .cse1) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1))))) [2018-11-23 11:05:10,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:10,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-11-23 11:05:10,915 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 18 treesize of output 23 [2018-11-23 11:05:10,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:10,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:11,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:11,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-11-23 11:05:11,039 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 17 [2018-11-23 11:05:11,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:11,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:11,115 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 11 treesize of output 14 [2018-11-23 11:05:11,124 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 14 treesize of output 19 [2018-11-23 11:05:11,126 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:11,131 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:11,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:11,164 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:102, output treesize:80 [2018-11-23 11:05:11,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:11,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:11,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:11,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 11:05:11,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:11,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:11,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:77 [2018-11-23 11:05:11,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 183 [2018-11-23 11:05:11,682 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 22 treesize of output 21 [2018-11-23 11:05:11,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:11,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:11,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:11,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 183 treesize of output 194 [2018-11-23 11:05:12,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-11-23 11:05:12,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:12,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:12,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 52 [2018-11-23 11:05:12,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:12,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2018-11-23 11:05:12,303 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:12,316 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:12,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:12,371 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:209, output treesize:145 [2018-11-23 11:05:12,479 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:12,480 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_23|, |v_#memory_int_27|, main_~t~0.base]. (let ((.cse4 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |v_#memory_$Pointer$.offset_23| main_~a~0.base) .cse4)) (.cse0 (select (select |v_#memory_$Pointer$.base_24| main_~a~0.base) .cse4))) (let ((.cse2 (select |v_#memory_int_27| .cse0)) (.cse1 (bvadd .cse3 (_ bv4 32)))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| .cse0) .cse1)) (= (store |v_#memory_int_27| .cse0 (store .cse2 .cse1 (select (select |#memory_int| .cse0) .cse1))) |#memory_int|) (not (= main_~t~0.base .cse0)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_23| .cse0 (store (select |v_#memory_$Pointer$.offset_23| .cse0) .cse1 (_ bv0 32)))) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv0 32) .cse3) (= (select .cse2 .cse3) (_ bv2 32)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_24| .cse0 (store (select |v_#memory_$Pointer$.base_24| .cse0) .cse1 main_~t~0.base))))))) [2018-11-23 11:05:12,480 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse5 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse5))) (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse5)) (.cse4 (bvadd .cse1 (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| .cse3) .cse4)) (.cse2 (select (select |#memory_$Pointer$.base| .cse3) .cse4))) (and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) .cse0) (= (_ bv0 32) .cse1) (= main_~p~0.offset .cse0) (= main_~p~0.base .cse2) (not (= .cse3 .cse2)) (= (_ bv2 32) (select (select |#memory_int| .cse3) .cse1)) (not (= main_~a~0.base .cse2))))))) [2018-11-23 11:05:12,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:12,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 297 [2018-11-23 11:05:12,771 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 68 treesize of output 1 [2018-11-23 11:05:12,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:12,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:12,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:12,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:13,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 196 [2018-11-23 11:05:13,025 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 68 treesize of output 1 [2018-11-23 11:05:13,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:13,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:13,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:13,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 101 [2018-11-23 11:05:13,121 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 64 treesize of output 62 [2018-11-23 11:05:13,123 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:13,140 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:13,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:13,169 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:306, output treesize:96 [2018-11-23 11:05:14,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:14,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2018-11-23 11:05:14,393 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 37 treesize of output 21 [2018-11-23 11:05:14,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:14,534 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 47 treesize of output 36 [2018-11-23 11:05:14,549 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:14,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:14,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:14,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:14,597 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 40 treesize of output 40 [2018-11-23 11:05:14,628 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2018-11-23 11:05:14,654 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 11:05:14,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2018-11-23 11:05:14,715 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 11:05:14,730 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 26 treesize of output 19 [2018-11-23 11:05:14,732 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:14,764 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:05:14,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 11:05:14,803 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:102, output treesize:63 [2018-11-23 11:05:14,818 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:14,819 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_34, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_34) (_ bv4 32)))) (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_34) (_ bv4 32))) (.cse3 (bvadd .cse0 (_ bv4 32)))) (let ((.cse2 (select (select |#memory_$Pointer$.offset| .cse1) .cse3))) (and (= main_~p~0.offset .cse0) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_34) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= .cse1 main_~p~0.base) (= (_ bv0 32) .cse0) (= (bvadd (select (select |#memory_int| .cse1) .cse0) (_ bv4294967294 32)) (_ bv0 32)) (= .cse2 (_ bv0 32)) (= (_ bv0 32) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| .cse1) .cse3)) .cse2) (_ bv4294967293 32))))))) [2018-11-23 11:05:14,819 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_8, v_prenex_9, v_main_~p~0.base_34, v_arrayElimCell_54]. (let ((.cse0 (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)))) (.cse1 (= main_~p~0.offset (_ bv0 32)))) (or (and (= (_ bv0 32) (bvadd (select (select |#memory_int| v_prenex_8) (_ bv0 32)) (_ bv4294967293 32))) .cse0 (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) .cse1) (and .cse0 (= (bvadd (select (select |#memory_int| v_main_~p~0.base_34) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) .cse1 (= (_ bv0 32) (bvadd (select (select |#memory_int| v_arrayElimCell_54) (_ bv0 32)) (_ bv4294967293 32)))))) [2018-11-23 11:05:15,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:15,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:15,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:15,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:15,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:15,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:15,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 49 [2018-11-23 11:05:15,105 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 14 treesize of output 37 [2018-11-23 11:05:15,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:15,162 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 13 treesize of output 5 [2018-11-23 11:05:15,164 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:15,189 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:05:15,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:15,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:15,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:15,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2018-11-23 11:05:15,225 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:15,226 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_prenex_8, v_prenex_9]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd .cse0 (_ bv4294967294 32)) (_ bv0 32)) (= .cse0 |main_#t~mem6|) (= (_ bv3 32) (select (select |#memory_int| v_prenex_8) (_ bv0 32))) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:05:15,226 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem6| (_ bv4294967294 32))) [2018-11-23 11:05:15,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {1289#true} call ULTIMATE.init(); {1289#true} is VALID [2018-11-23 11:05:15,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {1289#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1289#true} is VALID [2018-11-23 11:05:15,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {1289#true} assume true; {1289#true} is VALID [2018-11-23 11:05:15,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1289#true} {1289#true} #96#return; {1289#true} is VALID [2018-11-23 11:05:15,262 INFO L256 TraceCheckUtils]: 4: Hoare triple {1289#true} call #t~ret10 := main(); {1289#true} is VALID [2018-11-23 11:05:15,278 INFO L273 TraceCheckUtils]: 5: Hoare triple {1289#true} ~flag~0 := 1bv32;call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1309#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:15,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {1309#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1309#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:15,279 INFO L273 TraceCheckUtils]: 7: Hoare triple {1309#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1316#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:15,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {1316#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1; {1316#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:15,284 INFO L273 TraceCheckUtils]: 9: Hoare triple {1316#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume 0bv32 != ~flag~0;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);~flag~0 := 0bv32; {1316#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:15,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {1316#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {1326#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:15,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {1326#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1326#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:15,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {1326#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1333#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:15,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {1333#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1; {1333#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:15,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {1333#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(0bv32 != ~flag~0);call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);~flag~0 := 1bv32; {1340#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:05:15,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {1340#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {1344#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:05:15,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {1344#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1344#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:05:15,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {1344#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1351#(and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-23 11:05:15,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {1351#(and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1351#(and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-23 11:05:15,316 INFO L273 TraceCheckUtils]: 19: Hoare triple {1351#(and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~flag~0 := 1bv32; {1358#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} is VALID [2018-11-23 11:05:15,318 INFO L273 TraceCheckUtils]: 20: Hoare triple {1358#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1358#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} is VALID [2018-11-23 11:05:15,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {1358#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} assume !!(3bv32 != #t~mem4);havoc #t~mem4; {1358#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} is VALID [2018-11-23 11:05:15,322 INFO L273 TraceCheckUtils]: 22: Hoare triple {1358#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} assume 0bv32 != ~flag~0;~flag~0 := 0bv32;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1368#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem5|) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} is VALID [2018-11-23 11:05:15,324 INFO L273 TraceCheckUtils]: 23: Hoare triple {1368#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem5|) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} assume !(1bv32 != #t~mem5);havoc #t~mem5; {1372#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:15,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {1372#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {1376#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_prenex_8 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| v_prenex_8) (_ bv0 32)))) (exists ((v_prenex_9 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:05:15,330 INFO L273 TraceCheckUtils]: 25: Hoare triple {1376#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_prenex_8 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| v_prenex_8) (_ bv0 32)))) (exists ((v_prenex_9 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32))))} call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1376#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_prenex_8 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| v_prenex_8) (_ bv0 32)))) (exists ((v_prenex_9 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:05:15,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {1376#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_prenex_8 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| v_prenex_8) (_ bv0 32)))) (exists ((v_prenex_9 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32))))} assume !!(3bv32 != #t~mem4);havoc #t~mem4; {1376#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_prenex_8 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| v_prenex_8) (_ bv0 32)))) (exists ((v_prenex_9 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:05:15,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {1376#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_prenex_8 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| v_prenex_8) (_ bv0 32)))) (exists ((v_prenex_9 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32))))} assume !(0bv32 != ~flag~0);~flag~0 := 1bv32;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1386#(= (_ bv2 32) |main_#t~mem6|)} is VALID [2018-11-23 11:05:15,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {1386#(= (_ bv2 32) |main_#t~mem6|)} assume 2bv32 != #t~mem6;havoc #t~mem6; {1290#false} is VALID [2018-11-23 11:05:15,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {1290#false} assume !false; {1290#false} is VALID [2018-11-23 11:05:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:15,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:05:15,679 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:15,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:15,771 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:15,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:15,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:15,829 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:64 [2018-11-23 11:05:16,415 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:16,416 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_25|]. (let ((.cse0 (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))))) (or (not (= |v_#memory_$Pointer$.offset_25| (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_25| main_~p~0.base) main_~p~0.offset))))) (= (bvadd (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select .cse0 (select (select |v_#memory_$Pointer$.base_26| main_~a~0.base) .cse1)) (select (select |v_#memory_$Pointer$.offset_25| main_~a~0.base) .cse1))) (_ bv4294967294 32)) (_ bv0 32)) (not (= |v_#memory_$Pointer$.base_26| (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.base_26| main_~p~0.base) main_~p~0.offset))))) (not (= (bvadd (select (select .cse0 main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))))) [2018-11-23 11:05:16,416 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_14, v_DerPreprocessor_16]. (let ((.cse0 (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))))) (or (= (bvadd (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select .cse0 (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_14)) main_~a~0.base) .cse1)) (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_16)) main_~a~0.base) .cse1))) (_ bv4294967294 32)) (_ bv0 32)) (not (= (bvadd (select (select .cse0 main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))))) [2018-11-23 11:05:16,923 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-23 11:05:16,961 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:17,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:17,130 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:17,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:17,236 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:17,328 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:17,343 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:17,441 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:18,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-11-23 11:05:18,205 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:122, output treesize:417 [2018-11-23 11:05:20,647 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:20,648 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_DerPreprocessor_14, |v_#memory_int_30|, v_DerPreprocessor_16]. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32))) (.cse1 (store |v_#memory_int_30| main_~t~0.base (store (select |v_#memory_int_30| main_~t~0.base) main_~t~0.offset (_ bv3 32))))) (or (not (= (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) .cse0 (select (select |v_#memory_int_30| main_~p~0.base) .cse0))) |v_#memory_int_30|)) (= (_ bv0 32) (bvadd (let ((.cse3 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select .cse1 (select (select (let ((.cse2 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse0 main_~t~0.base)))) (store .cse2 main_~t~0.base (store (select .cse2 main_~t~0.base) main_~t~0.offset v_DerPreprocessor_14))) main_~a~0.base) .cse3)) (select (select (let ((.cse4 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse0 main_~t~0.offset)))) (store .cse4 main_~t~0.base (store (select .cse4 main_~t~0.base) main_~t~0.offset v_DerPreprocessor_16))) main_~a~0.base) .cse3))) (_ bv4294967294 32))) (not (= (_ bv1 32) (select (select .cse1 main_~a~0.base) main_~a~0.offset))))) [2018-11-23 11:05:20,648 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_14, v_DerPreprocessor_20, v_prenex_15, v_DerPreprocessor_14, v_DerPreprocessor_18, v_DerPreprocessor_16, v_prenex_12, v_DerPreprocessor_22, v_prenex_13, v_prenex_10, v_prenex_11, v_DerPreprocessor_24]. (let ((.cse8 (bvadd main_~p~0.offset (_ bv4 32)))) (let ((.cse4 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse8 main_~t~0.offset))) (.cse1 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse8 main_~t~0.base)))) (let ((.cse6 (= main_~t~0.base main_~a~0.base)) (.cse10 (= main_~a~0.offset main_~t~0.offset)) (.cse2 (select .cse1 main_~t~0.base)) (.cse5 (select .cse4 main_~t~0.base)) (.cse3 (bvadd main_~a~0.offset (_ bv4 32))) (.cse7 (select |#memory_int| main_~p~0.base))) (and (let ((.cse0 (store |#memory_int| main_~p~0.base (store .cse7 .cse8 v_DerPreprocessor_20)))) (or (not (= (bvadd (select (select .cse0 main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv2 32) (select (select .cse0 (select (select (store .cse1 main_~t~0.base (store .cse2 main_~t~0.offset v_prenex_14)) main_~a~0.base) .cse3)) (select (select (store .cse4 main_~t~0.base (store .cse5 main_~t~0.offset v_prenex_15)) main_~a~0.base) .cse3))) .cse6)) (let ((.cse9 (store |#memory_int| main_~p~0.base (store .cse7 .cse8 v_DerPreprocessor_18)))) (or (= (bvadd (select (select .cse9 (select (select (store .cse1 main_~t~0.base (store .cse2 main_~t~0.offset v_DerPreprocessor_14)) main_~a~0.base) .cse3)) (select (select (store .cse4 main_~t~0.base (store .cse5 main_~t~0.offset v_DerPreprocessor_16)) main_~a~0.base) .cse3)) (_ bv4294967294 32)) (_ bv0 32)) .cse10 (not (= (bvadd (select (select .cse9 main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))))) (or (not (= main_~t~0.base (select (select (store .cse1 main_~t~0.base (store .cse2 main_~t~0.offset v_prenex_12)) main_~a~0.base) .cse3))) (not (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store .cse7 .cse8 v_DerPreprocessor_22)) main_~a~0.base) main_~a~0.offset))) (not (= (select (select (store .cse4 main_~t~0.base (store .cse5 main_~t~0.offset v_prenex_13)) main_~a~0.base) .cse3) main_~t~0.offset)) .cse6) (or .cse10 (not (= main_~t~0.base (select (select (store .cse1 main_~t~0.base (store .cse2 main_~t~0.offset v_prenex_10)) main_~a~0.base) .cse3))) (not (= (select (select (store .cse4 main_~t~0.base (store .cse5 main_~t~0.offset v_prenex_11)) main_~a~0.base) .cse3) main_~t~0.offset)) (not (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store .cse7 .cse8 v_DerPreprocessor_24)) main_~a~0.base) main_~a~0.offset)))))))) [2018-11-23 11:05:21,524 WARN L180 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-23 11:05:49,346 WARN L180 SmtUtils]: Spent 19.14 s on a formula simplification that was a NOOP. DAG size: 156 [2018-11-23 11:06:08,542 WARN L180 SmtUtils]: Spent 16.73 s on a formula simplification that was a NOOP. DAG size: 253 [2018-11-23 11:06:08,783 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:06:08,784 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.classInvariant(MultiDimensionalSelect.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.isCompatibleSelect(MultiDimensionalStore.java:105) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.(MultiDimensionalStore.java:73) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.(MultiDimensionalSelectOverStore.java:48) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.convert(MultiDimensionalSelectOverStore.java:75) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:57) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 11:06:08,789 INFO L168 Benchmark]: Toolchain (without parser) took 81960.77 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -973.3 MB). Peak memory consumption was 82.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:08,790 INFO L168 Benchmark]: CDTParser took 0.18 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:06:08,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.44 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.6 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:08,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.40 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:08,791 INFO L168 Benchmark]: Boogie Preprocessor took 62.12 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:06:08,791 INFO L168 Benchmark]: RCFGBuilder took 958.18 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:08,792 INFO L168 Benchmark]: TraceAbstraction took 80076.76 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 337.6 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -232.7 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:08,794 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.18 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 807.44 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.6 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.40 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.12 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 958.18 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80076.76 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 337.6 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -232.7 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...