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/list_flag_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:04:24,085 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:04:24,087 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:04:24,102 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:04:24,102 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:04:24,103 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:04:24,104 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:04:24,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:04:24,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:04:24,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:04:24,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:04:24,110 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:04:24,111 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:04:24,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:04:24,113 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:04:24,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:04:24,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:04:24,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:04:24,119 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:04:24,121 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:04:24,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:04:24,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:04:24,126 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:04:24,126 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:04:24,127 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:04:24,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:04:24,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:04:24,130 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:04:24,130 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:04:24,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:04:24,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:04:24,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:04:24,133 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:04:24,133 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:04:24,134 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:04:24,135 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:04:24,135 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:24,156 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:04:24,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:04:24,157 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:04:24,158 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:04:24,158 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:04:24,158 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:04:24,161 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:04:24,162 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:04:24,162 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:04:24,162 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:04:24,162 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:04:24,162 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:04:24,163 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:04:24,163 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:04:24,163 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:04:24,163 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:04:24,163 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:04:24,164 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:04:24,164 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:04:24,165 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:04:24,165 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:04:24,165 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:04:24,165 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:04:24,165 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:04:24,166 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:04:24,166 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:04:24,166 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:04:24,166 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:04:24,167 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:04:24,167 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:04:24,167 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:04:24,167 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:04:24,167 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:04:24,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:04:24,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:04:24,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:04:24,244 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:04:24,244 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:04:24,245 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_flag_false-unreach-call_false-valid-memcleanup.i [2018-11-23 11:04:24,304 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb34ecf14/250bff80a1b94eeb9f779edec46d1068/FLAG6ee1bd867 [2018-11-23 11:04:24,855 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:04:24,856 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_flag_false-unreach-call_false-valid-memcleanup.i [2018-11-23 11:04:24,878 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb34ecf14/250bff80a1b94eeb9f779edec46d1068/FLAG6ee1bd867 [2018-11-23 11:04:25,112 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb34ecf14/250bff80a1b94eeb9f779edec46d1068 [2018-11-23 11:04:25,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:04:25,130 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:04:25,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:04:25,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:04:25,135 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:04:25,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:04:25" (1/1) ... [2018-11-23 11:04:25,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b66ca10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:25, skipping insertion in model container [2018-11-23 11:04:25,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:04:25" (1/1) ... [2018-11-23 11:04:25,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:04:25,205 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:04:25,657 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:04:25,674 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:04:25,743 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:04:25,810 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:04:25,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:25 WrapperNode [2018-11-23 11:04:25,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:04:25,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:04:25,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:04:25,811 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:04:25,889 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:25" (1/1) ... [2018-11-23 11:04:25,911 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:25" (1/1) ... [2018-11-23 11:04:25,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:04:25,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:04:25,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:04:25,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:04:25,934 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:25" (1/1) ... [2018-11-23 11:04:25,934 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:25" (1/1) ... [2018-11-23 11:04:25,938 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:25" (1/1) ... [2018-11-23 11:04:25,938 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:25" (1/1) ... [2018-11-23 11:04:25,954 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:25" (1/1) ... [2018-11-23 11:04:25,962 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:25" (1/1) ... [2018-11-23 11:04:25,964 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:25" (1/1) ... [2018-11-23 11:04:25,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:04:25,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:04:25,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:04:25,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:04:25,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:04:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:04:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:04:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:04:26,030 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:04:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:04:26,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:04:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:04:26,031 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:04:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:04:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:04:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:04:26,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:04:26,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:04:26,800 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:04:26,800 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:04:26,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:04:26 BoogieIcfgContainer [2018-11-23 11:04:26,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:04:26,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:04:26,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:04:26,805 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:04:26,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:04:25" (1/3) ... [2018-11-23 11:04:26,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35637f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:04:26, skipping insertion in model container [2018-11-23 11:04:26,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:04:25" (2/3) ... [2018-11-23 11:04:26,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35637f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:04:26, skipping insertion in model container [2018-11-23 11:04:26,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:04:26" (3/3) ... [2018-11-23 11:04:26,809 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag_false-unreach-call_false-valid-memcleanup.i [2018-11-23 11:04:26,819 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:04:26,828 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:04:26,846 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:04:26,879 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:04:26,880 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:04:26,880 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:04:26,880 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:04:26,881 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:04:26,881 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:04:26,881 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:04:26,881 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:04:26,882 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:04:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 11:04:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:04:26,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:04:26,909 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:26,911 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:04:26,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:04:26,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1520396253, now seen corresponding path program 1 times [2018-11-23 11:04:26,923 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:04:26,924 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:26,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:04:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:27,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:04:27,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 11:04:27,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {34#true} is VALID [2018-11-23 11:04:27,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 11:04:27,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #90#return; {34#true} is VALID [2018-11-23 11:04:27,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret10 := main(); {34#true} is VALID [2018-11-23 11:04:27,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} ~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {34#true} is VALID [2018-11-23 11:04:27,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {34#true} is VALID [2018-11-23 11:04:27,181 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {34#true} is VALID [2018-11-23 11:04:27,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {34#true} is VALID [2018-11-23 11:04:27,182 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {34#true} is VALID [2018-11-23 11:04:27,182 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} assume !(0bv32 != ~flag~0); {34#true} is VALID [2018-11-23 11:04:27,183 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 11:04:27,183 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {35#false} is VALID [2018-11-23 11:04:27,183 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume 3bv32 != #t~mem9;havoc #t~mem9; {35#false} is VALID [2018-11-23 11:04:27,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 11:04:27,187 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:27,187 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:04:27,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:04:27,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:04:27,204 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:04:27,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:04:27,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:04:27,288 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:27,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:04:27,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:04:27,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:04:27,299 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 11:04:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:27,463 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2018-11-23 11:04:27,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:04:27,464 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:04:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:04:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:04:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2018-11-23 11:04:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:04:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2018-11-23 11:04:27,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 60 transitions. [2018-11-23 11:04:27,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:27,764 INFO L225 Difference]: With dead ends: 45 [2018-11-23 11:04:27,765 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:04:27,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:04:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:04:27,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:04:27,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:04:27,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:04:27,808 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:04:27,808 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:04:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:27,813 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 11:04:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:04:27,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:27,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:27,814 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:04:27,814 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:04:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:27,818 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 11:04:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:04:27,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:27,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:27,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:04:27,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:04:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:04:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 11:04:27,825 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2018-11-23 11:04:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:04:27,825 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 11:04:27,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:04:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 11:04:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:04:27,826 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:04:27,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:04:27,827 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:04:27,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:04:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash -119002668, now seen corresponding path program 1 times [2018-11-23 11:04:27,828 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:04:27,828 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:27,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:04:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:27,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:04:28,406 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:28,454 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:28,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:28,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:28,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:28,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:04:28,748 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 17 treesize of output 13 [2018-11-23 11:04:28,767 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:28,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:28,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:28,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:28,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:04:28,818 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:04:28,818 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd .cse0 (_ bv4294967293 32)) (_ bv0 32)) (= .cse0 |main_#t~mem9|))) [2018-11-23 11:04:28,818 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem9| (_ bv4294967293 32))) [2018-11-23 11:04:28,840 INFO L256 TraceCheckUtils]: 0: Hoare triple {214#true} call ULTIMATE.init(); {214#true} is VALID [2018-11-23 11:04:28,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {214#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {214#true} is VALID [2018-11-23 11:04:28,841 INFO L273 TraceCheckUtils]: 2: Hoare triple {214#true} assume true; {214#true} is VALID [2018-11-23 11:04:28,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {214#true} {214#true} #90#return; {214#true} is VALID [2018-11-23 11:04:28,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {214#true} call #t~ret10 := main(); {214#true} is VALID [2018-11-23 11:04:28,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {214#true} ~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {234#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:04:28,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {234#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {234#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:04:28,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {234#(= main_~a~0.offset (_ bv0 32))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {241#(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:28,889 INFO L273 TraceCheckUtils]: 8: Hoare triple {241#(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~nondet2);havoc #t~nondet2; {241#(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:28,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {241#(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; {248#(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:28,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {248#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(0bv32 != ~flag~0); {248#(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:28,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {248#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {248#(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:28,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {248#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {248#(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:28,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {248#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {261#(= (_ bv3 32) |main_#t~mem9|)} is VALID [2018-11-23 11:04:28,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {261#(= (_ bv3 32) |main_#t~mem9|)} assume 3bv32 != #t~mem9;havoc #t~mem9; {215#false} is VALID [2018-11-23 11:04:28,897 INFO L273 TraceCheckUtils]: 15: Hoare triple {215#false} assume !false; {215#false} is VALID [2018-11-23 11:04:28,900 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:28,900 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:04:28,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:04:28,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:04:28,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:04:28,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:04:28,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:04:29,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:29,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:04:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:04:29,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:04:29,002 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-23 11:04:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:29,943 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 11:04:29,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:04:29,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:04:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:04:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:04:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-23 11:04:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:04:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-23 11:04:29,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2018-11-23 11:04:30,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:30,063 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:04:30,063 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:04:30,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:04:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:04:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-11-23 11:04:30,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:04:30,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 30 states. [2018-11-23 11:04:30,092 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 30 states. [2018-11-23 11:04:30,092 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 30 states. [2018-11-23 11:04:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:30,096 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 11:04:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:04:30,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:30,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:30,098 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 42 states. [2018-11-23 11:04:30,098 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 42 states. [2018-11-23 11:04:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:30,105 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 11:04:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 11:04:30,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:30,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:30,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:04:30,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:04:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:04:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-23 11:04:30,109 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2018-11-23 11:04:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:04:30,109 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-23 11:04:30,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:04:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-23 11:04:30,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:04:30,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:04:30,111 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:04:30,111 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:04:30,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:04:30,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1651229327, now seen corresponding path program 1 times [2018-11-23 11:04:30,112 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:04:30,112 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:30,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:04:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:30,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:04:30,283 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:30,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:04:30,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:30,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:30,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:30,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:04:30,367 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 17 treesize of output 13 [2018-11-23 11:04:30,378 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:30,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:30,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:30,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:30,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:04:30,389 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:04:30,389 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd .cse0 (_ bv4294967293 32)) (_ bv0 32)) (= .cse0 |main_#t~mem7|))) [2018-11-23 11:04:30,389 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem7| (_ bv4294967293 32))) [2018-11-23 11:04:30,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2018-11-23 11:04:30,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {453#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {453#true} is VALID [2018-11-23 11:04:30,406 INFO L273 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2018-11-23 11:04:30,406 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #90#return; {453#true} is VALID [2018-11-23 11:04:30,407 INFO L256 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret10 := main(); {453#true} is VALID [2018-11-23 11:04:30,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {453#true} ~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {473#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:04:30,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {473#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {473#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:04:30,411 INFO L273 TraceCheckUtils]: 7: Hoare triple {473#(= main_~a~0.offset (_ bv0 32))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {480#(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:30,412 INFO L273 TraceCheckUtils]: 8: Hoare triple {480#(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~nondet2);havoc #t~nondet2; {480#(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:30,413 INFO L273 TraceCheckUtils]: 9: Hoare triple {480#(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; {487#(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:30,414 INFO L273 TraceCheckUtils]: 10: Hoare triple {487#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(0bv32 != ~flag~0); {487#(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:30,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {487#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {494#(= (_ bv3 32) |main_#t~mem7|)} is VALID [2018-11-23 11:04:30,420 INFO L273 TraceCheckUtils]: 12: Hoare triple {494#(= (_ bv3 32) |main_#t~mem7|)} assume !!(1bv32 == #t~mem7);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {454#false} is VALID [2018-11-23 11:04:30,420 INFO L273 TraceCheckUtils]: 13: Hoare triple {454#false} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {454#false} is VALID [2018-11-23 11:04:30,421 INFO L273 TraceCheckUtils]: 14: Hoare triple {454#false} assume !(1bv32 == #t~mem7);havoc #t~mem7; {454#false} is VALID [2018-11-23 11:04:30,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {454#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {454#false} is VALID [2018-11-23 11:04:30,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {454#false} assume 3bv32 != #t~mem9;havoc #t~mem9; {454#false} is VALID [2018-11-23 11:04:30,422 INFO L273 TraceCheckUtils]: 17: Hoare triple {454#false} assume !false; {454#false} is VALID [2018-11-23 11:04:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:04:30,423 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:04:30,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:04:30,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:04:30,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:04:30,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:04:30,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:04:30,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:30,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:04:30,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:04:30,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:04:30,478 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 6 states. [2018-11-23 11:04:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:31,228 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-23 11:04:31,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:04:31,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:04:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:04:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:04:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-23 11:04:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:04:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2018-11-23 11:04:31,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2018-11-23 11:04:31,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:31,359 INFO L225 Difference]: With dead ends: 48 [2018-11-23 11:04:31,359 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:04:31,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:04:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:04:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2018-11-23 11:04:31,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:04:31,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 28 states. [2018-11-23 11:04:31,389 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 28 states. [2018-11-23 11:04:31,389 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 28 states. [2018-11-23 11:04:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:31,392 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-23 11:04:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-23 11:04:31,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:31,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:31,394 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 40 states. [2018-11-23 11:04:31,394 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 40 states. [2018-11-23 11:04:31,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:31,397 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-23 11:04:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-11-23 11:04:31,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:31,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:31,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:04:31,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:04:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:04:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 11:04:31,400 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2018-11-23 11:04:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:04:31,401 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 11:04:31,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:04:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 11:04:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:04:31,402 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:04:31,402 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:04:31,402 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:04:31,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:04:31,403 INFO L82 PathProgramCache]: Analyzing trace with hash 407487806, now seen corresponding path program 1 times [2018-11-23 11:04:31,403 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:04:31,403 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:04:31,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:04:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:04:31,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:04:31,561 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:31,566 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:31,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:31,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:31,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:31,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:04:31,614 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 17 treesize of output 13 [2018-11-23 11:04:31,624 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:31,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:04:31,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:31,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:04:31,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:04:31,635 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:04:31,635 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd .cse0 (_ bv4294967293 32)) (_ bv0 32)) (= .cse0 |main_#t~mem5|))) [2018-11-23 11:04:31,636 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem5| (_ bv4294967293 32))) [2018-11-23 11:04:31,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {694#true} call ULTIMATE.init(); {694#true} is VALID [2018-11-23 11:04:31,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {694#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {694#true} is VALID [2018-11-23 11:04:31,649 INFO L273 TraceCheckUtils]: 2: Hoare triple {694#true} assume true; {694#true} is VALID [2018-11-23 11:04:31,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {694#true} {694#true} #90#return; {694#true} is VALID [2018-11-23 11:04:31,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {694#true} call #t~ret10 := main(); {694#true} is VALID [2018-11-23 11:04:31,653 INFO L273 TraceCheckUtils]: 5: Hoare triple {694#true} ~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {714#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:04:31,655 INFO L273 TraceCheckUtils]: 6: Hoare triple {714#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {714#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:04:31,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {714#(= main_~a~0.offset (_ bv0 32))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {721#(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:31,656 INFO L273 TraceCheckUtils]: 8: Hoare triple {721#(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~nondet2);havoc #t~nondet2; {721#(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:31,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {721#(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; {728#(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:31,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume 0bv32 != ~flag~0; {728#(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:31,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {728#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {735#(= (_ bv3 32) |main_#t~mem5|)} is VALID [2018-11-23 11:04:31,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {735#(= (_ bv3 32) |main_#t~mem5|)} assume !!(2bv32 == #t~mem5);havoc #t~mem5;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {695#false} is VALID [2018-11-23 11:04:31,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {695#false} call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {695#false} is VALID [2018-11-23 11:04:31,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {695#false} assume !(2bv32 == #t~mem5);havoc #t~mem5; {695#false} is VALID [2018-11-23 11:04:31,672 INFO L273 TraceCheckUtils]: 15: Hoare triple {695#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {695#false} is VALID [2018-11-23 11:04:31,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {695#false} assume 3bv32 != #t~mem9;havoc #t~mem9; {695#false} is VALID [2018-11-23 11:04:31,672 INFO L273 TraceCheckUtils]: 17: Hoare triple {695#false} assume !false; {695#false} is VALID [2018-11-23 11:04:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:04:31,674 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:04:31,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:04:31,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:04:31,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:04:31,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:04:31,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:04:31,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:31,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:04:31,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:04:31,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:04:31,763 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 6 states. [2018-11-23 11:04:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:32,304 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 11:04:32,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:04:32,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:04:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:04:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:04:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 11:04:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:04:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 11:04:32,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2018-11-23 11:04:32,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:04:32,456 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:04:32,456 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:04:32,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:04:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:04:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2018-11-23 11:04:32,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:04:32,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 24 states. [2018-11-23 11:04:32,507 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 24 states. [2018-11-23 11:04:32,507 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 24 states. [2018-11-23 11:04:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:32,511 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 11:04:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 11:04:32,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:32,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:32,513 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 36 states. [2018-11-23 11:04:32,513 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 36 states. [2018-11-23 11:04:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:04:32,516 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 11:04:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 11:04:32,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:04:32,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:04:32,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:04:32,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:04:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:04:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 11:04:32,518 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2018-11-23 11:04:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:04:32,519 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 11:04:32,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:04:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 11:04:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:04:32,520 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:04:32,520 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, 1] [2018-11-23 11:04:32,520 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:04:32,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:04:32,521 INFO L82 PathProgramCache]: Analyzing trace with hash -786309425, now seen corresponding path program 1 times [2018-11-23 11:04:32,521 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:04:32,521 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:04:32,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:04:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:04:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:04:32,669 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] RET #90#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] ~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !!(0bv32 != #t~nondet2);havoc #t~nondet2; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !(0bv32 != ~flag~0);call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] assume !(0bv32 != #t~nondet2);havoc #t~nondet2; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ 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; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] assume !(0bv32 != ~flag~0); VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32), |main_#t~mem7|=(_ bv2 32)] [?] assume !(1bv32 == #t~mem7);havoc #t~mem7; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32), |main_#t~mem9|=(_ bv2 32)] [?] assume 3bv32 != #t~mem9;havoc #t~mem9; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] assume !false; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0.base, ~p~0.offset; [L628] havoc ~a~0.base, ~a~0.offset; [L628] havoc ~t~0.base, ~t~0.offset; [L629] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32); [L629] ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32] [L630] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32] [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32] [L632-L642] assume !!(0bv32 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32] [L633-L637] assume !(0bv32 != ~flag~0); [L636] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32] [L638] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32); [L638] ~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L639] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L640] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L641] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L641] ~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset; [L641] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L632-L642] assume !(0bv32 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L643] call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32); [L644] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L645-L650] assume !(0bv32 != ~flag~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L649] call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, #t~mem7=2bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L649-L650] assume !(1bv32 == #t~mem7); [L649] havoc #t~mem7; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L651] call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, #t~mem9=2bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L651-L652] assume 3bv32 != #t~mem9; [L651] havoc #t~mem9; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L652] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0.base, ~p~0.offset; [L628] havoc ~a~0.base, ~a~0.offset; [L628] havoc ~t~0.base, ~t~0.offset; [L629] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32); [L629] ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32] [L630] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32] [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32] [L632-L642] assume !!(0bv32 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32] [L633-L637] assume !(0bv32 != ~flag~0); [L636] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32] [L638] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32); [L638] ~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L639] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L640] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L641] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L641] ~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset; [L641] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L632-L642] assume !(0bv32 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L643] call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32); [L644] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L645-L650] assume !(0bv32 != ~flag~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L649] call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, #t~mem7=2bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L649-L650] assume !(1bv32 == #t~mem7); [L649] havoc #t~mem7; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L651] call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, #t~mem9=2bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L651-L652] assume 3bv32 != #t~mem9; [L651] havoc #t~mem9; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L652] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8bv32); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L630] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L632-L642] COND FALSE !(!(0bv32 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L633-L637] COND FALSE !(0bv32 != ~flag~0) [L636] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8bv32); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L642] COND TRUE !(0bv32 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] FCALL call write~intINTTYPE4(3bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L645-L650] COND FALSE !(0bv32 != ~flag~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem7=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649-L650] COND TRUE !(1bv32 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] FCALL call #t~mem9 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem9=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] COND TRUE 3bv32 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L652] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8bv32); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L630] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L632-L642] COND FALSE !(!(0bv32 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L633-L637] COND FALSE !(0bv32 != ~flag~0) [L636] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8bv32); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L642] COND TRUE !(0bv32 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] FCALL call write~intINTTYPE4(3bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L645-L650] COND FALSE !(0bv32 != ~flag~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem7=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649-L650] COND TRUE !(1bv32 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] FCALL call #t~mem9 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem9=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] COND TRUE 3bv32 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L652] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8bv32); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L630] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L632-L642] COND FALSE !(!(0bv32 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L633-L637] COND FALSE !(0bv32 != ~flag~0) [L636] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8bv32); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L642] COND TRUE !(0bv32 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] FCALL call write~intINTTYPE4(3bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L645-L650] COND FALSE !(0bv32 != ~flag~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem7=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649-L650] COND TRUE !(1bv32 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] FCALL call #t~mem9 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem9=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] COND TRUE 3bv32 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L652] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8bv32); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L630] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L632-L642] COND FALSE !(!(0bv32 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L633-L637] COND FALSE !(0bv32 != ~flag~0) [L636] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8bv32); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L642] COND TRUE !(0bv32 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] FCALL call write~intINTTYPE4(3bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L645-L650] COND FALSE !(0bv32 != ~flag~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem7=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649-L650] COND TRUE !(1bv32 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] FCALL call #t~mem9 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem9=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] COND TRUE 3bv32 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L652] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L627] int flag = __VERIFIER_nondet_int(); [L628] List p, a, t; [L629] a = (List) malloc(sizeof(struct node)) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={-2130574328:0}] [L630] COND FALSE !(a == 0) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={-2130574328:0}] [L631] p = a VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L636] p->h = 2 VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}] [L638] t = (List) malloc(sizeof(struct node)) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] [L639] COND FALSE !(t == 0) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] [L640] p->n = t [L641] EXPR p->n [L641] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L643] p->h = 3 [L644] p = a VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] [L645] COND FALSE !(\read(flag)) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] [L649] EXPR p->h VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, p->h=2, t={1:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, p->h=2, t={1:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] ----- [2018-11-23 11:04:32,802 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-23 11:04:32,802 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 11:04:32,802 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:04:32,802 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:04:32,802 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:04:32,802 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2018-11-23 11:04:32,803 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:04:32,803 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:04:32,803 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:04:32,803 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2018-11-23 11:04:32,803 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2018-11-23 11:04:32,803 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:04:32,804 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:04:32,804 WARN L170 areAnnotationChecker]: L630-1 has no Hoare annotation [2018-11-23 11:04:32,804 WARN L170 areAnnotationChecker]: L630-1 has no Hoare annotation [2018-11-23 11:04:32,804 WARN L170 areAnnotationChecker]: L630-3 has no Hoare annotation [2018-11-23 11:04:32,804 WARN L170 areAnnotationChecker]: L632-2 has no Hoare annotation [2018-11-23 11:04:32,804 WARN L170 areAnnotationChecker]: L632-2 has no Hoare annotation [2018-11-23 11:04:32,804 WARN L170 areAnnotationChecker]: L632-2 has no Hoare annotation [2018-11-23 11:04:32,804 WARN L170 areAnnotationChecker]: L632-3 has no Hoare annotation [2018-11-23 11:04:32,805 WARN L170 areAnnotationChecker]: L633 has no Hoare annotation [2018-11-23 11:04:32,805 WARN L170 areAnnotationChecker]: L633 has no Hoare annotation [2018-11-23 11:04:32,805 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2018-11-23 11:04:32,805 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2018-11-23 11:04:32,805 WARN L170 areAnnotationChecker]: L633-2 has no Hoare annotation [2018-11-23 11:04:32,805 WARN L170 areAnnotationChecker]: L646-3 has no Hoare annotation [2018-11-23 11:04:32,805 WARN L170 areAnnotationChecker]: L646-3 has no Hoare annotation [2018-11-23 11:04:32,805 WARN L170 areAnnotationChecker]: L649-3 has no Hoare annotation [2018-11-23 11:04:32,806 WARN L170 areAnnotationChecker]: L649-3 has no Hoare annotation [2018-11-23 11:04:32,806 WARN L170 areAnnotationChecker]: L639 has no Hoare annotation [2018-11-23 11:04:32,806 WARN L170 areAnnotationChecker]: L639 has no Hoare annotation [2018-11-23 11:04:32,806 WARN L170 areAnnotationChecker]: L649-4 has no Hoare annotation [2018-11-23 11:04:32,806 WARN L170 areAnnotationChecker]: L646-1 has no Hoare annotation [2018-11-23 11:04:32,806 WARN L170 areAnnotationChecker]: L646-1 has no Hoare annotation [2018-11-23 11:04:32,806 WARN L170 areAnnotationChecker]: L649-1 has no Hoare annotation [2018-11-23 11:04:32,807 WARN L170 areAnnotationChecker]: L649-1 has no Hoare annotation [2018-11-23 11:04:32,807 WARN L170 areAnnotationChecker]: L639-1 has no Hoare annotation [2018-11-23 11:04:32,807 WARN L170 areAnnotationChecker]: L639-1 has no Hoare annotation [2018-11-23 11:04:32,807 WARN L170 areAnnotationChecker]: L639-3 has no Hoare annotation [2018-11-23 11:04:32,807 WARN L170 areAnnotationChecker]: L651 has no Hoare annotation [2018-11-23 11:04:32,807 WARN L170 areAnnotationChecker]: L651 has no Hoare annotation [2018-11-23 11:04:32,807 WARN L170 areAnnotationChecker]: L652 has no Hoare annotation [2018-11-23 11:04:32,807 WARN L170 areAnnotationChecker]: L652 has no Hoare annotation [2018-11-23 11:04:32,808 WARN L170 areAnnotationChecker]: L651-2 has no Hoare annotation [2018-11-23 11:04:32,808 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:04:32,808 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:04:32,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:04:32 BoogieIcfgContainer [2018-11-23 11:04:32,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:04:32,812 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:04:32,812 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:04:32,812 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:04:32,813 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:04:26" (3/4) ... [2018-11-23 11:04:32,816 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] RET #90#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] ~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !!(0bv32 != #t~nondet2);havoc #t~nondet2; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] assume !(0bv32 != ~flag~0);call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32)] [?] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] assume !(0bv32 != #t~nondet2);havoc #t~nondet2; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ 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; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] assume !(0bv32 != ~flag~0); VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32), |main_#t~mem7|=(_ bv2 32)] [?] assume !(1bv32 == #t~mem7);havoc #t~mem7; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32), |main_#t~mem9|=(_ bv2 32)] [?] assume 3bv32 != #t~mem9;havoc #t~mem9; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] assume !false; VAL [main_~a~0.base=(_ bv2164392968 32), main_~a~0.offset=(_ bv0 32), main_~flag~0=(_ bv0 32), main_~p~0.base=(_ bv2164392968 32), main_~p~0.offset=(_ bv0 32), main_~t~0.base=(_ bv1 32), main_~t~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc1.base|=(_ bv2164392968 32), |main_#t~malloc1.offset|=(_ bv0 32), |main_#t~malloc3.base|=(_ bv1 32), |main_#t~malloc3.offset|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0.base, ~p~0.offset; [L628] havoc ~a~0.base, ~a~0.offset; [L628] havoc ~t~0.base, ~t~0.offset; [L629] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32); [L629] ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32] [L630] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32] [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32] [L632-L642] assume !!(0bv32 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32] [L633-L637] assume !(0bv32 != ~flag~0); [L636] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32] [L638] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32); [L638] ~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L639] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L640] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L641] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L641] ~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset; [L641] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L632-L642] assume !(0bv32 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L643] call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32); [L644] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L645-L650] assume !(0bv32 != ~flag~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L649] call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, #t~mem7=2bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L649-L650] assume !(1bv32 == #t~mem7); [L649] havoc #t~mem7; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L651] call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, #t~mem9=2bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L651-L652] assume 3bv32 != #t~mem9; [L651] havoc #t~mem9; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L652] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0.base, ~p~0.offset; [L628] havoc ~a~0.base, ~a~0.offset; [L628] havoc ~t~0.base, ~t~0.offset; [L629] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32); [L629] ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32] [L630] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32] [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32] [L632-L642] assume !!(0bv32 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32] [L633-L637] assume !(0bv32 != ~flag~0); [L636] call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32] [L638] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32); [L638] ~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L639] assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L640] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L641] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L641] ~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset; [L641] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L632-L642] assume !(0bv32 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L643] call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32); [L644] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L645-L650] assume !(0bv32 != ~flag~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L649] call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, #t~mem7=2bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L649-L650] assume !(1bv32 == #t~mem7); [L649] havoc #t~mem7; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L651] call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, #t~mem9=2bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L651-L652] assume 3bv32 != #t~mem9; [L651] havoc #t~mem9; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [L652] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc1.base=2164392968bv32, #t~malloc1.offset=0bv32, #t~malloc3.base=1bv32, #t~malloc3.offset=0bv32, ~a~0.base=2164392968bv32, ~a~0.offset=0bv32, ~flag~0=0bv32, ~p~0.base=2164392968bv32, ~p~0.offset=0bv32, ~t~0.base=1bv32, ~t~0.offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8bv32); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L630] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L632-L642] COND FALSE !(!(0bv32 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L633-L637] COND FALSE !(0bv32 != ~flag~0) [L636] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8bv32); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L642] COND TRUE !(0bv32 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] FCALL call write~intINTTYPE4(3bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L645-L650] COND FALSE !(0bv32 != ~flag~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem7=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649-L650] COND TRUE !(1bv32 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] FCALL call #t~mem9 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem9=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] COND TRUE 3bv32 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L652] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8bv32); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L630] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L632-L642] COND FALSE !(!(0bv32 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L633-L637] COND FALSE !(0bv32 != ~flag~0) [L636] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8bv32); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L642] COND TRUE !(0bv32 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] FCALL call write~intINTTYPE4(3bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L645-L650] COND FALSE !(0bv32 != ~flag~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem7=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649-L650] COND TRUE !(1bv32 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] FCALL call #t~mem9 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem9=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] COND TRUE 3bv32 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L652] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8bv32); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L630] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L632-L642] COND FALSE !(!(0bv32 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L633-L637] COND FALSE !(0bv32 != ~flag~0) [L636] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8bv32); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L642] COND TRUE !(0bv32 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] FCALL call write~intINTTYPE4(3bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L645-L650] COND FALSE !(0bv32 != ~flag~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem7=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649-L650] COND TRUE !(1bv32 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] FCALL call #t~mem9 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem9=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] COND TRUE 3bv32 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L652] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8bv32); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L630] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L632-L642] COND FALSE !(!(0bv32 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L633-L637] COND FALSE !(0bv32 != ~flag~0) [L636] FCALL call write~intINTTYPE4(2bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8bv32); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L639] COND FALSE !(~t~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L632-L642] COND TRUE !(0bv32 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L643] FCALL call write~intINTTYPE4(3bv32, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L645-L650] COND FALSE !(0bv32 != ~flag~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem7=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L649-L650] COND TRUE !(1bv32 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] FCALL call #t~mem9 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, #t~mem9=2bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L651] COND TRUE 3bv32 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L652] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc1!base=2164392968bv32, #t~malloc1!offset=0bv32, #t~malloc3!base=1bv32, #t~malloc3!offset=0bv32, ~a~0!base=2164392968bv32, ~a~0!offset=0bv32, ~flag~0=0bv32, ~p~0!base=2164392968bv32, ~p~0!offset=0bv32, ~t~0!base=1bv32, ~t~0!offset=0bv32] [L627] int flag = __VERIFIER_nondet_int(); [L628] List p, a, t; [L629] a = (List) malloc(sizeof(struct node)) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={-2130574328:0}] [L630] COND FALSE !(a == 0) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={-2130574328:0}] [L631] p = a VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L636] p->h = 2 VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}] [L638] t = (List) malloc(sizeof(struct node)) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] [L639] COND FALSE !(t == 0) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] [L640] p->n = t [L641] EXPR p->n [L641] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L643] p->h = 3 [L644] p = a VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] [L645] COND FALSE !(\read(flag)) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] [L649] EXPR p->h VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, p->h=2, t={1:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, p->h=2, t={1:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] ----- [2018-11-23 11:04:32,942 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-properties/list_flag_false-unreach-call_false-valid-memcleanup.i-witness.graphml [2018-11-23 11:04:32,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:04:32,944 INFO L168 Benchmark]: Toolchain (without parser) took 7814.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -349.5 MB). Peak memory consumption was 384.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:32,947 INFO L168 Benchmark]: CDTParser took 0.22 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:04:32,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 679.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:32,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:32,954 INFO L168 Benchmark]: Boogie Preprocessor took 45.18 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:04:32,954 INFO L168 Benchmark]: RCFGBuilder took 832.59 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:32,955 INFO L168 Benchmark]: TraceAbstraction took 6009.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 384.3 MB). Peak memory consumption was 384.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:32,956 INFO L168 Benchmark]: Witness Printer took 130.56 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:04:32,964 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.22 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 679.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 111.78 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.18 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 832.59 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6009.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 384.3 MB). Peak memory consumption was 384.3 MB. Max. memory is 7.1 GB. * Witness Printer took 130.56 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] int flag = __VERIFIER_nondet_int(); [L628] List p, a, t; [L629] a = (List) malloc(sizeof(struct node)) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={-2130574328:0}] [L630] COND FALSE !(a == 0) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={-2130574328:0}] [L631] p = a VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L636] p->h = 2 VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}] [L638] t = (List) malloc(sizeof(struct node)) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] [L639] COND FALSE !(t == 0) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] [L640] p->n = t [L641] EXPR p->n [L641] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L643] p->h = 3 [L644] p = a VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] [L645] COND FALSE !(\read(flag)) VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] [L649] EXPR p->h VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, p->h=2, t={1:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, p->h=2, t={1:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={-2130574328:0}, flag=0, malloc(sizeof(struct node))={1:0}, malloc(sizeof(struct node))={-2130574328:0}, p={-2130574328:0}, t={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. UNSAFE Result, 5.9s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 91 SDtfs, 117 SDslu, 156 SDs, 0 SdLazy, 142 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 36 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 3711 SizeOfPredicates, 22 NumberOfNonLiveVariables, 199 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...