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-properties/list_flag_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:52:36,316 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:52:36,318 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:52:36,333 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:52:36,333 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:52:36,334 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:52:36,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:52:36,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:52:36,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:52:36,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:52:36,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:52:36,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:52:36,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:52:36,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:52:36,344 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:52:36,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:52:36,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:52:36,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:52:36,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:52:36,355 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:52:36,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:52:36,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:52:36,366 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:52:36,366 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:52:36,367 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:52:36,368 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:52:36,373 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:52:36,374 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:52:36,375 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:52:36,378 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:52:36,378 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:52:36,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:52:36,380 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:52:36,380 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:52:36,382 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:52:36,382 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:52:36,383 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:52:36,410 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:52:36,410 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:52:36,411 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:52:36,411 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:52:36,412 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:52:36,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:52:36,412 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:52:36,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:52:36,412 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:52:36,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:52:36,413 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:52:36,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:52:36,413 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:52:36,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:52:36,414 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:52:36,414 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:52:36,414 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:52:36,414 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:52:36,414 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:52:36,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:52:36,415 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:52:36,415 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:52:36,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:52:36,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:52:36,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:52:36,416 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:52:36,416 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:52:36,416 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:52:36,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:52:36,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:52:36,417 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:52:36,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:52:36,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:52:36,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:52:36,492 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:52:36,492 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:52:36,493 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_flag_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:36,558 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aee4a5484/90ccb10f4e2b40b884957a4b1c5e4b05/FLAG41dbc490a [2018-11-23 12:52:37,141 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:52:37,142 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_flag_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:37,159 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aee4a5484/90ccb10f4e2b40b884957a4b1c5e4b05/FLAG41dbc490a [2018-11-23 12:52:37,387 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aee4a5484/90ccb10f4e2b40b884957a4b1c5e4b05 [2018-11-23 12:52:37,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:52:37,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:52:37,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:52:37,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:52:37,402 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:52:37,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:37" (1/1) ... [2018-11-23 12:52:37,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3696e133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:37, skipping insertion in model container [2018-11-23 12:52:37,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:37" (1/1) ... [2018-11-23 12:52:37,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:52:37,465 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:52:37,864 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:52:37,875 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:52:37,919 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:52:38,006 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:52:38,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:38 WrapperNode [2018-11-23 12:52:38,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:52:38,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:52:38,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:52:38,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:52:38,019 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:52:38" (1/1) ... [2018-11-23 12:52:38,114 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:52:38" (1/1) ... [2018-11-23 12:52:38,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:52:38,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:52:38,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:52:38,124 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:52:38,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:38" (1/1) ... [2018-11-23 12:52:38,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:38" (1/1) ... [2018-11-23 12:52:38,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:38" (1/1) ... [2018-11-23 12:52:38,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:38" (1/1) ... [2018-11-23 12:52:38,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:38" (1/1) ... [2018-11-23 12:52:38,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:38" (1/1) ... [2018-11-23 12:52:38,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:38" (1/1) ... [2018-11-23 12:52:38,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:52:38,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:52:38,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:52:38,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:52:38,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:38" (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:52:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:52:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:52:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:52:38,225 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:52:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:52:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:52:38,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:52:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:52:38,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:52:38,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:52:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:52:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:52:38,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:52:38,947 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:52:38,948 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:52:38,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:38 BoogieIcfgContainer [2018-11-23 12:52:38,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:52:38,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:52:38,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:52:38,954 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:52:38,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:52:37" (1/3) ... [2018-11-23 12:52:38,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed903ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:52:38, skipping insertion in model container [2018-11-23 12:52:38,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:38" (2/3) ... [2018-11-23 12:52:38,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed903ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:52:38, skipping insertion in model container [2018-11-23 12:52:38,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:38" (3/3) ... [2018-11-23 12:52:38,959 INFO L112 eAbstractionObserver]: Analyzing ICFG list_flag_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:38,969 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:52:38,977 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:52:38,996 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:52:39,028 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:52:39,029 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:52:39,030 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:52:39,030 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:52:39,030 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:52:39,031 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:52:39,031 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:52:39,031 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:52:39,031 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:52:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:52:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:52:39,055 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:39,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:39,059 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:39,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:39,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1959867314, now seen corresponding path program 1 times [2018-11-23 12:52:39,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:39,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:39,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:39,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:39,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:39,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:52:39,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-23 12:52:39,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:52:39,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #91#return; {35#true} is VALID [2018-11-23 12:52:39,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret10 := main(); {35#true} is VALID [2018-11-23 12:52:39,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {35#true} is VALID [2018-11-23 12:52:39,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {35#true} is VALID [2018-11-23 12:52:39,231 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {35#true} is VALID [2018-11-23 12:52:39,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-23 12:52:39,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {36#false} is VALID [2018-11-23 12:52:39,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume !(0 != ~flag~0); {36#false} is VALID [2018-11-23 12:52:39,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !true; {36#false} is VALID [2018-11-23 12:52:39,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {36#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {36#false} is VALID [2018-11-23 12:52:39,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} assume 3 != #t~mem9;havoc #t~mem9; {36#false} is VALID [2018-11-23 12:52:39,236 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:52:39,239 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:52:39,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:52:39,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:52:39,248 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:52:39,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:39,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:52:39,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:39,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:52:39,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:52:39,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:52:39,472 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 12:52:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:39,883 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2018-11-23 12:52:39,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:52:39,884 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 12:52:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:52:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-23 12:52:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:52:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-23 12:52:39,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2018-11-23 12:52:40,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:40,131 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:52:40,131 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:52:40,135 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:52:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:52:40,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:52:40,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:40,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:52:40,190 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:52:40,191 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:52:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:40,195 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:52:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:52:40,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:40,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:40,196 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:52:40,196 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:52:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:40,200 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:52:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:52:40,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:40,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:40,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:40,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:52:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 12:52:40,207 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2018-11-23 12:52:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:40,207 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 12:52:40,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:52:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:52:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:52:40,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:40,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:40,209 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:40,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:40,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1959498088, now seen corresponding path program 1 times [2018-11-23 12:52:40,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:40,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:40,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:40,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:40,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:40,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {177#true} is VALID [2018-11-23 12:52:40,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {177#true} is VALID [2018-11-23 12:52:40,471 INFO L273 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2018-11-23 12:52:40,471 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #91#return; {177#true} is VALID [2018-11-23 12:52:40,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret10 := main(); {177#true} is VALID [2018-11-23 12:52:40,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {177#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {177#true} is VALID [2018-11-23 12:52:40,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {177#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {177#true} is VALID [2018-11-23 12:52:40,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {177#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {179#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:40,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {179#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {179#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:40,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {179#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet2);havoc #t~nondet2; {179#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:40,525 INFO L273 TraceCheckUtils]: 10: Hoare triple {179#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:40,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(0 != ~flag~0); {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:40,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:40,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(1 == #t~mem7);havoc #t~mem7; {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:52:40,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {180#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {181#(= |main_#t~mem9| 3)} is VALID [2018-11-23 12:52:40,590 INFO L273 TraceCheckUtils]: 15: Hoare triple {181#(= |main_#t~mem9| 3)} assume 3 != #t~mem9;havoc #t~mem9; {178#false} is VALID [2018-11-23 12:52:40,590 INFO L273 TraceCheckUtils]: 16: Hoare triple {178#false} assume !false; {178#false} is VALID [2018-11-23 12:52:40,593 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:52:40,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:52:40,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:52:40,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:52:40,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:40,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:52:40,669 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:52:40,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:52:40,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:52:40,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:52:40,670 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 5 states. [2018-11-23 12:52:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:41,453 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-23 12:52:41,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:52:41,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 12:52:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2018-11-23 12:52:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2018-11-23 12:52:41,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2018-11-23 12:52:41,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:41,576 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:52:41,576 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:52:41,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:52:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:52:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2018-11-23 12:52:41,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:41,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 32 states. [2018-11-23 12:52:41,600 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 32 states. [2018-11-23 12:52:41,601 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 32 states. [2018-11-23 12:52:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:41,605 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:52:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:52:41,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:41,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:41,606 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 44 states. [2018-11-23 12:52:41,606 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 44 states. [2018-11-23 12:52:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:41,610 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:52:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:52:41,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:41,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:41,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:41,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:52:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-11-23 12:52:41,614 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 17 [2018-11-23 12:52:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:41,615 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-11-23 12:52:41,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:52:41,615 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 12:52:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:52:41,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:41,616 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:41,617 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:41,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:41,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1930663235, now seen corresponding path program 1 times [2018-11-23 12:52:41,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:41,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:41,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:41,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:41,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:41,803 INFO L256 TraceCheckUtils]: 0: Hoare triple {378#true} call ULTIMATE.init(); {378#true} is VALID [2018-11-23 12:52:41,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {378#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {378#true} is VALID [2018-11-23 12:52:41,804 INFO L273 TraceCheckUtils]: 2: Hoare triple {378#true} assume true; {378#true} is VALID [2018-11-23 12:52:41,804 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {378#true} {378#true} #91#return; {378#true} is VALID [2018-11-23 12:52:41,804 INFO L256 TraceCheckUtils]: 4: Hoare triple {378#true} call #t~ret10 := main(); {378#true} is VALID [2018-11-23 12:52:41,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {378#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {378#true} is VALID [2018-11-23 12:52:41,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {378#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {378#true} is VALID [2018-11-23 12:52:41,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {378#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {380#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:41,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {380#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {380#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:41,809 INFO L273 TraceCheckUtils]: 9: Hoare triple {380#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet2);havoc #t~nondet2; {380#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:41,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {380#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {381#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:52:41,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {381#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume !(0 != ~flag~0); {381#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:52:41,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {381#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {382#(= |main_#t~mem7| 3)} is VALID [2018-11-23 12:52:41,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {382#(= |main_#t~mem7| 3)} assume !!(1 == #t~mem7);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {379#false} is VALID [2018-11-23 12:52:41,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {379#false} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {379#false} is VALID [2018-11-23 12:52:41,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {379#false} assume !(1 == #t~mem7);havoc #t~mem7; {379#false} is VALID [2018-11-23 12:52:41,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {379#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {379#false} is VALID [2018-11-23 12:52:41,823 INFO L273 TraceCheckUtils]: 17: Hoare triple {379#false} assume 3 != #t~mem9;havoc #t~mem9; {379#false} is VALID [2018-11-23 12:52:41,823 INFO L273 TraceCheckUtils]: 18: Hoare triple {379#false} assume !false; {379#false} is VALID [2018-11-23 12:52:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:52:41,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:52:41,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:52:41,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 12:52:41,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:41,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:52:41,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:41,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:52:41,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:52:41,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:52:41,882 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 5 states. [2018-11-23 12:52:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:42,238 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 12:52:42,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:52:42,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 12:52:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:52:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:52:42,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:52:42,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:42,385 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:52:42,386 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:52:42,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:52:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:52:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-11-23 12:52:42,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:42,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 30 states. [2018-11-23 12:52:42,404 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 30 states. [2018-11-23 12:52:42,404 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 30 states. [2018-11-23 12:52:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:42,408 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:52:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:52:42,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:42,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:42,410 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 42 states. [2018-11-23 12:52:42,410 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 42 states. [2018-11-23 12:52:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:42,413 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 12:52:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 12:52:42,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:42,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:42,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:42,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:52:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 12:52:42,417 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2018-11-23 12:52:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:42,417 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 12:52:42,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:52:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 12:52:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:52:42,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:42,419 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:42,419 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:42,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:42,419 INFO L82 PathProgramCache]: Analyzing trace with hash 686921714, now seen corresponding path program 1 times [2018-11-23 12:52:42,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:42,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:42,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:42,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {575#true} call ULTIMATE.init(); {575#true} is VALID [2018-11-23 12:52:42,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {575#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {575#true} is VALID [2018-11-23 12:52:42,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {575#true} assume true; {575#true} is VALID [2018-11-23 12:52:42,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {575#true} {575#true} #91#return; {575#true} is VALID [2018-11-23 12:52:42,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {575#true} call #t~ret10 := main(); {575#true} is VALID [2018-11-23 12:52:42,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {575#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {575#true} is VALID [2018-11-23 12:52:42,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {575#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {575#true} is VALID [2018-11-23 12:52:42,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {575#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {577#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:42,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {577#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {577#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:42,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {577#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet2);havoc #t~nondet2; {577#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:52:42,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {577#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {578#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:52:42,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {578#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume 0 != ~flag~0; {578#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-23 12:52:42,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {578#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {579#(= |main_#t~mem5| 3)} is VALID [2018-11-23 12:52:42,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {579#(= |main_#t~mem5| 3)} assume !!(2 == #t~mem5);havoc #t~mem5;call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {576#false} is VALID [2018-11-23 12:52:42,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {576#false} call #t~mem5 := read~int(~p~0.base, ~p~0.offset, 4); {576#false} is VALID [2018-11-23 12:52:42,559 INFO L273 TraceCheckUtils]: 15: Hoare triple {576#false} assume !(2 == #t~mem5);havoc #t~mem5; {576#false} is VALID [2018-11-23 12:52:42,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {576#false} call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {576#false} is VALID [2018-11-23 12:52:42,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {576#false} assume 3 != #t~mem9;havoc #t~mem9; {576#false} is VALID [2018-11-23 12:52:42,560 INFO L273 TraceCheckUtils]: 18: Hoare triple {576#false} assume !false; {576#false} is VALID [2018-11-23 12:52:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:52:42,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:52:42,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:52:42,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 12:52:42,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:42,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:52:42,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:42,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:52:42,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:52:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:52:42,596 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2018-11-23 12:52:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:42,894 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 12:52:42,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:52:42,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 12:52:42,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:52:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:52:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 12:52:42,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2018-11-23 12:52:43,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:43,037 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:52:43,038 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:52:43,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:52:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:52:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2018-11-23 12:52:43,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:43,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 26 states. [2018-11-23 12:52:43,075 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 26 states. [2018-11-23 12:52:43,075 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 26 states. [2018-11-23 12:52:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:43,078 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-23 12:52:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 12:52:43,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:43,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:43,079 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 38 states. [2018-11-23 12:52:43,079 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 38 states. [2018-11-23 12:52:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:43,082 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-23 12:52:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-11-23 12:52:43,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:43,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:43,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:43,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:52:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:52:43,085 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2018-11-23 12:52:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:43,086 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:52:43,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:52:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:52:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:52:43,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:43,087 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:43,087 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:43,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234719, now seen corresponding path program 1 times [2018-11-23 12:52:43,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:43,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:43,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:43,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:43,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:52:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:52:43,179 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=16, |#NULL.offset|=10, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] RET #91#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~nondet2|=1] [?] assume !!(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] assume !(0 != ~flag~0);call write~int(2, ~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call write~int(3, ~p~0.base, ~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_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume !(0 != ~flag~0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0, |main_#t~mem7|=2] [?] assume !(1 == #t~mem7);havoc #t~mem7; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0, |main_#t~mem9|=2] [?] assume 3 != #t~mem9;havoc #t~mem9; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume !false; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0.base, ~p~0.offset; [L628] havoc ~a~0.base, ~a~0.offset; [L628] havoc ~t~0.base, ~t~0.offset; [L629] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8); [L629] ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L630] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~nondet2=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632-L642] assume !!(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L633-L637] assume !(0 != ~flag~0); [L636] call write~int(2, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L638] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L638] ~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L639] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L640] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L641] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset; [L641] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~nondet2=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632-L642] assume !(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L643] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L644] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645-L650] assume !(0 != ~flag~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem7=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649-L650] assume !(1 == #t~mem7); [L649] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem9=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651-L652] assume 3 != #t~mem9; [L651] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L652] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0.base, ~p~0.offset; [L628] havoc ~a~0.base, ~a~0.offset; [L628] havoc ~t~0.base, ~t~0.offset; [L629] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8); [L629] ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L630] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~nondet2=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632-L642] assume !!(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L633-L637] assume !(0 != ~flag~0); [L636] call write~int(2, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L638] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L638] ~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L639] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L640] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L641] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset; [L641] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~nondet2=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632-L642] assume !(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L643] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L644] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645-L650] assume !(0 != ~flag~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem7=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649-L650] assume !(1 == #t~mem7); [L649] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem9=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651-L652] assume 3 != #t~mem9; [L651] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L652] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L627] int flag = __VERIFIER_nondet_int(); [L628] List p, a, t; [L629] a = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}] [L630] COND FALSE !(a == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}] [L631] p = a VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L636] p->h = 2 VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L638] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L639] COND FALSE !(t == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L640] p->n = t [L641] EXPR p->n [L641] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L643] p->h = 3 [L644] p = a VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L645] COND FALSE !(\read(flag)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L649] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, p->h=2, t={17:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, p->h=2, t={17:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] ----- [2018-11-23 12:52:43,272 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-23 12:52:43,272 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:52:43,272 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:52:43,272 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:52:43,272 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:52:43,272 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2018-11-23 12:52:43,273 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:52:43,273 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:52:43,273 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:52:43,273 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2018-11-23 12:52:43,273 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2018-11-23 12:52:43,273 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:52:43,273 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:52:43,274 WARN L170 areAnnotationChecker]: L630-1 has no Hoare annotation [2018-11-23 12:52:43,274 WARN L170 areAnnotationChecker]: L630-1 has no Hoare annotation [2018-11-23 12:52:43,274 WARN L170 areAnnotationChecker]: L630-3 has no Hoare annotation [2018-11-23 12:52:43,274 WARN L170 areAnnotationChecker]: L632-3 has no Hoare annotation [2018-11-23 12:52:43,274 WARN L170 areAnnotationChecker]: L632-3 has no Hoare annotation [2018-11-23 12:52:43,274 WARN L170 areAnnotationChecker]: L632-4 has no Hoare annotation [2018-11-23 12:52:43,275 WARN L170 areAnnotationChecker]: L632-1 has no Hoare annotation [2018-11-23 12:52:43,275 WARN L170 areAnnotationChecker]: L632-1 has no Hoare annotation [2018-11-23 12:52:43,275 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2018-11-23 12:52:43,275 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2018-11-23 12:52:43,275 WARN L170 areAnnotationChecker]: L633 has no Hoare annotation [2018-11-23 12:52:43,275 WARN L170 areAnnotationChecker]: L633 has no Hoare annotation [2018-11-23 12:52:43,275 WARN L170 areAnnotationChecker]: L646-3 has no Hoare annotation [2018-11-23 12:52:43,283 WARN L170 areAnnotationChecker]: L646-3 has no Hoare annotation [2018-11-23 12:52:43,283 WARN L170 areAnnotationChecker]: L649-3 has no Hoare annotation [2018-11-23 12:52:43,283 WARN L170 areAnnotationChecker]: L649-3 has no Hoare annotation [2018-11-23 12:52:43,283 WARN L170 areAnnotationChecker]: L633-2 has no Hoare annotation [2018-11-23 12:52:43,283 WARN L170 areAnnotationChecker]: L649-4 has no Hoare annotation [2018-11-23 12:52:43,283 WARN L170 areAnnotationChecker]: L646-1 has no Hoare annotation [2018-11-23 12:52:43,284 WARN L170 areAnnotationChecker]: L646-1 has no Hoare annotation [2018-11-23 12:52:43,284 WARN L170 areAnnotationChecker]: L649-1 has no Hoare annotation [2018-11-23 12:52:43,284 WARN L170 areAnnotationChecker]: L649-1 has no Hoare annotation [2018-11-23 12:52:43,284 WARN L170 areAnnotationChecker]: L639 has no Hoare annotation [2018-11-23 12:52:43,284 WARN L170 areAnnotationChecker]: L639 has no Hoare annotation [2018-11-23 12:52:43,284 WARN L170 areAnnotationChecker]: L651 has no Hoare annotation [2018-11-23 12:52:43,284 WARN L170 areAnnotationChecker]: L651 has no Hoare annotation [2018-11-23 12:52:43,288 WARN L170 areAnnotationChecker]: L639-1 has no Hoare annotation [2018-11-23 12:52:43,288 WARN L170 areAnnotationChecker]: L639-1 has no Hoare annotation [2018-11-23 12:52:43,288 WARN L170 areAnnotationChecker]: L639-3 has no Hoare annotation [2018-11-23 12:52:43,288 WARN L170 areAnnotationChecker]: L652 has no Hoare annotation [2018-11-23 12:52:43,288 WARN L170 areAnnotationChecker]: L652 has no Hoare annotation [2018-11-23 12:52:43,288 WARN L170 areAnnotationChecker]: L651-2 has no Hoare annotation [2018-11-23 12:52:43,289 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:52:43,289 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:52:43,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:52:43 BoogieIcfgContainer [2018-11-23 12:52:43,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:52:43,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:52:43,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:52:43,295 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:52:43,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:38" (3/4) ... [2018-11-23 12:52:43,300 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|=16, |#NULL.offset|=10, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=10] [?] RET #91#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~flag~0 := #t~nondet0;havoc #t~nondet0;havoc ~p~0.base, ~p~0.offset;havoc ~a~0.base, ~a~0.offset;havoc ~t~0.base, ~t~0.offset;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~nondet2|=1] [?] assume !!(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] assume !(0 != ~flag~0);call write~int(2, ~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0] [?] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0, |main_#t~nondet2|=0] [?] assume !(0 != #t~nondet2);havoc #t~nondet2; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=17, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call write~int(3, ~p~0.base, ~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_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume !(0 != ~flag~0); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0, |main_#t~mem7|=2] [?] assume !(1 == #t~mem7);havoc #t~mem7; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0, |main_#t~mem9|=2] [?] assume 3 != #t~mem9;havoc #t~mem9; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] assume !false; VAL [main_~a~0.base=14, main_~a~0.offset=0, main_~flag~0=0, main_~p~0.base=14, main_~p~0.offset=0, main_~t~0.base=17, main_~t~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc1.base|=14, |main_#t~malloc1.offset|=0, |main_#t~malloc3.base|=17, |main_#t~malloc3.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0.base, ~p~0.offset; [L628] havoc ~a~0.base, ~a~0.offset; [L628] havoc ~t~0.base, ~t~0.offset; [L629] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8); [L629] ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L630] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~nondet2=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632-L642] assume !!(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L633-L637] assume !(0 != ~flag~0); [L636] call write~int(2, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L638] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L638] ~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L639] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L640] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L641] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset; [L641] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~nondet2=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632-L642] assume !(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L643] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L644] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645-L650] assume !(0 != ~flag~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem7=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649-L650] assume !(1 == #t~mem7); [L649] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem9=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651-L652] assume 3 != #t~mem9; [L651] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L652] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=10, old(#NULL.base)=16, old(#NULL.offset)=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0.base, ~p~0.offset; [L628] havoc ~a~0.base, ~a~0.offset; [L628] havoc ~t~0.base, ~t~0.offset; [L629] call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8); [L629] ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L630] assume !(~a~0.base == 0 && ~a~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0] [L631] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~nondet2=1, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L632-L642] assume !!(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L633-L637] assume !(0 != ~flag~0); [L636] call write~int(2, ~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0] [L638] call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8); [L638] ~t~0.base, ~t~0.offset := #t~malloc3.base, #t~malloc3.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L639] assume !(~t~0.base == 0 && ~t~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L640] call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4); [L641] call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); [L641] ~p~0.base, ~p~0.offset := #t~mem4.base, #t~mem4.offset; [L641] havoc #t~mem4.base, #t~mem4.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~nondet2=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L632-L642] assume !(0 != #t~nondet2); [L632] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=17, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L643] call write~int(3, ~p~0.base, ~p~0.offset, 4); [L644] ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L645-L650] assume !(0 != ~flag~0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649] call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem7=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L649-L650] assume !(1 == #t~mem7); [L649] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651] call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, #t~mem9=2, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L651-L652] assume 3 != #t~mem9; [L651] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [L652] assert false; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc1.base=14, #t~malloc1.offset=0, #t~malloc3.base=17, #t~malloc3.offset=0, ~a~0.base=14, ~a~0.offset=0, ~flag~0=0, ~p~0.base=14, ~p~0.offset=0, ~t~0.base=17, ~t~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=10, old(#NULL!base)=16, old(#NULL!offset)=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=10] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret10 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L627] ~flag~0 := #t~nondet0; [L627] havoc #t~nondet0; [L628] havoc ~p~0; [L628] havoc ~a~0; [L628] havoc ~t~0; [L629] FCALL call #t~malloc1 := #Ultimate.alloc(8); [L629] ~a~0 := #t~malloc1; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L630] COND FALSE !(~a~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0] [L631] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~nondet2=1, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L632-L642] COND FALSE !(!(0 != #t~nondet2)) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L633-L637] COND FALSE !(0 != ~flag~0) [L636] FCALL call write~int(2, { base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0] [L638] FCALL call #t~malloc3 := #Ultimate.alloc(8); [L638] ~t~0 := #t~malloc3; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L639] COND FALSE !(~t~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L640] FCALL call write~$Pointer$(~t~0, { base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] FCALL call #t~mem4 := read~$Pointer$({ base: ~p~0!base, offset: 4 + ~p~0!offset }, 4); [L641] ~p~0 := #t~mem4; [L641] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~nondet2=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L632-L642] COND TRUE !(0 != #t~nondet2) [L632] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=17, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L643] FCALL call write~int(3, { base: ~p~0!base, offset: ~p~0!offset }, 4); [L644] ~p~0 := ~a~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L645-L650] COND FALSE !(0 != ~flag~0) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649] FCALL call #t~mem7 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem7=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L649-L650] COND TRUE !(1 == #t~mem7) [L649] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] FCALL call #t~mem9 := read~int({ base: ~p~0!base, offset: ~p~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, #t~mem9=2, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L651] COND TRUE 3 != #t~mem9 [L651] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L652] assert false; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc1!base=14, #t~malloc1!offset=0, #t~malloc3!base=17, #t~malloc3!offset=0, ~a~0!base=14, ~a~0!offset=0, ~flag~0=0, ~p~0!base=14, ~p~0!offset=0, ~t~0!base=17, ~t~0!offset=0] [L627] int flag = __VERIFIER_nondet_int(); [L628] List p, a, t; [L629] a = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}] [L630] COND FALSE !(a == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}] [L631] p = a VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L636] p->h = 2 VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L638] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L639] COND FALSE !(t == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L640] p->n = t [L641] EXPR p->n [L641] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L643] p->h = 3 [L644] p = a VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L645] COND FALSE !(\read(flag)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L649] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, p->h=2, t={17:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, p->h=2, t={17:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] ----- [2018-11-23 12:52:43,409 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-properties/list_flag_false-unreach-call_false-valid-memcleanup.i-witness.graphml [2018-11-23 12:52:43,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:52:43,411 INFO L168 Benchmark]: Toolchain (without parser) took 6014.70 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -516.4 MB). Peak memory consumption was 232.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:43,413 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:52:43,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.49 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:43,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.44 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:43,415 INFO L168 Benchmark]: Boogie Preprocessor took 40.55 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:52:43,415 INFO L168 Benchmark]: RCFGBuilder took 783.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:43,416 INFO L168 Benchmark]: TraceAbstraction took 4344.27 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 248.5 MB). Peak memory consumption was 248.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:43,416 INFO L168 Benchmark]: Witness Printer took 115.26 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:52:43,420 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.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 609.49 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 115.44 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.2 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.55 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 783.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4344.27 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 248.5 MB). Peak memory consumption was 248.5 MB. Max. memory is 7.1 GB. * Witness Printer took 115.26 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] int flag = __VERIFIER_nondet_int(); [L628] List p, a, t; [L629] a = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}] [L630] COND FALSE !(a == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}] [L631] p = a VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L632] COND TRUE __VERIFIER_nondet_int() [L633] COND FALSE !(\read(flag)) [L636] p->h = 2 VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, p={14:0}] [L638] t = (List) malloc(sizeof(struct node)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L639] COND FALSE !(t == 0) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L640] p->n = t [L641] EXPR p->n [L641] p = p->n [L632] COND FALSE !(__VERIFIER_nondet_int()) [L643] p->h = 3 [L644] p = a VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L645] COND FALSE !(\read(flag)) VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] [L649] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, p->h=2, t={17:0}] [L649] COND FALSE !(p->h == 1) [L651] EXPR p->h VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, p->h=2, t={17:0}] [L651] COND TRUE p->h != 3 [L652] __VERIFIER_error() VAL [a={14:0}, flag=0, malloc(sizeof(struct node))={14:0}, malloc(sizeof(struct node))={17:0}, p={14:0}, t={17:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 1 error locations. UNSAFE Result, 4.2s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 101 SDtfs, 63 SDslu, 159 SDs, 0 SdLazy, 127 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 36 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 2956 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...