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/list-ext2-properties/simple_and_skiplist_2lvl_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:55:54,074 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:55:54,076 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:55:54,097 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:55:54,097 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:55:54,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:55:54,100 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:55:54,103 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:55:54,105 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:55:54,107 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:55:54,108 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:55:54,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:55:54,112 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:55:54,113 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:55:54,117 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:55:54,118 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:55:54,118 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:55:54,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:55:54,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:55:54,133 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:55:54,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:55:54,137 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:55:54,139 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:55:54,139 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:55:54,139 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:55:54,143 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:55:54,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:55:54,145 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:55:54,145 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:55:54,148 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:55:54,148 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:55:54,150 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:55:54,150 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:55:54,150 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:55:54,151 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:55:54,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:55:54,154 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:55:54,176 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:55:54,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:55:54,180 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:55:54,181 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:55:54,181 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:55:54,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:55:54,182 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:55:54,182 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:55:54,182 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:55:54,184 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:55:54,184 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:55:54,184 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:55:54,184 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:55:54,185 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:55:54,185 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:55:54,185 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:55:54,185 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:55:54,185 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:55:54,186 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:55:54,186 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:55:54,186 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:55:54,186 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:55:54,187 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:55:54,187 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:55:54,187 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:55:54,187 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:55:54,189 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:55:54,189 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:55:54,189 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:55:54,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:55:54,190 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:55:54,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:55:54,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:55:54,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:55:54,286 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:55:54,286 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:55:54,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl_false-unreach-call.i [2018-11-23 12:55:54,360 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee5ecb3c/2939ca80507c4edcac18eb61da8b70c3/FLAGec491b3b4 [2018-11-23 12:55:54,914 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:55:54,915 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl_false-unreach-call.i [2018-11-23 12:55:54,932 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee5ecb3c/2939ca80507c4edcac18eb61da8b70c3/FLAGec491b3b4 [2018-11-23 12:55:55,183 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee5ecb3c/2939ca80507c4edcac18eb61da8b70c3 [2018-11-23 12:55:55,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:55:55,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:55:55,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:55,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:55:55,200 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:55:55,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:55" (1/1) ... [2018-11-23 12:55:55,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0796da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:55, skipping insertion in model container [2018-11-23 12:55:55,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:55" (1/1) ... [2018-11-23 12:55:55,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:55:55,283 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:55:55,701 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:55,728 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:55:55,830 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:55,994 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:55:55,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:55 WrapperNode [2018-11-23 12:55:55,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:55,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:55,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:55:55,996 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:55:56,007 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:55:55" (1/1) ... [2018-11-23 12:55:56,031 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:55:55" (1/1) ... [2018-11-23 12:55:56,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:56,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:55:56,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:55:56,045 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:55:56,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:55" (1/1) ... [2018-11-23 12:55:56,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:55" (1/1) ... [2018-11-23 12:55:56,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:55" (1/1) ... [2018-11-23 12:55:56,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:55" (1/1) ... [2018-11-23 12:55:56,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:55" (1/1) ... [2018-11-23 12:55:56,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:55" (1/1) ... [2018-11-23 12:55:56,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:55" (1/1) ... [2018-11-23 12:55:56,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:55:56,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:55:56,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:55:56,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:55:56,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:55" (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:55:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:55:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:55:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure sl_random_insert [2018-11-23 12:55:56,172 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_random_insert [2018-11-23 12:55:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:55:56,173 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:55:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:55:56,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:55:56,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:55:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:55:56,174 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:55:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:55:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:55:56,174 INFO L130 BoogieDeclarations]: Found specification of procedure create_sl_with_head_and_tail [2018-11-23 12:55:56,175 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sl_with_head_and_tail [2018-11-23 12:55:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sl [2018-11-23 12:55:56,175 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sl [2018-11-23 12:55:56,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:55:56,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:55:56,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:55:57,621 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:55:57,622 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:55:57,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:57 BoogieIcfgContainer [2018-11-23 12:55:57,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:55:57,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:55:57,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:55:57,627 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:55:57,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:55" (1/3) ... [2018-11-23 12:55:57,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb0a3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:57, skipping insertion in model container [2018-11-23 12:55:57,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:55" (2/3) ... [2018-11-23 12:55:57,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb0a3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:57, skipping insertion in model container [2018-11-23 12:55:57,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:57" (3/3) ... [2018-11-23 12:55:57,630 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl_false-unreach-call.i [2018-11-23 12:55:57,641 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:55:57,652 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:55:57,671 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:55:57,705 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:55:57,705 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:55:57,706 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:55:57,706 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:55:57,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:55:57,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:55:57,706 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:55:57,706 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:55:57,706 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:55:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-23 12:55:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:55:57,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:57,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:57,734 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:57,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:57,741 INFO L82 PathProgramCache]: Analyzing trace with hash 39487780, now seen corresponding path program 1 times [2018-11-23 12:55:57,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:57,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:57,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:57,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:57,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-23 12:55:57,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57#true} is VALID [2018-11-23 12:55:57,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-23 12:55:57,947 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #159#return; {57#true} is VALID [2018-11-23 12:55:57,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret38 := main(); {57#true} is VALID [2018-11-23 12:55:57,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {57#true} is VALID [2018-11-23 12:55:57,948 INFO L273 TraceCheckUtils]: 6: Hoare triple {57#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {57#true} is VALID [2018-11-23 12:55:57,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {57#true} is VALID [2018-11-23 12:55:57,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#true} assume !true; {58#false} is VALID [2018-11-23 12:55:57,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#false} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {58#false} is VALID [2018-11-23 12:55:57,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {58#false} is VALID [2018-11-23 12:55:57,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {58#false} assume 2 != #t~mem34;havoc #t~mem34; {58#false} is VALID [2018-11-23 12:55:57,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-23 12:55:57,967 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:55:57,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:57,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:55:57,975 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:55:57,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:57,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:55:58,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:58,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:55:58,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:55:58,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:55:58,174 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-11-23 12:55:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:58,746 INFO L93 Difference]: Finished difference Result 92 states and 124 transitions. [2018-11-23 12:55:58,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:55:58,747 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:55:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 124 transitions. [2018-11-23 12:55:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 124 transitions. [2018-11-23 12:55:58,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 124 transitions. [2018-11-23 12:55:59,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:59,420 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:55:59,420 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 12:55:59,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:55:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 12:55:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:55:59,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:59,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 12:55:59,465 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:55:59,465 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:55:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:59,469 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:55:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:55:59,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:59,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:59,470 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:55:59,470 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:55:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:59,473 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:55:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:55:59,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:59,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:59,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:59,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:55:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 12:55:59,479 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 12:55:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:59,479 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 12:55:59,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:55:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:55:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:55:59,480 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:59,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:59,481 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:59,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:59,481 INFO L82 PathProgramCache]: Analyzing trace with hash 781483651, now seen corresponding path program 1 times [2018-11-23 12:55:59,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:59,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:59,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:59,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:59,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:59,689 INFO L256 TraceCheckUtils]: 0: Hoare triple {244#true} call ULTIMATE.init(); {244#true} is VALID [2018-11-23 12:55:59,690 INFO L273 TraceCheckUtils]: 1: Hoare triple {244#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {244#true} is VALID [2018-11-23 12:55:59,690 INFO L273 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2018-11-23 12:55:59,691 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} #159#return; {244#true} is VALID [2018-11-23 12:55:59,691 INFO L256 TraceCheckUtils]: 4: Hoare triple {244#true} call #t~ret38 := main(); {244#true} is VALID [2018-11-23 12:55:59,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {244#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {244#true} is VALID [2018-11-23 12:55:59,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {244#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {244#true} is VALID [2018-11-23 12:55:59,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {244#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {246#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {246#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {246#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {246#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet31);havoc #t~nondet31; {246#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {246#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {247#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:59,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {247#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {248#(= 2 |main_#t~mem34|)} is VALID [2018-11-23 12:55:59,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {248#(= 2 |main_#t~mem34|)} assume 2 != #t~mem34;havoc #t~mem34; {245#false} is VALID [2018-11-23 12:55:59,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {245#false} assume !false; {245#false} is VALID [2018-11-23 12:55:59,702 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:55:59,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:59,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:55:59,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:55:59,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:59,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:55:59,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:59,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:55:59,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:55:59,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:55:59,770 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2018-11-23 12:56:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:00,154 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 12:56:00,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:56:00,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:56:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-23 12:56:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-23 12:56:00,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2018-11-23 12:56:00,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:00,236 INFO L225 Difference]: With dead ends: 33 [2018-11-23 12:56:00,236 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:56:00,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:56:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:56:00,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-11-23 12:56:00,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:00,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 23 states. [2018-11-23 12:56:00,254 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 23 states. [2018-11-23 12:56:00,255 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 23 states. [2018-11-23 12:56:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:00,257 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 12:56:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 12:56:00,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:00,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:00,259 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 31 states. [2018-11-23 12:56:00,259 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 31 states. [2018-11-23 12:56:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:00,262 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 12:56:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 12:56:00,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:00,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:00,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:00,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:56:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 12:56:00,266 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2018-11-23 12:56:00,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:00,266 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 12:56:00,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:56:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 12:56:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:56:00,267 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:00,267 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:00,268 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:00,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:00,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1833409640, now seen corresponding path program 1 times [2018-11-23 12:56:00,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:00,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:00,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:00,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:00,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:00,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2018-11-23 12:56:00,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {390#true} is VALID [2018-11-23 12:56:00,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2018-11-23 12:56:00,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #159#return; {390#true} is VALID [2018-11-23 12:56:00,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret38 := main(); {390#true} is VALID [2018-11-23 12:56:00,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {392#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:56:00,562 INFO L273 TraceCheckUtils]: 6: Hoare triple {392#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {392#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:56:00,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {392#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:00,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:00,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet31);havoc #t~nondet31; {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:00,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {394#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:56:00,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {394#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {394#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:56:00,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {394#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(2 != #t~mem34);havoc #t~mem34; {394#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:56:00,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {394#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {395#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:56:00,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {395#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {391#false} is VALID [2018-11-23 12:56:00,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {391#false} assume 2 != #t~mem34;havoc #t~mem34; {391#false} is VALID [2018-11-23 12:56:00,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#false} assume !false; {391#false} is VALID [2018-11-23 12:56:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:56:00,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:00,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:56:00,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:00,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:00,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:56:00,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:56:00,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:00,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:00,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:56:00,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:56:00,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:00,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:00,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:00,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 12:56:01,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:56:01,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:56:01,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:56:01,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 12:56:01,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,070 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 12:56:01,073 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:01,073 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_12, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_12) 4)) (.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_12) 4))) (and (= .cse0 0) (= 0 .cse1) (= main_~p~0.base .cse1) (= .cse0 main_~p~0.offset))) [2018-11-23 12:56:01,073 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.base) (= main_~p~0.offset 0)) [2018-11-23 12:56:01,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2018-11-23 12:56:01,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {390#true} is VALID [2018-11-23 12:56:01,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2018-11-23 12:56:01,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #159#return; {390#true} is VALID [2018-11-23 12:56:01,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret38 := main(); {390#true} is VALID [2018-11-23 12:56:01,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {392#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:56:01,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {392#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {392#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:56:01,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {392#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,096 INFO L273 TraceCheckUtils]: 8: Hoare triple {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet31);havoc #t~nondet31; {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,105 INFO L273 TraceCheckUtils]: 10: Hoare triple {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {394#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:56:01,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {394#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {394#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:56:01,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {394#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(2 != #t~mem34);havoc #t~mem34; {394#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-23 12:56:01,107 INFO L273 TraceCheckUtils]: 13: Hoare triple {394#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {395#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:56:01,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {395#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {391#false} is VALID [2018-11-23 12:56:01,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {391#false} assume 2 != #t~mem34;havoc #t~mem34; {391#false} is VALID [2018-11-23 12:56:01,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#false} assume !false; {391#false} is VALID [2018-11-23 12:56:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:56:01,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:01,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:56:01,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:56:01,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:01,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:56:01,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:01,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:56:01,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:56:01,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:56:01,178 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-11-23 12:56:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:01,563 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 12:56:01,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:56:01,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:56:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:56:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 12:56:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:56:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 12:56:01,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2018-11-23 12:56:01,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:01,631 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:56:01,631 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:56:01,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:56:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:56:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-23 12:56:01,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:01,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 20 states. [2018-11-23 12:56:01,651 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 20 states. [2018-11-23 12:56:01,651 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 20 states. [2018-11-23 12:56:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:01,654 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:56:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:56:01,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:01,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:01,655 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 27 states. [2018-11-23 12:56:01,655 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 27 states. [2018-11-23 12:56:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:01,657 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:56:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:56:01,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:01,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:01,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:01,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:01,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:56:01,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 12:56:01,660 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 12:56:01,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:01,661 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 12:56:01,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:56:01,661 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:56:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:56:01,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:01,662 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:01,662 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:01,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:01,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1844777302, now seen corresponding path program 1 times [2018-11-23 12:56:01,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:01,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:01,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:01,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:01,736 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=19, |#NULL.offset|=9, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] RET #159#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret38 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0] [?] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~nondet31|=1] [?] assume !!(0 != #t~nondet31);havoc #t~nondet31;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0, |main_#t~nondet31|=0] [?] assume !(0 != #t~nondet31);havoc #t~nondet31; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0, |main_#t~mem34|=1] [?] assume 2 != #t~mem34;havoc #t~mem34; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] assume !false; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret38 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L585] call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8); [L585] ~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, ~a~0.base=14, ~a~0.offset=0] [L586] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, ~a~0.base=14, ~a~0.offset=0] [L587] havoc ~t~0.base, ~t~0.offset; [L588] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L589] call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~nondet31=1, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0] [L590-L596] assume !!(0 != #t~nondet31); [L590] havoc #t~nondet31; [L591] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L592] call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8); [L592] ~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L593] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L594] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L595] call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L595] ~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset; [L595] havoc #t~mem33.base, #t~mem33.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, #t~nondet31=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L590-L596] assume !(0 != #t~nondet31); [L590] havoc #t~nondet31; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L597] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L598] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L599] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L600-L605] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L601] call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, #t~mem34=1, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L601-L603] assume 2 != #t~mem34; [L601] havoc #t~mem34; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L602] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret38 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L585] call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8); [L585] ~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, ~a~0.base=14, ~a~0.offset=0] [L586] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, ~a~0.base=14, ~a~0.offset=0] [L587] havoc ~t~0.base, ~t~0.offset; [L588] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L589] call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~nondet31=1, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0] [L590-L596] assume !!(0 != #t~nondet31); [L590] havoc #t~nondet31; [L591] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L592] call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8); [L592] ~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L593] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L594] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L595] call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L595] ~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset; [L595] havoc #t~mem33.base, #t~mem33.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, #t~nondet31=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L590-L596] assume !(0 != #t~nondet31); [L590] havoc #t~nondet31; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L597] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L598] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L599] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L600-L605] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L601] call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, #t~mem34=1, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L601-L603] assume 2 != #t~mem34; [L601] havoc #t~mem34; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L602] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L585] FCALL call #t~malloc30 := #Ultimate.alloc(8); [L585] ~a~0 := #t~malloc30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L586] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~nondet31=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590-L596] COND FALSE !(!(0 != #t~nondet31)) [L590] havoc #t~nondet31; [L591] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L592] FCALL call #t~malloc32 := #Ultimate.alloc(8); [L592] ~t~0 := #t~malloc32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L593] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] FCALL call #t~mem33 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] ~p~0 := #t~mem33; [L595] havoc #t~mem33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~nondet31=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590-L596] COND TRUE !(0 != #t~nondet31) [L590] havoc #t~nondet31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L597] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L598] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L600-L605] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L601] FCALL call #t~mem34 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~mem34=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L601] COND TRUE 2 != #t~mem34 [L601] havoc #t~mem34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L585] FCALL call #t~malloc30 := #Ultimate.alloc(8); [L585] ~a~0 := #t~malloc30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L586] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~nondet31=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590-L596] COND FALSE !(!(0 != #t~nondet31)) [L590] havoc #t~nondet31; [L591] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L592] FCALL call #t~malloc32 := #Ultimate.alloc(8); [L592] ~t~0 := #t~malloc32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L593] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] FCALL call #t~mem33 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] ~p~0 := #t~mem33; [L595] havoc #t~mem33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~nondet31=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590-L596] COND TRUE !(0 != #t~nondet31) [L590] havoc #t~nondet31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L597] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L598] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L600-L605] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L601] FCALL call #t~mem34 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~mem34=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L601] COND TRUE 2 != #t~mem34 [L601] havoc #t~mem34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L585] FCALL call #t~malloc30 := #Ultimate.alloc(8); [L585] ~a~0 := #t~malloc30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L586] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~nondet31=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590-L596] COND FALSE !(!(0 != #t~nondet31)) [L590] havoc #t~nondet31; [L591] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L592] FCALL call #t~malloc32 := #Ultimate.alloc(8); [L592] ~t~0 := #t~malloc32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L593] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] FCALL call #t~mem33 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] ~p~0 := #t~mem33; [L595] havoc #t~mem33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~nondet31=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590-L596] COND TRUE !(0 != #t~nondet31) [L590] havoc #t~nondet31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L597] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L598] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L600-L605] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L601] FCALL call #t~mem34 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~mem34=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L601] COND TRUE 2 != #t~mem34 [L601] havoc #t~mem34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L585] FCALL call #t~malloc30 := #Ultimate.alloc(8); [L585] ~a~0 := #t~malloc30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L586] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~nondet31=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590-L596] COND FALSE !(!(0 != #t~nondet31)) [L590] havoc #t~nondet31; [L591] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L592] FCALL call #t~malloc32 := #Ultimate.alloc(8); [L592] ~t~0 := #t~malloc32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L593] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] FCALL call #t~mem33 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] ~p~0 := #t~mem33; [L595] havoc #t~mem33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~nondet31=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590-L596] COND TRUE !(0 != #t~nondet31) [L590] havoc #t~nondet31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L597] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L598] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L600-L605] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L601] FCALL call #t~mem34 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~mem34=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L601] COND TRUE 2 != #t~mem34 [L601] havoc #t~mem34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L585] List a = (List) malloc(sizeof(struct node)); VAL [a={14:0}, malloc(sizeof(struct node))={14:0}] [L586] COND FALSE !(a == 0) VAL [a={14:0}, malloc(sizeof(struct node))={14:0}] [L587] List t; [L588] List p = a; [L589] a->h = 2 VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, p={14:0}] [L590] COND TRUE __VERIFIER_nondet_int() [L591] p->h = 1 [L592] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, t={20:0}] [L593] COND FALSE !(t == 0) VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, t={20:0}] [L594] p->n = t [L595] EXPR p->n [L595] p = p->n [L590] COND FALSE !(__VERIFIER_nondet_int()) [L597] p->h = 2 [L598] p->n = 0 [L599] p = a VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, t={20:0}] [L600] COND TRUE p!=0 [L601] EXPR p->h VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, p->h=1, t={20:0}] [L601] COND TRUE p->h != 2 [L602] __VERIFIER_error() VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, t={20:0}] ----- [2018-11-23 12:56:01,811 WARN L170 areAnnotationChecker]: sl_random_insertENTRY has no Hoare annotation [2018-11-23 12:56:01,811 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-23 12:56:01,812 WARN L170 areAnnotationChecker]: create_sl_with_head_and_tailENTRY has no Hoare annotation [2018-11-23 12:56:01,812 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:56:01,812 WARN L170 areAnnotationChecker]: destroy_slENTRY has no Hoare annotation [2018-11-23 12:56:01,812 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:56:01,812 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:56:01,812 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:56:01,813 WARN L170 areAnnotationChecker]: L554-5 has no Hoare annotation [2018-11-23 12:56:01,813 WARN L170 areAnnotationChecker]: L554-5 has no Hoare annotation [2018-11-23 12:56:01,813 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2018-11-23 12:56:01,813 WARN L170 areAnnotationChecker]: create_sl_with_head_and_tailFINAL has no Hoare annotation [2018-11-23 12:56:01,813 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:56:01,813 WARN L170 areAnnotationChecker]: L570-3 has no Hoare annotation [2018-11-23 12:56:01,813 WARN L170 areAnnotationChecker]: L570-3 has no Hoare annotation [2018-11-23 12:56:01,813 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:56:01,814 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:56:01,814 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2018-11-23 12:56:01,814 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2018-11-23 12:56:01,814 WARN L170 areAnnotationChecker]: L554-6 has no Hoare annotation [2018-11-23 12:56:01,814 WARN L170 areAnnotationChecker]: L554-1 has no Hoare annotation [2018-11-23 12:56:01,814 WARN L170 areAnnotationChecker]: L554-1 has no Hoare annotation [2018-11-23 12:56:01,814 WARN L170 areAnnotationChecker]: create_sl_with_head_and_tailEXIT has no Hoare annotation [2018-11-23 12:56:01,815 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:56:01,815 WARN L170 areAnnotationChecker]: L570-4 has no Hoare annotation [2018-11-23 12:56:01,815 WARN L170 areAnnotationChecker]: L570-1 has no Hoare annotation [2018-11-23 12:56:01,815 WARN L170 areAnnotationChecker]: L570-1 has no Hoare annotation [2018-11-23 12:56:01,815 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:56:01,815 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2018-11-23 12:56:01,815 WARN L170 areAnnotationChecker]: L586-1 has no Hoare annotation [2018-11-23 12:56:01,816 WARN L170 areAnnotationChecker]: L586-3 has no Hoare annotation [2018-11-23 12:56:01,817 WARN L170 areAnnotationChecker]: L557-5 has no Hoare annotation [2018-11-23 12:56:01,817 WARN L170 areAnnotationChecker]: L557-5 has no Hoare annotation [2018-11-23 12:56:01,817 WARN L170 areAnnotationChecker]: L554-3 has no Hoare annotation [2018-11-23 12:56:01,817 WARN L170 areAnnotationChecker]: L554-3 has no Hoare annotation [2018-11-23 12:56:01,817 WARN L170 areAnnotationChecker]: L606 has no Hoare annotation [2018-11-23 12:56:01,817 WARN L170 areAnnotationChecker]: destroy_slFINAL has no Hoare annotation [2018-11-23 12:56:01,818 WARN L170 areAnnotationChecker]: L590-3 has no Hoare annotation [2018-11-23 12:56:01,818 WARN L170 areAnnotationChecker]: L590-3 has no Hoare annotation [2018-11-23 12:56:01,818 WARN L170 areAnnotationChecker]: L557-6 has no Hoare annotation [2018-11-23 12:56:01,818 WARN L170 areAnnotationChecker]: L557-1 has no Hoare annotation [2018-11-23 12:56:01,818 WARN L170 areAnnotationChecker]: L557-1 has no Hoare annotation [2018-11-23 12:56:01,818 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2018-11-23 12:56:01,818 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2018-11-23 12:56:01,818 WARN L170 areAnnotationChecker]: destroy_slEXIT has no Hoare annotation [2018-11-23 12:56:01,819 WARN L170 areAnnotationChecker]: L590-4 has no Hoare annotation [2018-11-23 12:56:01,819 WARN L170 areAnnotationChecker]: L590-1 has no Hoare annotation [2018-11-23 12:56:01,819 WARN L170 areAnnotationChecker]: L590-1 has no Hoare annotation [2018-11-23 12:56:01,819 WARN L170 areAnnotationChecker]: L562 has no Hoare annotation [2018-11-23 12:56:01,819 WARN L170 areAnnotationChecker]: L562 has no Hoare annotation [2018-11-23 12:56:01,819 WARN L170 areAnnotationChecker]: L557-3 has no Hoare annotation [2018-11-23 12:56:01,819 WARN L170 areAnnotationChecker]: L557-3 has no Hoare annotation [2018-11-23 12:56:01,820 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2018-11-23 12:56:01,820 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2018-11-23 12:56:01,820 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2018-11-23 12:56:01,820 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2018-11-23 12:56:01,820 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2018-11-23 12:56:01,820 WARN L170 areAnnotationChecker]: L600-2 has no Hoare annotation [2018-11-23 12:56:01,820 WARN L170 areAnnotationChecker]: L600-2 has no Hoare annotation [2018-11-23 12:56:01,824 WARN L170 areAnnotationChecker]: L600-2 has no Hoare annotation [2018-11-23 12:56:01,825 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2018-11-23 12:56:01,825 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2018-11-23 12:56:01,825 WARN L170 areAnnotationChecker]: L562-2 has no Hoare annotation [2018-11-23 12:56:01,825 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2018-11-23 12:56:01,825 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2018-11-23 12:56:01,825 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:56:01,826 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2018-11-23 12:56:01,826 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2018-11-23 12:56:01,826 WARN L170 areAnnotationChecker]: L601 has no Hoare annotation [2018-11-23 12:56:01,826 WARN L170 areAnnotationChecker]: L601 has no Hoare annotation [2018-11-23 12:56:01,826 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2018-11-23 12:56:01,826 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2018-11-23 12:56:01,826 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2018-11-23 12:56:01,826 WARN L170 areAnnotationChecker]: sl_random_insertEXIT has no Hoare annotation [2018-11-23 12:56:01,827 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:56:01,827 WARN L170 areAnnotationChecker]: L602 has no Hoare annotation [2018-11-23 12:56:01,827 WARN L170 areAnnotationChecker]: L602 has no Hoare annotation [2018-11-23 12:56:01,827 WARN L170 areAnnotationChecker]: L601-2 has no Hoare annotation [2018-11-23 12:56:01,827 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:56:01,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:56:01 BoogieIcfgContainer [2018-11-23 12:56:01,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:56:01,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:56:01,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:56:01,833 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:56:01,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:57" (3/4) ... [2018-11-23 12:56:01,837 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|=19, |#NULL.offset|=9, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=19, |old(#NULL.offset)|=9] [?] RET #159#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret38 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0] [?] havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0] [?] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~nondet31|=1] [?] assume !!(0 != #t~nondet31);havoc #t~nondet31;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0, |main_#t~nondet31|=0] [?] assume !(0 != #t~nondet31);havoc #t~nondet31; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=20, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0, |main_#t~mem34|=1] [?] assume 2 != #t~mem34;havoc #t~mem34; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] assume !false; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=20, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc30.base|=14, |main_#t~malloc30.offset|=0, |main_#t~malloc32.base|=20, |main_#t~malloc32.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret38 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L585] call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8); [L585] ~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, ~a~0.base=14, ~a~0.offset=0] [L586] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, ~a~0.base=14, ~a~0.offset=0] [L587] havoc ~t~0.base, ~t~0.offset; [L588] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L589] call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~nondet31=1, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0] [L590-L596] assume !!(0 != #t~nondet31); [L590] havoc #t~nondet31; [L591] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L592] call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8); [L592] ~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L593] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L594] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L595] call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L595] ~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset; [L595] havoc #t~mem33.base, #t~mem33.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, #t~nondet31=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L590-L596] assume !(0 != #t~nondet31); [L590] havoc #t~nondet31; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L597] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L598] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L599] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L600-L605] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L601] call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, #t~mem34=1, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L601-L603] assume 2 != #t~mem34; [L601] havoc #t~mem34; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L602] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=19, #NULL.offset=9, old(#NULL.base)=19, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=19, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret38 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L585] call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8); [L585] ~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, ~a~0.base=14, ~a~0.offset=0] [L586] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, ~a~0.base=14, ~a~0.offset=0] [L587] havoc ~t~0.base, ~t~0.offset; [L588] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; [L589] call write~int(2, ~a~0.base, ~a~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~nondet31=1, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0] [L590-L596] assume !!(0 != #t~nondet31); [L590] havoc #t~nondet31; [L591] call write~int(1, ~p~0.base, ~p~0.offset, 4); [L592] call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8); [L592] ~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L593] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L594] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L595] call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L595] ~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset; [L595] havoc #t~mem33.base, #t~mem33.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, #t~nondet31=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L590-L596] assume !(0 != #t~nondet31); [L590] havoc #t~nondet31; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=20, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L597] call write~int(2, ~p~0.base, ~p~0.offset, 4); [L598] call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4); [L599] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L600-L605] assume !!(~p~0.base != 0 || ~p~0.offset != 0); [L601] call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, #t~mem34=1, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L601-L603] assume 2 != #t~mem34; [L601] havoc #t~mem34; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [L602] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc30.base=14, #t~malloc30.offset=0, #t~malloc32.base=20, #t~malloc32.offset=0, ~a~0.base=14, ~a~0.offset=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=20, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L585] FCALL call #t~malloc30 := #Ultimate.alloc(8); [L585] ~a~0 := #t~malloc30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L586] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~nondet31=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590-L596] COND FALSE !(!(0 != #t~nondet31)) [L590] havoc #t~nondet31; [L591] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L592] FCALL call #t~malloc32 := #Ultimate.alloc(8); [L592] ~t~0 := #t~malloc32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L593] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] FCALL call #t~mem33 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] ~p~0 := #t~mem33; [L595] havoc #t~mem33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~nondet31=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590-L596] COND TRUE !(0 != #t~nondet31) [L590] havoc #t~nondet31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L597] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L598] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L600-L605] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L601] FCALL call #t~mem34 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~mem34=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L601] COND TRUE 2 != #t~mem34 [L601] havoc #t~mem34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L585] FCALL call #t~malloc30 := #Ultimate.alloc(8); [L585] ~a~0 := #t~malloc30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L586] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~nondet31=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590-L596] COND FALSE !(!(0 != #t~nondet31)) [L590] havoc #t~nondet31; [L591] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L592] FCALL call #t~malloc32 := #Ultimate.alloc(8); [L592] ~t~0 := #t~malloc32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L593] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] FCALL call #t~mem33 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] ~p~0 := #t~mem33; [L595] havoc #t~mem33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~nondet31=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590-L596] COND TRUE !(0 != #t~nondet31) [L590] havoc #t~nondet31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L597] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L598] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L600-L605] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L601] FCALL call #t~mem34 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~mem34=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L601] COND TRUE 2 != #t~mem34 [L601] havoc #t~mem34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L585] FCALL call #t~malloc30 := #Ultimate.alloc(8); [L585] ~a~0 := #t~malloc30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L586] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~nondet31=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590-L596] COND FALSE !(!(0 != #t~nondet31)) [L590] havoc #t~nondet31; [L591] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L592] FCALL call #t~malloc32 := #Ultimate.alloc(8); [L592] ~t~0 := #t~malloc32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L593] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] FCALL call #t~mem33 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] ~p~0 := #t~mem33; [L595] havoc #t~mem33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~nondet31=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590-L596] COND TRUE !(0 != #t~nondet31) [L590] havoc #t~nondet31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L597] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L598] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L600-L605] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L601] FCALL call #t~mem34 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~mem34=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L601] COND TRUE 2 != #t~mem34 [L601] havoc #t~mem34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=19, #NULL!offset=9, old(#NULL!base)=19, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=19, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret38 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L585] FCALL call #t~malloc30 := #Ultimate.alloc(8); [L585] ~a~0 := #t~malloc30; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L586] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0] [L587] havoc ~t~0; [L588] ~p~0 := ~a~0; [L589] FCALL call write~int(2, { base: ~a~0!base, offset: ~a~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~nondet31=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0] [L590-L596] COND FALSE !(!(0 != #t~nondet31)) [L590] havoc #t~nondet31; [L591] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L592] FCALL call #t~malloc32 := #Ultimate.alloc(8); [L592] ~t~0 := #t~malloc32; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L593] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L594] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] FCALL call #t~mem33 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L595] ~p~0 := #t~mem33; [L595] havoc #t~mem33; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590] assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~nondet31=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L590-L596] COND TRUE !(0 != #t~nondet31) [L590] havoc #t~nondet31; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=20, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L597] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L598] FCALL call write~$Pointer$({ base: 0, offset: 0 }, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L599] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L600-L605] COND FALSE !(!(~p~0 != { base: 0, offset: 0 })) [L601] FCALL call #t~mem34 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, #t~mem34=1, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L601] COND TRUE 2 != #t~mem34 [L601] havoc #t~mem34; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc30!base=14, #t~malloc30!offset=0, #t~malloc32!base=20, #t~malloc32!offset=0, ~a~0!base=14, ~a~0!offset=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=20, ~t~0!offset=0] [L585] List a = (List) malloc(sizeof(struct node)); VAL [a={14:0}, malloc(sizeof(struct node))={14:0}] [L586] COND FALSE !(a == 0) VAL [a={14:0}, malloc(sizeof(struct node))={14:0}] [L587] List t; [L588] List p = a; [L589] a->h = 2 VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, p={14:0}] [L590] COND TRUE __VERIFIER_nondet_int() [L591] p->h = 1 [L592] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, t={20:0}] [L593] COND FALSE !(t == 0) VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, t={20:0}] [L594] p->n = t [L595] EXPR p->n [L595] p = p->n [L590] COND FALSE !(__VERIFIER_nondet_int()) [L597] p->h = 2 [L598] p->n = 0 [L599] p = a VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, t={20:0}] [L600] COND TRUE p!=0 [L601] EXPR p->h VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, p->h=1, t={20:0}] [L601] COND TRUE p->h != 2 [L602] __VERIFIER_error() VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, t={20:0}] ----- [2018-11-23 12:56:01,935 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-ext2-properties/simple_and_skiplist_2lvl_false-unreach-call.i-witness.graphml [2018-11-23 12:56:01,935 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:56:01,937 INFO L168 Benchmark]: Toolchain (without parser) took 6742.82 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 695.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -415.0 MB). Peak memory consumption was 280.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:01,939 INFO L168 Benchmark]: CDTParser took 0.23 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:56:01,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.48 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 695.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -753.2 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:01,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.69 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:01,947 INFO L168 Benchmark]: Boogie Preprocessor took 66.88 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:01,950 INFO L168 Benchmark]: RCFGBuilder took 1509.29 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:01,951 INFO L168 Benchmark]: TraceAbstraction took 4208.38 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 246.8 MB). Peak memory consumption was 246.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:01,951 INFO L168 Benchmark]: Witness Printer took 102.54 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:01,960 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.23 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. * CACSL2BoogieTranslator took 799.48 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 695.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -753.2 MB). Peak memory consumption was 52.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.69 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.88 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1509.29 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4208.38 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 246.8 MB). Peak memory consumption was 246.8 MB. Max. memory is 7.1 GB. * Witness Printer took 102.54 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 602]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L585] List a = (List) malloc(sizeof(struct node)); VAL [a={14:0}, malloc(sizeof(struct node))={14:0}] [L586] COND FALSE !(a == 0) VAL [a={14:0}, malloc(sizeof(struct node))={14:0}] [L587] List t; [L588] List p = a; [L589] a->h = 2 VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, p={14:0}] [L590] COND TRUE __VERIFIER_nondet_int() [L591] p->h = 1 [L592] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, t={20:0}] [L593] COND FALSE !(t == 0) VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, t={20:0}] [L594] p->n = t [L595] EXPR p->n [L595] p = p->n [L590] COND FALSE !(__VERIFIER_nondet_int()) [L597] p->h = 2 [L598] p->n = 0 [L599] p = a VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, t={20:0}] [L600] COND TRUE p!=0 [L601] EXPR p->h VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, p->h=1, t={20:0}] [L601] COND TRUE p->h != 2 [L602] __VERIFIER_error() VAL [a={14:0}, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={20:0}, p={14:0}, t={20:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 56 locations, 1 error locations. UNSAFE Result, 4.1s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 91 SDtfs, 39 SDslu, 75 SDs, 0 SdLazy, 54 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 4363 SizeOfPredicates, 7 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...