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_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/1_3_true-termination.c_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:53:28,706 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:53:28,708 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:53:28,721 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:53:28,721 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:53:28,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:53:28,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:53:28,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:53:28,733 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:53:28,734 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:53:28,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:53:28,736 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:53:28,737 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:53:28,739 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:53:28,747 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:53:28,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:53:28,752 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:53:28,753 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:53:28,756 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:53:28,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:53:28,762 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:53:28,764 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:53:28,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:53:28,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:53:28,769 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:53:28,770 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:53:28,771 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:53:28,772 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:53:28,773 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:53:28,775 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:53:28,775 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:53:28,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:53:28,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:53:28,777 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:53:28,778 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:53:28,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:53:28,781 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:53:28,802 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:53:28,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:53:28,803 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:53:28,803 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:53:28,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:53:28,804 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:53:28,804 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:53:28,804 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:53:28,805 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:53:28,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:53:28,805 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:53:28,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:53:28,805 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:53:28,805 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:53:28,806 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:53:28,806 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:53:28,806 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:53:28,806 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:53:28,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:53:28,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:53:28,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:53:28,807 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:53:28,807 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:53:28,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:28,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:53:28,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:53:28,808 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:53:28,808 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:53:28,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:53:28,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:53:28,809 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:53:28,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:53:28,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:53:28,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:53:28,894 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:53:28,894 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:53:28,895 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/1_3_true-termination.c_false-unreach-call.i [2018-11-23 12:53:28,955 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb65dcee7/df8a69b6f555426c9e31837c50e9ed9e/FLAG4b2778fb3 [2018-11-23 12:53:29,412 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:53:29,413 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/1_3_true-termination.c_false-unreach-call.i [2018-11-23 12:53:29,418 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb65dcee7/df8a69b6f555426c9e31837c50e9ed9e/FLAG4b2778fb3 [2018-11-23 12:53:29,775 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb65dcee7/df8a69b6f555426c9e31837c50e9ed9e [2018-11-23 12:53:29,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:53:29,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:53:29,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:29,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:53:29,790 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:53:29,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:29" (1/1) ... [2018-11-23 12:53:29,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3696e133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:29, skipping insertion in model container [2018-11-23 12:53:29,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:29" (1/1) ... [2018-11-23 12:53:29,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:53:29,835 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:53:30,081 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:30,099 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:53:30,133 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:30,157 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:53:30,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30 WrapperNode [2018-11-23 12:53:30,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:30,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:30,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:53:30,159 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:53:30,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30" (1/1) ... [2018-11-23 12:53:30,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30" (1/1) ... [2018-11-23 12:53:30,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:30,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:53:30,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:53:30,194 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:53:30,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30" (1/1) ... [2018-11-23 12:53:30,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30" (1/1) ... [2018-11-23 12:53:30,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30" (1/1) ... [2018-11-23 12:53:30,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30" (1/1) ... [2018-11-23 12:53:30,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30" (1/1) ... [2018-11-23 12:53:30,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30" (1/1) ... [2018-11-23 12:53:30,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30" (1/1) ... [2018-11-23 12:53:30,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:30,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:30,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:30,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:30,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30" (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 12:53:30,417 INFO L130 BoogieDeclarations]: Found specification of procedure freePtr [2018-11-23 12:53:30,417 INFO L138 BoogieDeclarations]: Found implementation of procedure freePtr [2018-11-23 12:53:30,417 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-23 12:53:30,417 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-23 12:53:30,417 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:30,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure getrr [2018-11-23 12:53:30,418 INFO L138 BoogieDeclarations]: Found implementation of procedure getrr [2018-11-23 12:53:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure getPtr [2018-11-23 12:53:30,418 INFO L138 BoogieDeclarations]: Found implementation of procedure getPtr [2018-11-23 12:53:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:53:30,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:30,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:53:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:30,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:53:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:53:30,946 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:53:30,946 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:53:30,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:30 BoogieIcfgContainer [2018-11-23 12:53:30,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:53:30,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:53:30,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:53:30,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:53:30,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:29" (1/3) ... [2018-11-23 12:53:30,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567b2a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:30, skipping insertion in model container [2018-11-23 12:53:30,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:30" (2/3) ... [2018-11-23 12:53:30,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567b2a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:30, skipping insertion in model container [2018-11-23 12:53:30,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:30" (3/3) ... [2018-11-23 12:53:30,955 INFO L112 eAbstractionObserver]: Analyzing ICFG 1_3_true-termination.c_false-unreach-call.i [2018-11-23 12:53:30,966 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:53:30,974 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:53:30,994 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:53:31,036 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:53:31,036 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:53:31,037 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:53:31,037 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:53:31,037 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:53:31,037 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:53:31,038 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:53:31,038 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:53:31,038 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:53:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:53:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:53:31,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:31,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:31,068 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:31,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:31,074 INFO L82 PathProgramCache]: Analyzing trace with hash 546623417, now seen corresponding path program 1 times [2018-11-23 12:53:31,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:31,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:31,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:31,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:31,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:31,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:53:31,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-23 12:53:31,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:53:31,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #35#return; {35#true} is VALID [2018-11-23 12:53:31,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret4 := main(); {35#true} is VALID [2018-11-23 12:53:31,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} ~ptr1~0.base, ~ptr1~0.offset := 0, 0; {35#true} is VALID [2018-11-23 12:53:31,786 INFO L256 TraceCheckUtils]: 6: Hoare triple {35#true} call #t~ret3.base, #t~ret3.offset := getPtr(); {35#true} is VALID [2018-11-23 12:53:31,787 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#true} call #t~ret1.base, #t~ret1.offset := getrr(); {35#true} is VALID [2018-11-23 12:53:31,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4);~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(0, ~r~0.base, ~r~0.offset, 4);#res.base, #res.offset := ~r~0.base, ~r~0.offset; {35#true} is VALID [2018-11-23 12:53:31,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:53:31,788 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {35#true} {35#true} #33#return; {35#true} is VALID [2018-11-23 12:53:31,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#true} ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call write~int(1, ~r~1.base, ~r~1.offset, 4);#res.base, #res.offset := ~r~1.base, ~r~1.offset; {37#(= 1 (select (select |#memory_int| |getPtr_#res.base|) |getPtr_#res.offset|))} is VALID [2018-11-23 12:53:31,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#(= 1 (select (select |#memory_int| |getPtr_#res.base|) |getPtr_#res.offset|))} assume true; {37#(= 1 (select (select |#memory_int| |getPtr_#res.base|) |getPtr_#res.offset|))} is VALID [2018-11-23 12:53:31,805 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {37#(= 1 (select (select |#memory_int| |getPtr_#res.base|) |getPtr_#res.offset|))} {35#true} #39#return; {38#(= 1 (select (select |#memory_int| |main_#t~ret3.base|) |main_#t~ret3.offset|))} is VALID [2018-11-23 12:53:31,811 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#(= 1 (select (select |#memory_int| |main_#t~ret3.base|) |main_#t~ret3.offset|))} ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset; {39#(= 1 (select (select |#memory_int| main_~ptr1~0.base) main_~ptr1~0.offset))} is VALID [2018-11-23 12:53:31,814 INFO L256 TraceCheckUtils]: 15: Hoare triple {39#(= 1 (select (select |#memory_int| main_~ptr1~0.base) main_~ptr1~0.offset))} call freePtr(~ptr1~0.base, ~ptr1~0.offset); {40#(= 1 (select (select |#memory_int| |freePtr_#in~ptr.base|) |freePtr_#in~ptr.offset|))} is VALID [2018-11-23 12:53:31,819 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#(= 1 (select (select |#memory_int| |freePtr_#in~ptr.base|) |freePtr_#in~ptr.offset|))} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); {41#(= 1 |freePtr_#t~mem2|)} is VALID [2018-11-23 12:53:31,820 INFO L273 TraceCheckUtils]: 17: Hoare triple {41#(= 1 |freePtr_#t~mem2|)} assume !(1 == #t~mem2); {36#false} is VALID [2018-11-23 12:53:31,820 INFO L256 TraceCheckUtils]: 18: Hoare triple {36#false} call __blast_assert(); {36#false} is VALID [2018-11-23 12:53:31,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:53:31,826 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 12:53:31,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:31,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:53:31,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 12:53:31,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:31,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:53:31,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:31,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:53:31,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:53:31,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:53:31,909 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 7 states. [2018-11-23 12:53:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:32,938 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-23 12:53:32,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:53:32,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 12:53:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:53:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2018-11-23 12:53:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:53:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2018-11-23 12:53:32,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2018-11-23 12:53:33,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:33,116 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:53:33,116 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:53:33,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:53:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:53:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:53:33,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:33,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:33,230 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:33,230 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:33,235 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-11-23 12:53:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-11-23 12:53:33,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:33,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:33,237 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:33,237 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:53:33,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:33,241 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-11-23 12:53:33,241 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-11-23 12:53:33,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:33,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:33,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:33,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:53:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2018-11-23 12:53:33,248 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 20 [2018-11-23 12:53:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:33,249 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2018-11-23 12:53:33,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:53:33,249 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-11-23 12:53:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:53:33,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:33,251 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:53:33,251 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:33,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:33,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1159927970, now seen corresponding path program 1 times [2018-11-23 12:53:33,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:33,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:33,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:33,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:33,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:53:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:53:33,333 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=7, |#NULL.offset|=5, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] RET #35#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~ptr1~0.base, ~ptr1~0.offset := 0, 0; VAL [main_~ptr1~0.base=0, main_~ptr1~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret1.base, #t~ret1.offset := getrr(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4);~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(0, ~r~0.base, ~r~0.offset, 4);#res.base, #res.offset := ~r~0.base, ~r~0.offset; VAL [getrr_~r~0.base=6, getrr_~r~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getrr_#res.base|=6, |getrr_#res.offset|=0, |getrr_#t~malloc0.base|=6, |getrr_#t~malloc0.offset|=0] [?] assume true; VAL [getrr_~r~0.base=6, getrr_~r~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getrr_#res.base|=6, |getrr_#res.offset|=0, |getrr_#t~malloc0.base|=6, |getrr_#t~malloc0.offset|=0] [?] RET #33#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |getPtr_#t~ret1.base|=6, |getPtr_#t~ret1.offset|=0] [?] ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call write~int(1, ~r~1.base, ~r~1.offset, 4);#res.base, #res.offset := ~r~1.base, ~r~1.offset; VAL [getPtr_~r~1.base=6, getPtr_~r~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getPtr_#res.base|=6, |getPtr_#res.offset|=0] [?] assume true; VAL [getPtr_~r~1.base=6, getPtr_~r~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getPtr_#res.base|=6, |getPtr_#res.offset|=0] [?] RET #39#return; VAL [main_~ptr1~0.base=0, main_~ptr1~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret3.base|=6, |main_#t~ret3.offset|=0] [?] ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset; VAL [main_~ptr1~0.base=6, main_~ptr1~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); VAL [freePtr_~ptr.base=6, freePtr_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0, |freePtr_#t~mem2|=1] [?] assume 1 == #t~mem2; VAL [freePtr_~ptr.base=6, freePtr_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0, |freePtr_#t~mem2|=1] [?] havoc #t~mem2;call write~int(2, ~ptr.base, ~ptr.offset, 4); VAL [freePtr_~ptr.base=6, freePtr_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0] [?] assume true; VAL [freePtr_~ptr.base=6, freePtr_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0] [?] RET #41#return; VAL [main_~ptr1~0.base=6, main_~ptr1~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); VAL [freePtr_~ptr.base=6, freePtr_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0, |freePtr_#t~mem2|=2] [?] assume !(1 == #t~mem2); VAL [freePtr_~ptr.base=6, freePtr_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0, |freePtr_#t~mem2|=2] [?] CALL call __blast_assert(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L51] ~ptr1~0.base, ~ptr1~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~ptr1~0.base=0, ~ptr1~0.offset=0] [L52] CALL call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0, #NULL.offset=0] [L38] CALL call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4); [L31] ~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset; [L32] call write~int(0, ~r~0.base, ~r~0.offset, 4); [L33] #res.base, #res.offset := ~r~0.base, ~r~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, #t~malloc0.base=6, #t~malloc0.offset=0, ~r~0.base=6, ~r~0.offset=0] [L29-L34] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, #t~malloc0.base=6, #t~malloc0.offset=0, ~r~0.base=6, ~r~0.offset=0] [L38] RET call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=6, #t~ret1.offset=0] [L38] ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset; [L38] havoc #t~ret1.base, #t~ret1.offset; [L39] call write~int(1, ~r~1.base, ~r~1.offset, 4); [L40] #res.base, #res.offset := ~r~1.base, ~r~1.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, ~r~1.base=6, ~r~1.offset=0] [L36-L41] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, ~r~1.base=6, ~r~1.offset=0] [L52] RET call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret3.base=6, #t~ret3.offset=0, ~ptr1~0.base=0, ~ptr1~0.offset=0] [L52] ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset; [L52] havoc #t~ret3.base, #t~ret3.offset; VAL [#NULL.base=0, #NULL.offset=0, ~ptr1~0.base=6, ~ptr1~0.offset=0] [L53] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, ~ptr.base=6, ~ptr.offset=0] [L45] assume 1 == #t~mem2; VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, ~ptr.base=6, ~ptr.offset=0] [L45] havoc #t~mem2; [L46] call write~int(2, ~ptr.base, ~ptr.offset, 4); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, ~ptr.base=6, ~ptr.offset=0] [L43-L47] ensures true; VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, ~ptr.base=6, ~ptr.offset=0] [L53] RET call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~ptr1~0.base=6, ~ptr1~0.offset=0] [L55] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=2, ~ptr.base=6, ~ptr.offset=0] [L45] assume !(1 == #t~mem2); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=2, ~ptr.base=6, ~ptr.offset=0] [L45] CALL call __blast_assert(); VAL [#NULL.base=0, #NULL.offset=0] [L6] assert false; VAL [#NULL.base=0, #NULL.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L51] ~ptr1~0.base, ~ptr1~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~ptr1~0.base=0, ~ptr1~0.offset=0] [L52] CALL call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0, #NULL.offset=0] [L38] CALL call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4); [L31] ~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset; [L32] call write~int(0, ~r~0.base, ~r~0.offset, 4); [L33] #res.base, #res.offset := ~r~0.base, ~r~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, #t~malloc0.base=6, #t~malloc0.offset=0, ~r~0.base=6, ~r~0.offset=0] [L29-L34] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, #t~malloc0.base=6, #t~malloc0.offset=0, ~r~0.base=6, ~r~0.offset=0] [L38] RET call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=6, #t~ret1.offset=0] [L38] ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset; [L38] havoc #t~ret1.base, #t~ret1.offset; [L39] call write~int(1, ~r~1.base, ~r~1.offset, 4); [L40] #res.base, #res.offset := ~r~1.base, ~r~1.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, ~r~1.base=6, ~r~1.offset=0] [L36-L41] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, ~r~1.base=6, ~r~1.offset=0] [L52] RET call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret3.base=6, #t~ret3.offset=0, ~ptr1~0.base=0, ~ptr1~0.offset=0] [L52] ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset; [L52] havoc #t~ret3.base, #t~ret3.offset; VAL [#NULL.base=0, #NULL.offset=0, ~ptr1~0.base=6, ~ptr1~0.offset=0] [L53] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, ~ptr.base=6, ~ptr.offset=0] [L45] assume 1 == #t~mem2; VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, ~ptr.base=6, ~ptr.offset=0] [L45] havoc #t~mem2; [L46] call write~int(2, ~ptr.base, ~ptr.offset, 4); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, ~ptr.base=6, ~ptr.offset=0] [L43-L47] ensures true; VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, ~ptr.base=6, ~ptr.offset=0] [L53] RET call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~ptr1~0.base=6, ~ptr1~0.offset=0] [L55] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=2, ~ptr.base=6, ~ptr.offset=0] [L45] assume !(1 == #t~mem2); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=2, ~ptr.base=6, ~ptr.offset=0] [L45] CALL call __blast_assert(); VAL [#NULL.base=0, #NULL.offset=0] [L6] assert false; VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L51] ~ptr1~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~int(0, { base: ~r~0!base, offset: ~r~0!offset }, 4); [L33] #res := ~r~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, #t~malloc0!base=6, #t~malloc0!offset=0, ~r~0!base=6, ~r~0!offset=0] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=6, #t~ret1!offset=0] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~int(1, { base: ~r~1!base, offset: ~r~1!offset }, 4); [L40] #res := ~r~1; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, ~r~1!base=6, ~r~1!offset=0] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret3!base=6, #t~ret3!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] COND TRUE 1 == #t~mem2 VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] havoc #t~mem2; [L46] FCALL call write~int(2, { base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, ~ptr!base=6, ~ptr!offset=0] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] COND FALSE !(1 == #t~mem2) VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0] [L6] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L51] ~ptr1~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~int(0, { base: ~r~0!base, offset: ~r~0!offset }, 4); [L33] #res := ~r~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, #t~malloc0!base=6, #t~malloc0!offset=0, ~r~0!base=6, ~r~0!offset=0] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=6, #t~ret1!offset=0] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~int(1, { base: ~r~1!base, offset: ~r~1!offset }, 4); [L40] #res := ~r~1; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, ~r~1!base=6, ~r~1!offset=0] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret3!base=6, #t~ret3!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] COND TRUE 1 == #t~mem2 VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] havoc #t~mem2; [L46] FCALL call write~int(2, { base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, ~ptr!base=6, ~ptr!offset=0] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] COND FALSE !(1 == #t~mem2) VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0] [L6] assert false; VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L51] ~ptr1~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~int(0, { base: ~r~0!base, offset: ~r~0!offset }, 4); [L33] #res := ~r~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, #t~malloc0!base=6, #t~malloc0!offset=0, ~r~0!base=6, ~r~0!offset=0] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=6, #t~ret1!offset=0] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~int(1, { base: ~r~1!base, offset: ~r~1!offset }, 4); [L40] #res := ~r~1; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, ~r~1!base=6, ~r~1!offset=0] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret3!base=6, #t~ret3!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] COND TRUE 1 == #t~mem2 VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] havoc #t~mem2; [L46] FCALL call write~int(2, { base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, ~ptr!base=6, ~ptr!offset=0] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] COND FALSE !(1 == #t~mem2) VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0] [L6] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L51] ~ptr1~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~int(0, { base: ~r~0!base, offset: ~r~0!offset }, 4); [L33] #res := ~r~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, #t~malloc0!base=6, #t~malloc0!offset=0, ~r~0!base=6, ~r~0!offset=0] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=6, #t~ret1!offset=0] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~int(1, { base: ~r~1!base, offset: ~r~1!offset }, 4); [L40] #res := ~r~1; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, ~r~1!base=6, ~r~1!offset=0] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret3!base=6, #t~ret3!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] COND TRUE 1 == #t~mem2 VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] havoc #t~mem2; [L46] FCALL call write~int(2, { base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, ~ptr!base=6, ~ptr!offset=0] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] COND FALSE !(1 == #t~mem2) VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0] [L6] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L51] rr * ptr1 = 0; VAL [ptr1={0:0}] [L52] CALL, EXPR getPtr() [L38] CALL, EXPR getrr() [L31] rr * r = (rr *)malloc(sizeof *r); [L32] r -> state = 0 [L33] return r; VAL [\result={6:0}, malloc(sizeof *r)={6:0}, r={6:0}] [L38] RET, EXPR getrr() VAL [getrr()={6:0}] [L38] rr * r = getrr(); [L39] r -> state = 1 [L40] return r; VAL [\result={6:0}, r={6:0}] [L52] RET, EXPR getPtr() VAL [getPtr()={6:0}, ptr1={0:0}] [L52] ptr1 = getPtr() [L53] CALL freePtr(ptr1) VAL [ptr={6:0}] [L45] EXPR ptr -> state VAL [ptr={6:0}, ptr={6:0}, ptr -> state=1] [L45] (ptr -> state == 1) ? (0) : __blast_assert () VAL [ptr={6:0}, ptr={6:0}, ptr -> state=1] [L46] ptr -> state = 2 VAL [ptr={6:0}, ptr={6:0}] [L53] RET freePtr(ptr1) VAL [ptr1={6:0}] [L55] CALL freePtr(ptr1) VAL [ptr={6:0}] [L45] EXPR ptr -> state VAL [ptr={6:0}, ptr={6:0}, ptr -> state=2] [L45] (ptr -> state == 1) ? (0) : __blast_assert () VAL [ptr={6:0}, ptr={6:0}, ptr -> state=2] [L45] CALL __blast_assert () [L6] __VERIFIER_error() ----- [2018-11-23 12:53:33,405 WARN L170 areAnnotationChecker]: freePtrENTRY has no Hoare annotation [2018-11-23 12:53:33,405 WARN L170 areAnnotationChecker]: getPtrENTRY has no Hoare annotation [2018-11-23 12:53:33,405 WARN L170 areAnnotationChecker]: getPtrENTRY has no Hoare annotation [2018-11-23 12:53:33,405 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:53:33,406 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 12:53:33,406 WARN L170 areAnnotationChecker]: __blast_assertENTRY has no Hoare annotation [2018-11-23 12:53:33,406 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:53:33,406 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:53:33,406 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:53:33,406 WARN L170 areAnnotationChecker]: getrrENTRY has no Hoare annotation [2018-11-23 12:53:33,406 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 12:53:33,406 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 12:53:33,409 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:53:33,409 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:53:33,409 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 12:53:33,409 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:53:33,409 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:53:33,409 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 12:53:33,410 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 12:53:33,410 WARN L170 areAnnotationChecker]: getrrFINAL has no Hoare annotation [2018-11-23 12:53:33,410 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2018-11-23 12:53:33,410 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2018-11-23 12:53:33,410 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2018-11-23 12:53:33,410 WARN L170 areAnnotationChecker]: getPtrFINAL has no Hoare annotation [2018-11-23 12:53:33,411 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:53:33,411 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 12:53:33,411 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:53:33,411 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2018-11-23 12:53:33,411 WARN L170 areAnnotationChecker]: getrrEXIT has no Hoare annotation [2018-11-23 12:53:33,411 WARN L170 areAnnotationChecker]: freePtrFINAL has no Hoare annotation [2018-11-23 12:53:33,412 WARN L170 areAnnotationChecker]: getPtrEXIT has no Hoare annotation [2018-11-23 12:53:33,412 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-11-23 12:53:33,412 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2018-11-23 12:53:33,412 WARN L170 areAnnotationChecker]: freePtrEXIT has no Hoare annotation [2018-11-23 12:53:33,412 WARN L170 areAnnotationChecker]: freePtrEXIT has no Hoare annotation [2018-11-23 12:53:33,412 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-23 12:53:33,413 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2018-11-23 12:53:33,413 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-23 12:53:33,413 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:53:33,413 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:53:33,413 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 12:53:33,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:53:33 BoogieIcfgContainer [2018-11-23 12:53:33,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:53:33,418 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:53:33,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:53:33,418 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:53:33,419 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:30" (3/4) ... [2018-11-23 12:53:33,422 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|=7, |#NULL.offset|=5, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] RET #35#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~ptr1~0.base, ~ptr1~0.offset := 0, 0; VAL [main_~ptr1~0.base=0, main_~ptr1~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret1.base, #t~ret1.offset := getrr(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4);~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~int(0, ~r~0.base, ~r~0.offset, 4);#res.base, #res.offset := ~r~0.base, ~r~0.offset; VAL [getrr_~r~0.base=6, getrr_~r~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getrr_#res.base|=6, |getrr_#res.offset|=0, |getrr_#t~malloc0.base|=6, |getrr_#t~malloc0.offset|=0] [?] assume true; VAL [getrr_~r~0.base=6, getrr_~r~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getrr_#res.base|=6, |getrr_#res.offset|=0, |getrr_#t~malloc0.base|=6, |getrr_#t~malloc0.offset|=0] [?] RET #33#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |getPtr_#t~ret1.base|=6, |getPtr_#t~ret1.offset|=0] [?] ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset;call write~int(1, ~r~1.base, ~r~1.offset, 4);#res.base, #res.offset := ~r~1.base, ~r~1.offset; VAL [getPtr_~r~1.base=6, getPtr_~r~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getPtr_#res.base|=6, |getPtr_#res.offset|=0] [?] assume true; VAL [getPtr_~r~1.base=6, getPtr_~r~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |getPtr_#res.base|=6, |getPtr_#res.offset|=0] [?] RET #39#return; VAL [main_~ptr1~0.base=0, main_~ptr1~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret3.base|=6, |main_#t~ret3.offset|=0] [?] ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset; VAL [main_~ptr1~0.base=6, main_~ptr1~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); VAL [freePtr_~ptr.base=6, freePtr_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0, |freePtr_#t~mem2|=1] [?] assume 1 == #t~mem2; VAL [freePtr_~ptr.base=6, freePtr_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0, |freePtr_#t~mem2|=1] [?] havoc #t~mem2;call write~int(2, ~ptr.base, ~ptr.offset, 4); VAL [freePtr_~ptr.base=6, freePtr_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0] [?] assume true; VAL [freePtr_~ptr.base=6, freePtr_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0] [?] RET #41#return; VAL [main_~ptr1~0.base=6, main_~ptr1~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0] [?] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); VAL [freePtr_~ptr.base=6, freePtr_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0, |freePtr_#t~mem2|=2] [?] assume !(1 == #t~mem2); VAL [freePtr_~ptr.base=6, freePtr_~ptr.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePtr_#in~ptr.base|=6, |freePtr_#in~ptr.offset|=0, |freePtr_#t~mem2|=2] [?] CALL call __blast_assert(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L51] ~ptr1~0.base, ~ptr1~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~ptr1~0.base=0, ~ptr1~0.offset=0] [L52] CALL call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0, #NULL.offset=0] [L38] CALL call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4); [L31] ~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset; [L32] call write~int(0, ~r~0.base, ~r~0.offset, 4); [L33] #res.base, #res.offset := ~r~0.base, ~r~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, #t~malloc0.base=6, #t~malloc0.offset=0, ~r~0.base=6, ~r~0.offset=0] [L29-L34] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, #t~malloc0.base=6, #t~malloc0.offset=0, ~r~0.base=6, ~r~0.offset=0] [L38] RET call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=6, #t~ret1.offset=0] [L38] ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset; [L38] havoc #t~ret1.base, #t~ret1.offset; [L39] call write~int(1, ~r~1.base, ~r~1.offset, 4); [L40] #res.base, #res.offset := ~r~1.base, ~r~1.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, ~r~1.base=6, ~r~1.offset=0] [L36-L41] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, ~r~1.base=6, ~r~1.offset=0] [L52] RET call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret3.base=6, #t~ret3.offset=0, ~ptr1~0.base=0, ~ptr1~0.offset=0] [L52] ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset; [L52] havoc #t~ret3.base, #t~ret3.offset; VAL [#NULL.base=0, #NULL.offset=0, ~ptr1~0.base=6, ~ptr1~0.offset=0] [L53] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, ~ptr.base=6, ~ptr.offset=0] [L45] assume 1 == #t~mem2; VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, ~ptr.base=6, ~ptr.offset=0] [L45] havoc #t~mem2; [L46] call write~int(2, ~ptr.base, ~ptr.offset, 4); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, ~ptr.base=6, ~ptr.offset=0] [L43-L47] ensures true; VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, ~ptr.base=6, ~ptr.offset=0] [L53] RET call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~ptr1~0.base=6, ~ptr1~0.offset=0] [L55] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=2, ~ptr.base=6, ~ptr.offset=0] [L45] assume !(1 == #t~mem2); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=2, ~ptr.base=6, ~ptr.offset=0] [L45] CALL call __blast_assert(); VAL [#NULL.base=0, #NULL.offset=0] [L6] assert false; VAL [#NULL.base=0, #NULL.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L51] ~ptr1~0.base, ~ptr1~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~ptr1~0.base=0, ~ptr1~0.offset=0] [L52] CALL call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0, #NULL.offset=0] [L38] CALL call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0, #NULL.offset=0] [L31] call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(4); [L31] ~r~0.base, ~r~0.offset := #t~malloc0.base, #t~malloc0.offset; [L32] call write~int(0, ~r~0.base, ~r~0.offset, 4); [L33] #res.base, #res.offset := ~r~0.base, ~r~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, #t~malloc0.base=6, #t~malloc0.offset=0, ~r~0.base=6, ~r~0.offset=0] [L29-L34] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, #t~malloc0.base=6, #t~malloc0.offset=0, ~r~0.base=6, ~r~0.offset=0] [L38] RET call #t~ret1.base, #t~ret1.offset := getrr(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret1.base=6, #t~ret1.offset=0] [L38] ~r~1.base, ~r~1.offset := #t~ret1.base, #t~ret1.offset; [L38] havoc #t~ret1.base, #t~ret1.offset; [L39] call write~int(1, ~r~1.base, ~r~1.offset, 4); [L40] #res.base, #res.offset := ~r~1.base, ~r~1.offset; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, ~r~1.base=6, ~r~1.offset=0] [L36-L41] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res.base=6, #res.offset=0, ~r~1.base=6, ~r~1.offset=0] [L52] RET call #t~ret3.base, #t~ret3.offset := getPtr(); VAL [#NULL.base=0, #NULL.offset=0, #t~ret3.base=6, #t~ret3.offset=0, ~ptr1~0.base=0, ~ptr1~0.offset=0] [L52] ~ptr1~0.base, ~ptr1~0.offset := #t~ret3.base, #t~ret3.offset; [L52] havoc #t~ret3.base, #t~ret3.offset; VAL [#NULL.base=0, #NULL.offset=0, ~ptr1~0.base=6, ~ptr1~0.offset=0] [L53] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, ~ptr.base=6, ~ptr.offset=0] [L45] assume 1 == #t~mem2; VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=1, ~ptr.base=6, ~ptr.offset=0] [L45] havoc #t~mem2; [L46] call write~int(2, ~ptr.base, ~ptr.offset, 4); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, ~ptr.base=6, ~ptr.offset=0] [L43-L47] ensures true; VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, ~ptr.base=6, ~ptr.offset=0] [L53] RET call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#NULL.base=0, #NULL.offset=0, ~ptr1~0.base=6, ~ptr1~0.offset=0] [L55] CALL call freePtr(~ptr1~0.base, ~ptr1~0.offset); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0] [L43-L47] ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset; [L45] call #t~mem2 := read~int(~ptr.base, ~ptr.offset, 4); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=2, ~ptr.base=6, ~ptr.offset=0] [L45] assume !(1 == #t~mem2); VAL [#in~ptr.base=6, #in~ptr.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem2=2, ~ptr.base=6, ~ptr.offset=0] [L45] CALL call __blast_assert(); VAL [#NULL.base=0, #NULL.offset=0] [L6] assert false; VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L51] ~ptr1~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~int(0, { base: ~r~0!base, offset: ~r~0!offset }, 4); [L33] #res := ~r~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, #t~malloc0!base=6, #t~malloc0!offset=0, ~r~0!base=6, ~r~0!offset=0] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=6, #t~ret1!offset=0] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~int(1, { base: ~r~1!base, offset: ~r~1!offset }, 4); [L40] #res := ~r~1; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, ~r~1!base=6, ~r~1!offset=0] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret3!base=6, #t~ret3!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] COND TRUE 1 == #t~mem2 VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] havoc #t~mem2; [L46] FCALL call write~int(2, { base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, ~ptr!base=6, ~ptr!offset=0] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] COND FALSE !(1 == #t~mem2) VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0] [L6] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L51] ~ptr1~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~int(0, { base: ~r~0!base, offset: ~r~0!offset }, 4); [L33] #res := ~r~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, #t~malloc0!base=6, #t~malloc0!offset=0, ~r~0!base=6, ~r~0!offset=0] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=6, #t~ret1!offset=0] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~int(1, { base: ~r~1!base, offset: ~r~1!offset }, 4); [L40] #res := ~r~1; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, ~r~1!base=6, ~r~1!offset=0] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret3!base=6, #t~ret3!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] COND TRUE 1 == #t~mem2 VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] havoc #t~mem2; [L46] FCALL call write~int(2, { base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, ~ptr!base=6, ~ptr!offset=0] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] COND FALSE !(1 == #t~mem2) VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0] [L6] assert false; VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L51] ~ptr1~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~int(0, { base: ~r~0!base, offset: ~r~0!offset }, 4); [L33] #res := ~r~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, #t~malloc0!base=6, #t~malloc0!offset=0, ~r~0!base=6, ~r~0!offset=0] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=6, #t~ret1!offset=0] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~int(1, { base: ~r~1!base, offset: ~r~1!offset }, 4); [L40] #res := ~r~1; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, ~r~1!base=6, ~r~1!offset=0] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret3!base=6, #t~ret3!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] COND TRUE 1 == #t~mem2 VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] havoc #t~mem2; [L46] FCALL call write~int(2, { base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, ~ptr!base=6, ~ptr!offset=0] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] COND FALSE !(1 == #t~mem2) VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0] [L6] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L51] ~ptr1~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] CALL call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0] [L38] CALL call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0] [L31] FCALL call #t~malloc0 := #Ultimate.alloc(4); [L31] ~r~0 := #t~malloc0; [L32] FCALL call write~int(0, { base: ~r~0!base, offset: ~r~0!offset }, 4); [L33] #res := ~r~0; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, #t~malloc0!base=6, #t~malloc0!offset=0, ~r~0!base=6, ~r~0!offset=0] [L38] RET call #t~ret1 := getrr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret1!base=6, #t~ret1!offset=0] [L38] ~r~1 := #t~ret1; [L38] havoc #t~ret1; [L39] FCALL call write~int(1, { base: ~r~1!base, offset: ~r~1!offset }, 4); [L40] #res := ~r~1; VAL [#NULL!base=0, #NULL!offset=0, #res!base=6, #res!offset=0, ~r~1!base=6, ~r~1!offset=0] [L52] RET call #t~ret3 := getPtr(); VAL [#NULL!base=0, #NULL!offset=0, #t~ret3!base=6, #t~ret3!offset=0, ~ptr1~0!base=0, ~ptr1~0!offset=0] [L52] ~ptr1~0 := #t~ret3; [L52] havoc #t~ret3; VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L53] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] COND TRUE 1 == #t~mem2 VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=1, ~ptr!base=6, ~ptr!offset=0] [L45] havoc #t~mem2; [L46] FCALL call write~int(2, { base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, ~ptr!base=6, ~ptr!offset=0] [L53] RET call freePtr(~ptr1~0); VAL [#NULL!base=0, #NULL!offset=0, ~ptr1~0!base=6, ~ptr1~0!offset=0] [L55] CALL call freePtr(~ptr1~0); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0] [L43-L47] ~ptr := #in~ptr; [L45] FCALL call #t~mem2 := read~int({ base: ~ptr!base, offset: ~ptr!offset }, 4); VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] COND FALSE !(1 == #t~mem2) VAL [#in~ptr!base=6, #in~ptr!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem2=2, ~ptr!base=6, ~ptr!offset=0] [L45] CALL call __blast_assert(); VAL [#NULL!base=0, #NULL!offset=0] [L6] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L51] rr * ptr1 = 0; VAL [ptr1={0:0}] [L52] CALL, EXPR getPtr() [L38] CALL, EXPR getrr() [L31] rr * r = (rr *)malloc(sizeof *r); [L32] r -> state = 0 [L33] return r; VAL [\result={6:0}, malloc(sizeof *r)={6:0}, r={6:0}] [L38] RET, EXPR getrr() VAL [getrr()={6:0}] [L38] rr * r = getrr(); [L39] r -> state = 1 [L40] return r; VAL [\result={6:0}, r={6:0}] [L52] RET, EXPR getPtr() VAL [getPtr()={6:0}, ptr1={0:0}] [L52] ptr1 = getPtr() [L53] CALL freePtr(ptr1) VAL [ptr={6:0}] [L45] EXPR ptr -> state VAL [ptr={6:0}, ptr={6:0}, ptr -> state=1] [L45] (ptr -> state == 1) ? (0) : __blast_assert () VAL [ptr={6:0}, ptr={6:0}, ptr -> state=1] [L46] ptr -> state = 2 VAL [ptr={6:0}, ptr={6:0}] [L53] RET freePtr(ptr1) VAL [ptr1={6:0}] [L55] CALL freePtr(ptr1) VAL [ptr={6:0}] [L45] EXPR ptr -> state VAL [ptr={6:0}, ptr={6:0}, ptr -> state=2] [L45] (ptr -> state == 1) ? (0) : __blast_assert () VAL [ptr={6:0}, ptr={6:0}, ptr -> state=2] [L45] CALL __blast_assert () [L6] __VERIFIER_error() ----- [2018-11-23 12:53:33,531 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/1_3_true-termination.c_false-unreach-call.i-witness.graphml [2018-11-23 12:53:33,531 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:53:33,533 INFO L168 Benchmark]: Toolchain (without parser) took 3747.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -696.9 MB). Peak memory consumption was 72.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:33,535 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 12:53:33,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:33,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:33,540 INFO L168 Benchmark]: Boogie Preprocessor took 43.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:53:33,543 INFO L168 Benchmark]: RCFGBuilder took 709.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -801.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:33,544 INFO L168 Benchmark]: TraceAbstraction took 2469.61 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: 94.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:33,545 INFO L168 Benchmark]: Witness Printer took 113.45 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 12:53:33,554 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 370.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 709.60 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -801.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2469.61 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: 94.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 7.1 GB. * Witness Printer took 113.45 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: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L51] rr * ptr1 = 0; VAL [ptr1={0:0}] [L52] CALL, EXPR getPtr() [L38] CALL, EXPR getrr() [L31] rr * r = (rr *)malloc(sizeof *r); [L32] r -> state = 0 [L33] return r; VAL [\result={6:0}, malloc(sizeof *r)={6:0}, r={6:0}] [L38] RET, EXPR getrr() VAL [getrr()={6:0}] [L38] rr * r = getrr(); [L39] r -> state = 1 [L40] return r; VAL [\result={6:0}, r={6:0}] [L52] RET, EXPR getPtr() VAL [getPtr()={6:0}, ptr1={0:0}] [L52] ptr1 = getPtr() [L53] CALL freePtr(ptr1) VAL [ptr={6:0}] [L45] EXPR ptr -> state VAL [ptr={6:0}, ptr={6:0}, ptr -> state=1] [L45] (ptr -> state == 1) ? (0) : __blast_assert () VAL [ptr={6:0}, ptr={6:0}, ptr -> state=1] [L46] ptr -> state = 2 VAL [ptr={6:0}, ptr={6:0}] [L53] RET freePtr(ptr1) VAL [ptr1={6:0}] [L55] CALL freePtr(ptr1) VAL [ptr={6:0}] [L45] EXPR ptr -> state VAL [ptr={6:0}, ptr={6:0}, ptr -> state=2] [L45] (ptr -> state == 1) ? (0) : __blast_assert () VAL [ptr={6:0}, ptr={6:0}, ptr -> state=2] [L45] CALL __blast_assert () [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 32 locations, 1 error locations. UNSAFE Result, 2.3s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 3 SDslu, 110 SDs, 0 SdLazy, 38 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 969 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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...