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-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:10:00,953 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:10:00,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:10:00,969 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:10:00,969 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:10:00,970 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:10:00,972 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:10:00,973 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:10:00,975 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:10:00,976 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:10:00,977 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:10:00,977 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:10:00,978 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:10:00,979 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:10:00,980 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:10:00,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:10:00,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:10:00,984 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:10:00,986 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:10:00,988 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:10:00,989 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:10:00,991 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:10:00,996 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:10:00,997 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:10:00,997 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:10:00,998 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:10:00,999 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:10:01,000 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:10:01,001 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:10:01,002 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:10:01,003 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:10:01,003 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:10:01,004 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:10:01,005 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:10:01,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:10:01,007 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:10:01,008 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:10:01,036 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:10:01,036 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:10:01,037 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:10:01,037 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:10:01,038 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:10:01,038 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:10:01,039 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:10:01,039 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:10:01,039 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:10:01,039 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:10:01,039 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:10:01,040 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:10:01,040 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:10:01,040 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:10:01,040 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:10:01,040 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:10:01,041 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:10:01,042 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:10:01,042 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:10:01,042 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:10:01,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:10:01,043 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:10:01,043 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:10:01,043 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:10:01,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:10:01,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:10:01,044 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:10:01,044 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:10:01,044 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:10:01,044 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:10:01,045 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:10:01,045 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:10:01,045 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:10:01,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:10:01,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:10:01,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:10:01,132 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:10:01,133 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:10:01,134 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-23 11:10:01,207 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28b851cf/5d35b505251f44c18c0cc3f2ad54d09c/FLAG6309a44ab [2018-11-23 11:10:01,814 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:10:01,815 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-23 11:10:01,827 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28b851cf/5d35b505251f44c18c0cc3f2ad54d09c/FLAG6309a44ab [2018-11-23 11:10:02,099 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28b851cf/5d35b505251f44c18c0cc3f2ad54d09c [2018-11-23 11:10:02,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:10:02,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:10:02,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:10:02,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:10:02,115 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:10:02,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:10:02" (1/1) ... [2018-11-23 11:10:02,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3440e0e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:02, skipping insertion in model container [2018-11-23 11:10:02,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:10:02" (1/1) ... [2018-11-23 11:10:02,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:10:02,188 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:10:02,678 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:10:02,698 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:10:02,857 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:10:02,917 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:10:02,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:02 WrapperNode [2018-11-23 11:10:02,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:10:02,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:10:02,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:10:02,919 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:10:02,929 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:10:02" (1/1) ... [2018-11-23 11:10:02,956 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:10:02" (1/1) ... [2018-11-23 11:10:02,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:10:02,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:10:02,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:10:02,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:10:02,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:02" (1/1) ... [2018-11-23 11:10:02,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:02" (1/1) ... [2018-11-23 11:10:02,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:02" (1/1) ... [2018-11-23 11:10:02,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:02" (1/1) ... [2018-11-23 11:10:03,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:02" (1/1) ... [2018-11-23 11:10:03,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:02" (1/1) ... [2018-11-23 11:10:03,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:02" (1/1) ... [2018-11-23 11:10:03,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:10:03,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:10:03,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:10:03,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:10:03,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:02" (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:10:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:10:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:10:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:10:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:10:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:10:03,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:10:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:10:03,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:10:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:10:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:10:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:10:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:10:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:10:03,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:10:04,040 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:10:04,041 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:10:04,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:10:04 BoogieIcfgContainer [2018-11-23 11:10:04,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:10:04,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:10:04,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:10:04,046 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:10:04,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:10:02" (1/3) ... [2018-11-23 11:10:04,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7b0888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:10:04, skipping insertion in model container [2018-11-23 11:10:04,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:02" (2/3) ... [2018-11-23 11:10:04,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7b0888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:10:04, skipping insertion in model container [2018-11-23 11:10:04,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:10:04" (3/3) ... [2018-11-23 11:10:04,051 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i [2018-11-23 11:10:04,062 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:10:04,072 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:10:04,091 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:10:04,125 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:10:04,126 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:10:04,126 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:10:04,126 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:10:04,126 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:10:04,126 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:10:04,126 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:10:04,127 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:10:04,127 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:10:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 11:10:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:10:04,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:04,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:04,166 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:04,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:04,173 INFO L82 PathProgramCache]: Analyzing trace with hash -258183886, now seen corresponding path program 1 times [2018-11-23 11:10:04,178 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:04,178 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:10:04,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:04,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:04,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 11:10:04,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {31#true} is VALID [2018-11-23 11:10:04,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 11:10:04,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #78#return; {31#true} is VALID [2018-11-23 11:10:04,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2018-11-23 11:10:04,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {31#true} is VALID [2018-11-23 11:10:04,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {31#true} is VALID [2018-11-23 11:10:04,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0bv32; {31#true} is VALID [2018-11-23 11:10:04,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-23 11:10:04,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} call write~intINTTYPE4(~i~0, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0bv32; {32#false} is VALID [2018-11-23 11:10:04,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {32#false} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {32#false} is VALID [2018-11-23 11:10:04,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} assume 1bv32 != #t~mem5;havoc #t~mem5; {32#false} is VALID [2018-11-23 11:10:04,326 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 11:10:04,330 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:10:04,330 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:10:04,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:04,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:10:04,347 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:10:04,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:04,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:10:04,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:04,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:10:04,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:10:04,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:10:04,416 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-23 11:10:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:04,556 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2018-11-23 11:10:04,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:10:04,556 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:10:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:10:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2018-11-23 11:10:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:10:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2018-11-23 11:10:04,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 53 transitions. [2018-11-23 11:10:04,853 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:10:04,863 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:10:04,863 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:10:04,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:10:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:10:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:10:04,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:04,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:04,927 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:04,927 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:04,930 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:10:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:10:04,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:04,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:04,931 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:04,932 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:04,935 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:10:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:10:04,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:04,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:04,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:04,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:10:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 11:10:04,941 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2018-11-23 11:10:04,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:04,941 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 11:10:04,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:10:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:10:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:10:04,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:04,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:04,943 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:04,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:04,944 INFO L82 PathProgramCache]: Analyzing trace with hash -269266138, now seen corresponding path program 1 times [2018-11-23 11:10:04,944 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:04,944 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:10:04,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:10:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:10:05,093 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 #78#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0bv32; VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), main_~i~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] assume !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), main_~i~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] call write~intINTTYPE4(~i~0, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0bv32; VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), main_~i~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), main_~i~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~mem5|=(_ bv0 32)] [?] assume 1bv32 != #t~mem5;havoc #t~mem5; VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), main_~i~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] assume !false; VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), main_~i~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.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~ret9 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32] [L629] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L632] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L633-L640] assume !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1); [L633] havoc #t~nondet1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L641] call write~intINTTYPE4(~i~0, ~p~0.base, ~p~0.offset, 4bv32); [L642] call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L643] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L644] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L645-L651] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); [L646] call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~mem5=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L646-L648] assume 1bv32 != #t~mem5; [L646] havoc #t~mem5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L647] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~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~ret9 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32] [L629] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L632] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L633-L640] assume !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1); [L633] havoc #t~nondet1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L641] call write~intINTTYPE4(~i~0, ~p~0.base, ~p~0.offset, 4bv32); [L642] call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L643] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L644] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L645-L651] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); [L646] call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~mem5=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L646-L648] assume 1bv32 != #t~mem5; [L646] havoc #t~mem5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L647] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~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~ret9 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L629] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L633-L640] COND TRUE !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1) [L633] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L641] FCALL call write~intINTTYPE4(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L642] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L645-L651] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L646] FCALL call #t~mem5 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~mem5=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L646] COND TRUE 1bv32 != #t~mem5 [L646] havoc #t~mem5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L647] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~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~ret9 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L629] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L633-L640] COND TRUE !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1) [L633] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L641] FCALL call write~intINTTYPE4(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L642] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L645-L651] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L646] FCALL call #t~mem5 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~mem5=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L646] COND TRUE 1bv32 != #t~mem5 [L646] havoc #t~mem5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L647] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~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~ret9 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L629] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L633-L640] COND TRUE !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1) [L633] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L641] FCALL call write~intINTTYPE4(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L642] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L645-L651] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L646] FCALL call #t~mem5 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~mem5=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L646] COND TRUE 1bv32 != #t~mem5 [L646] havoc #t~mem5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L647] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~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~ret9 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L629] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L633-L640] COND TRUE !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1) [L633] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L641] FCALL call write~intINTTYPE4(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L642] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L645-L651] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L646] FCALL call #t~mem5 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~mem5=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L646] COND TRUE 1bv32 != #t~mem5 [L646] havoc #t~mem5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L647] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L629] COND FALSE !(a == 0) VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L630] List t; [L631] List p = a; [L632] int i = 0; VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}] [L633] COND FALSE !(i < 30 && __VERIFIER_nondet_int()) [L641] p->h = i [L642] p->n = 0 [L643] p = a [L644] i = 0 VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}] [L645] COND TRUE p!=0 [L646] EXPR p->h VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}, p->h=0] [L646] COND TRUE p->h != 1 [L647] __VERIFIER_error() VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}] ----- [2018-11-23 11:10:05,173 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-23 11:10:05,173 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 11:10:05,174 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:10:05,174 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 11:10:05,174 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 11:10:05,174 WARN L170 areAnnotationChecker]: L621 has no Hoare annotation [2018-11-23 11:10:05,174 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:10:05,174 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:10:05,175 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 11:10:05,175 WARN L170 areAnnotationChecker]: L629 has no Hoare annotation [2018-11-23 11:10:05,175 WARN L170 areAnnotationChecker]: L629 has no Hoare annotation [2018-11-23 11:10:05,175 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:10:05,175 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:10:05,175 WARN L170 areAnnotationChecker]: L629-1 has no Hoare annotation [2018-11-23 11:10:05,176 WARN L170 areAnnotationChecker]: L629-1 has no Hoare annotation [2018-11-23 11:10:05,176 WARN L170 areAnnotationChecker]: L629-3 has no Hoare annotation [2018-11-23 11:10:05,176 WARN L170 areAnnotationChecker]: L633-2 has no Hoare annotation [2018-11-23 11:10:05,176 WARN L170 areAnnotationChecker]: L633-2 has no Hoare annotation [2018-11-23 11:10:05,176 WARN L170 areAnnotationChecker]: L633-2 has no Hoare annotation [2018-11-23 11:10:05,176 WARN L170 areAnnotationChecker]: L633-3 has no Hoare annotation [2018-11-23 11:10:05,177 WARN L170 areAnnotationChecker]: L636 has no Hoare annotation [2018-11-23 11:10:05,177 WARN L170 areAnnotationChecker]: L636 has no Hoare annotation [2018-11-23 11:10:05,177 WARN L170 areAnnotationChecker]: L645-2 has no Hoare annotation [2018-11-23 11:10:05,177 WARN L170 areAnnotationChecker]: L645-2 has no Hoare annotation [2018-11-23 11:10:05,177 WARN L170 areAnnotationChecker]: L645-2 has no Hoare annotation [2018-11-23 11:10:05,177 WARN L170 areAnnotationChecker]: L636-1 has no Hoare annotation [2018-11-23 11:10:05,178 WARN L170 areAnnotationChecker]: L636-1 has no Hoare annotation [2018-11-23 11:10:05,178 WARN L170 areAnnotationChecker]: L636-3 has no Hoare annotation [2018-11-23 11:10:05,178 WARN L170 areAnnotationChecker]: L645-3 has no Hoare annotation [2018-11-23 11:10:05,178 WARN L170 areAnnotationChecker]: L646 has no Hoare annotation [2018-11-23 11:10:05,178 WARN L170 areAnnotationChecker]: L646 has no Hoare annotation [2018-11-23 11:10:05,178 WARN L170 areAnnotationChecker]: L654-2 has no Hoare annotation [2018-11-23 11:10:05,179 WARN L170 areAnnotationChecker]: L654-2 has no Hoare annotation [2018-11-23 11:10:05,179 WARN L170 areAnnotationChecker]: L654-2 has no Hoare annotation [2018-11-23 11:10:05,179 WARN L170 areAnnotationChecker]: L647 has no Hoare annotation [2018-11-23 11:10:05,179 WARN L170 areAnnotationChecker]: L647 has no Hoare annotation [2018-11-23 11:10:05,179 WARN L170 areAnnotationChecker]: L646-2 has no Hoare annotation [2018-11-23 11:10:05,179 WARN L170 areAnnotationChecker]: L654-3 has no Hoare annotation [2018-11-23 11:10:05,180 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:10:05,180 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:10:05,180 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:10:05,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:10:05 BoogieIcfgContainer [2018-11-23 11:10:05,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:10:05,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:10:05,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:10:05,183 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:10:05,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:10:04" (3/4) ... [2018-11-23 11:10:05,187 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 #78#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0bv32; VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), main_~i~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] assume !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1; VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), main_~i~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] call write~intINTTYPE4(~i~0, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;~i~0 := 0bv32; VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), main_~i~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), main_~i~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32), |main_#t~mem5|=(_ bv0 32)] [?] assume 1bv32 != #t~mem5;havoc #t~mem5; VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), main_~i~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.offset|=(_ bv0 32)] [?] assume !false; VAL [main_~a~0.base=(_ bv1 32), main_~a~0.offset=(_ bv0 32), main_~i~0=(_ bv0 32), main_~p~0.base=(_ bv1 32), main_~p~0.offset=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~malloc0.base|=(_ bv1 32), |main_#t~malloc0.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~ret9 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32] [L629] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L632] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L633-L640] assume !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1); [L633] havoc #t~nondet1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L641] call write~intINTTYPE4(~i~0, ~p~0.base, ~p~0.offset, 4bv32); [L642] call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L643] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L644] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L645-L651] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); [L646] call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~mem5=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L646-L648] assume 1bv32 != #t~mem5; [L646] havoc #t~mem5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L647] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~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~ret9 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [L628] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32); [L628] ~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32] [L629] assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32] [L630] havoc ~t~0.base, ~t~0.offset; [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L632] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L633-L640] assume !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1); [L633] havoc #t~nondet1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L641] call write~intINTTYPE4(~i~0, ~p~0.base, ~p~0.offset, 4bv32); [L642] call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); [L643] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L644] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L645-L651] assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); [L646] call #t~mem5 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, #t~mem5=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L646-L648] assume 1bv32 != #t~mem5; [L646] havoc #t~mem5; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~0.offset=0bv32] [L647] assert false; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~malloc0.base=1bv32, #t~malloc0.offset=0bv32, ~a~0.base=1bv32, ~a~0.offset=0bv32, ~i~0=0bv32, ~p~0.base=1bv32, ~p~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~ret9 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L629] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L633-L640] COND TRUE !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1) [L633] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L641] FCALL call write~intINTTYPE4(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L642] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L645-L651] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L646] FCALL call #t~mem5 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~mem5=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L646] COND TRUE 1bv32 != #t~mem5 [L646] havoc #t~mem5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L647] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~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~ret9 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L629] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L633-L640] COND TRUE !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1) [L633] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L641] FCALL call write~intINTTYPE4(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L642] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L645-L651] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L646] FCALL call #t~mem5 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~mem5=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L646] COND TRUE 1bv32 != #t~mem5 [L646] havoc #t~mem5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L647] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~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~ret9 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L629] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L633-L640] COND TRUE !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1) [L633] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L641] FCALL call write~intINTTYPE4(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L642] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L645-L651] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L646] FCALL call #t~mem5 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~mem5=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L646] COND TRUE 1bv32 != #t~mem5 [L646] havoc #t~mem5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L647] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~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~ret9 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [L628] FCALL call #t~malloc0 := #Ultimate.alloc(8bv32); [L628] ~a~0 := #t~malloc0; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L629] COND FALSE !(~a~0 == { base: 0bv32, offset: 0bv32 }) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32] [L630] havoc ~t~0; [L631] ~p~0 := ~a~0; [L632] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L633-L640] COND TRUE !(~bvslt32(~i~0, 30bv32) && 0bv32 != #t~nondet1) [L633] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L641] FCALL call write~intINTTYPE4(~i~0, { base: ~p~0!base, offset: ~p~0!offset }, 4bv32); [L642] FCALL call write~$Pointer$({ base: 0bv32, offset: 0bv32 }, { base: ~p~0!base, offset: ~bvadd32(4bv32, ~p~0!offset) }, 4bv32); [L643] ~p~0 := ~a~0; [L644] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L645-L651] COND FALSE !(!(~p~0 != { base: 0bv32, offset: 0bv32 })) [L646] FCALL call #t~mem5 := read~intINTTYPE4({ base: ~p~0!base, offset: ~p~0!offset }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, #t~mem5=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L646] COND TRUE 1bv32 != #t~mem5 [L646] havoc #t~mem5; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L647] assert false; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~malloc0!base=1bv32, #t~malloc0!offset=0bv32, ~a~0!base=1bv32, ~a~0!offset=0bv32, ~i~0=0bv32, ~p~0!base=1bv32, ~p~0!offset=0bv32] [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L629] COND FALSE !(a == 0) VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L630] List t; [L631] List p = a; [L632] int i = 0; VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}] [L633] COND FALSE !(i < 30 && __VERIFIER_nondet_int()) [L641] p->h = i [L642] p->n = 0 [L643] p = a [L644] i = 0 VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}] [L645] COND TRUE p!=0 [L646] EXPR p->h VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}, p->h=0] [L646] COND TRUE p->h != 1 [L647] __VERIFIER_error() VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}] ----- [2018-11-23 11:10:05,250 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-ext-properties/simple-ext_false-unreach-call_false-valid-memcleanup_true-termination.i-witness.graphml [2018-11-23 11:10:05,250 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:10:05,251 INFO L168 Benchmark]: Toolchain (without parser) took 3142.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -668.0 MB). Peak memory consumption was 70.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:05,254 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:10:05,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:05,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.64 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:10:05,256 INFO L168 Benchmark]: Boogie Preprocessor took 83.54 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: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:05,257 INFO L168 Benchmark]: RCFGBuilder took 990.21 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: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:05,257 INFO L168 Benchmark]: TraceAbstraction took 1140.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 85.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:10:05,258 INFO L168 Benchmark]: Witness Printer took 66.96 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:10:05,263 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 807.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -787.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.64 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. * Boogie Preprocessor took 83.54 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: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 990.21 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: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1140.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 85.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. * Witness Printer took 66.96 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 647]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L629] COND FALSE !(a == 0) VAL [a={1:0}, malloc(sizeof(struct node))={1:0}] [L630] List t; [L631] List p = a; [L632] int i = 0; VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}] [L633] COND FALSE !(i < 30 && __VERIFIER_nondet_int()) [L641] p->h = i [L642] p->n = 0 [L643] p = a [L644] i = 0 VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}] [L645] COND TRUE p!=0 [L646] EXPR p->h VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}, p->h=0] [L646] COND TRUE p->h != 1 [L647] __VERIFIER_error() VAL [a={1:0}, i=0, malloc(sizeof(struct node))={1:0}, p={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 49 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...