java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test02_false-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:11,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:11,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:11,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:11,294 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:11,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:11,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:11,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:11,300 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:11,301 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:11,302 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:11,302 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:11,303 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:11,304 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:11,305 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:11,306 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:11,307 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:11,309 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:11,311 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:11,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:11,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:11,323 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:11,326 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:11,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:11,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:11,328 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:11,329 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:11,330 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:11,332 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:11,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:11,336 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:11,337 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:11,337 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:11,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:11,341 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:11,342 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:11,342 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:54:11,374 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:11,374 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:11,375 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:11,375 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:11,376 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:11,376 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:11,376 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:11,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:11,378 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:11,378 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:11,378 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:11,379 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:11,379 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:11,379 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:11,379 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:11,379 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:11,379 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:11,380 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:11,380 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:11,380 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:11,380 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:11,380 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:11,382 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:11,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:11,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:11,383 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:11,383 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:11,383 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:11,383 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:11,383 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:11,384 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:11,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:11,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:11,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:11,477 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:11,478 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:11,479 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test02_false-unreach-call_true-termination.c [2018-11-23 12:54:11,545 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb8a7c6d/301deeb043fb4abc823dedcaad07f0ef/FLAG71d68f7ee [2018-11-23 12:54:11,986 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:11,987 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test02_false-unreach-call_true-termination.c [2018-11-23 12:54:11,993 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb8a7c6d/301deeb043fb4abc823dedcaad07f0ef/FLAG71d68f7ee [2018-11-23 12:54:12,381 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb8a7c6d/301deeb043fb4abc823dedcaad07f0ef [2018-11-23 12:54:12,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:12,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:12,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:12,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:12,397 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:12,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:12" (1/1) ... [2018-11-23 12:54:12,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4597faa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:12, skipping insertion in model container [2018-11-23 12:54:12,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:12" (1/1) ... [2018-11-23 12:54:12,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:12,433 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:12,628 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:12,636 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:12,655 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:12,677 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:12,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:12 WrapperNode [2018-11-23 12:54:12,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:12,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:12,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:12,679 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:12,689 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:54:12" (1/1) ... [2018-11-23 12:54:12,698 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:54:12" (1/1) ... [2018-11-23 12:54:12,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:12,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:12,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:12,708 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:12,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:12" (1/1) ... [2018-11-23 12:54:12,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:12" (1/1) ... [2018-11-23 12:54:12,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:12" (1/1) ... [2018-11-23 12:54:12,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:12" (1/1) ... [2018-11-23 12:54:12,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:12" (1/1) ... [2018-11-23 12:54:12,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:12" (1/1) ... [2018-11-23 12:54:12,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:12" (1/1) ... [2018-11-23 12:54:12,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:12,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:12,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:12,734 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:12,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:12" (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:54:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:12,861 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:12,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:13,233 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:13,233 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:54:13,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:13 BoogieIcfgContainer [2018-11-23 12:54:13,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:13,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:13,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:13,238 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:13,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:54:12" (1/3) ... [2018-11-23 12:54:13,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cccf7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:13, skipping insertion in model container [2018-11-23 12:54:13,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:12" (2/3) ... [2018-11-23 12:54:13,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cccf7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:13, skipping insertion in model container [2018-11-23 12:54:13,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:13" (3/3) ... [2018-11-23 12:54:13,241 INFO L112 eAbstractionObserver]: Analyzing ICFG test02_false-unreach-call_true-termination.c [2018-11-23 12:54:13,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:13,260 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:13,276 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:13,309 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:13,310 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:13,310 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:13,310 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:13,310 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:13,310 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:13,310 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:13,310 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:13,310 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-11-23 12:54:13,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 12:54:13,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:13,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:13,340 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:13,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:13,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1160017433, now seen corresponding path program 1 times [2018-11-23 12:54:13,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:13,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:13,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:13,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:13,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:13,485 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=8, |#NULL.offset|=5, |old(#NULL.base)|=8, |old(#NULL.offset)|=5, |old(~q~0)|=6, ~q~0=6] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~q~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5, |old(~q~0)|=6, ~q~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5, |old(~q~0)|=6, ~q~0=0] [?] RET #15#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~q~0)|=0, ~q~0=0] [?] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);havoc ~b~0;~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset;~p2~0.base, ~p2~0.offset := ~p1~0.base, ~p1~0.offset;~q~0 := 0; VAL [main_~p1~0.base=7, main_~p1~0.offset=0, main_~p2~0.base=7, main_~p2~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=7, |main_~#a~0.offset|=0, |old(~q~0)|=0, ~q~0=0] [?] assume ~p1~0.base == ~p2~0.base && ~p1~0.offset == ~p2~0.offset; VAL [main_~p1~0.base=7, main_~p1~0.offset=0, main_~p2~0.base=7, main_~p2~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=7, |main_~#a~0.offset|=0, |old(~q~0)|=0, ~q~0=0] [?] assume !false; VAL [main_~p1~0.base=7, main_~p1~0.offset=0, main_~p2~0.base=7, main_~p2~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=7, |main_~#a~0.offset|=0, |old(~q~0)|=0, ~q~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=8, #NULL.offset=5, old(#NULL.base)=8, old(#NULL.offset)=5, old(~q~0)=6, ~q~0=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] ~q~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5, old(~q~0)=6, ~q~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5, old(~q~0)=6, ~q~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~q~0=0] [L7] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4); [L7] havoc ~b~0; [L8] ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; [L9] ~p2~0.base, ~p2~0.offset := ~p1~0.base, ~p1~0.offset; [L11] ~q~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~#a~0.base=7, ~#a~0.offset=0, ~p1~0.base=7, ~p1~0.offset=0, ~p2~0.base=7, ~p2~0.offset=0, ~q~0=0] [L13-L15] assume ~p1~0.base == ~p2~0.base && ~p1~0.offset == ~p2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~#a~0.base=7, ~#a~0.offset=0, ~p1~0.base=7, ~p1~0.offset=0, ~p2~0.base=7, ~p2~0.offset=0, ~q~0=0] [L19] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~#a~0.base=7, ~#a~0.offset=0, ~p1~0.base=7, ~p1~0.offset=0, ~p2~0.base=7, ~p2~0.offset=0, ~q~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=8, #NULL.offset=5, old(#NULL.base)=8, old(#NULL.offset)=5, old(~q~0)=6, ~q~0=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] ~q~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5, old(~q~0)=6, ~q~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5, old(~q~0)=6, ~q~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~q~0=0] [L7] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4); [L7] havoc ~b~0; [L8] ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; [L9] ~p2~0.base, ~p2~0.offset := ~p1~0.base, ~p1~0.offset; [L11] ~q~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~#a~0.base=7, ~#a~0.offset=0, ~p1~0.base=7, ~p1~0.offset=0, ~p2~0.base=7, ~p2~0.offset=0, ~q~0=0] [L13-L15] assume ~p1~0.base == ~p2~0.base && ~p1~0.offset == ~p2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~#a~0.base=7, ~#a~0.offset=0, ~p1~0.base=7, ~p1~0.offset=0, ~p2~0.base=7, ~p2~0.offset=0, ~q~0=0] [L19] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~#a~0.base=7, ~#a~0.offset=0, ~p1~0.base=7, ~p1~0.offset=0, ~p2~0.base=7, ~p2~0.offset=0, ~q~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~q~0=0] [L7] FCALL call ~#a~0 := #Ultimate.alloc(4); [L7] havoc ~b~0; [L8] ~p1~0 := ~#a~0; [L9] ~p2~0 := ~p1~0; [L11] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L13] COND TRUE ~p1~0 == ~p2~0 VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L19] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~q~0=0] [L7] FCALL call ~#a~0 := #Ultimate.alloc(4); [L7] havoc ~b~0; [L8] ~p1~0 := ~#a~0; [L9] ~p2~0 := ~p1~0; [L11] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L13] COND TRUE ~p1~0 == ~p2~0 VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L19] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~q~0=0] [L7] FCALL call ~#a~0 := #Ultimate.alloc(4); [L7] havoc ~b~0; [L8] ~p1~0 := ~#a~0; [L9] ~p2~0 := ~p1~0; [L11] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L13] COND TRUE ~p1~0 == ~p2~0 VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L19] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~q~0=0] [L7] FCALL call ~#a~0 := #Ultimate.alloc(4); [L7] havoc ~b~0; [L8] ~p1~0 := ~#a~0; [L9] ~p2~0 := ~p1~0; [L11] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L13] COND TRUE ~p1~0 == ~p2~0 VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L19] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L4] int q; VAL [\old(q)=6, q=0] [L7] int a, b; [L8] int *p1 = &a; [L9] int *p2 = p1; [L11] q = 0 VAL [\old(q)=0, a={7:0}, p1={7:0}, p2={7:0}, q=0] [L13] COND TRUE p1 == p2 VAL [\old(q)=0, a={7:0}, p1={7:0}, p2={7:0}, q=0] [L19] __VERIFIER_error() VAL [\old(q)=0, a={7:0}, p1={7:0}, p2={7:0}, q=0] ----- [2018-11-23 12:54:13,533 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:54:13,534 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:54:13,534 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:54:13,534 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:54:13,534 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:13,535 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:54:13,535 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:54:13,535 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 12:54:13,535 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 12:54:13,535 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:54:13,536 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:13,536 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 12:54:13,536 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 12:54:13,536 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:13,536 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:54:13,537 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:54:13,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:54:13 BoogieIcfgContainer [2018-11-23 12:54:13,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:54:13,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:54:13,540 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:54:13,541 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:54:13,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:13" (3/4) ... [2018-11-23 12:54:13,544 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|=8, |#NULL.offset|=5, |old(#NULL.base)|=8, |old(#NULL.offset)|=5, |old(~q~0)|=6, ~q~0=6] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~q~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5, |old(~q~0)|=6, ~q~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5, |old(~q~0)|=6, ~q~0=0] [?] RET #15#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~q~0)|=0, ~q~0=0] [?] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4);havoc ~b~0;~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset;~p2~0.base, ~p2~0.offset := ~p1~0.base, ~p1~0.offset;~q~0 := 0; VAL [main_~p1~0.base=7, main_~p1~0.offset=0, main_~p2~0.base=7, main_~p2~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=7, |main_~#a~0.offset|=0, |old(~q~0)|=0, ~q~0=0] [?] assume ~p1~0.base == ~p2~0.base && ~p1~0.offset == ~p2~0.offset; VAL [main_~p1~0.base=7, main_~p1~0.offset=0, main_~p2~0.base=7, main_~p2~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=7, |main_~#a~0.offset|=0, |old(~q~0)|=0, ~q~0=0] [?] assume !false; VAL [main_~p1~0.base=7, main_~p1~0.offset=0, main_~p2~0.base=7, main_~p2~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=7, |main_~#a~0.offset|=0, |old(~q~0)|=0, ~q~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=8, #NULL.offset=5, old(#NULL.base)=8, old(#NULL.offset)=5, old(~q~0)=6, ~q~0=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] ~q~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5, old(~q~0)=6, ~q~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5, old(~q~0)=6, ~q~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~q~0=0] [L7] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4); [L7] havoc ~b~0; [L8] ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; [L9] ~p2~0.base, ~p2~0.offset := ~p1~0.base, ~p1~0.offset; [L11] ~q~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~#a~0.base=7, ~#a~0.offset=0, ~p1~0.base=7, ~p1~0.offset=0, ~p2~0.base=7, ~p2~0.offset=0, ~q~0=0] [L13-L15] assume ~p1~0.base == ~p2~0.base && ~p1~0.offset == ~p2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~#a~0.base=7, ~#a~0.offset=0, ~p1~0.base=7, ~p1~0.offset=0, ~p2~0.base=7, ~p2~0.offset=0, ~q~0=0] [L19] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~#a~0.base=7, ~#a~0.offset=0, ~p1~0.base=7, ~p1~0.offset=0, ~p2~0.base=7, ~p2~0.offset=0, ~q~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=8, #NULL.offset=5, old(#NULL.base)=8, old(#NULL.offset)=5, old(~q~0)=6, ~q~0=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L4] ~q~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5, old(~q~0)=6, ~q~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5, old(~q~0)=6, ~q~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~q~0=0] [L7] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4); [L7] havoc ~b~0; [L8] ~p1~0.base, ~p1~0.offset := ~#a~0.base, ~#a~0.offset; [L9] ~p2~0.base, ~p2~0.offset := ~p1~0.base, ~p1~0.offset; [L11] ~q~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~#a~0.base=7, ~#a~0.offset=0, ~p1~0.base=7, ~p1~0.offset=0, ~p2~0.base=7, ~p2~0.offset=0, ~q~0=0] [L13-L15] assume ~p1~0.base == ~p2~0.base && ~p1~0.offset == ~p2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~#a~0.base=7, ~#a~0.offset=0, ~p1~0.base=7, ~p1~0.offset=0, ~p2~0.base=7, ~p2~0.offset=0, ~q~0=0] [L19] assert false; VAL [#NULL.base=0, #NULL.offset=0, old(~q~0)=0, ~#a~0.base=7, ~#a~0.offset=0, ~p1~0.base=7, ~p1~0.offset=0, ~p2~0.base=7, ~p2~0.offset=0, ~q~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~q~0=0] [L7] FCALL call ~#a~0 := #Ultimate.alloc(4); [L7] havoc ~b~0; [L8] ~p1~0 := ~#a~0; [L9] ~p2~0 := ~p1~0; [L11] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L13] COND TRUE ~p1~0 == ~p2~0 VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L19] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~q~0=0] [L7] FCALL call ~#a~0 := #Ultimate.alloc(4); [L7] havoc ~b~0; [L8] ~p1~0 := ~#a~0; [L9] ~p2~0 := ~p1~0; [L11] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L13] COND TRUE ~p1~0 == ~p2~0 VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L19] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~q~0=0] [L7] FCALL call ~#a~0 := #Ultimate.alloc(4); [L7] havoc ~b~0; [L8] ~p1~0 := ~#a~0; [L9] ~p2~0 := ~p1~0; [L11] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L13] COND TRUE ~p1~0 == ~p2~0 VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L19] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L4] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5, old(~q~0)=6, ~q~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~q~0=0] [?] CALL call #t~ret0 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~q~0=0] [L7] FCALL call ~#a~0 := #Ultimate.alloc(4); [L7] havoc ~b~0; [L8] ~p1~0 := ~#a~0; [L9] ~p2~0 := ~p1~0; [L11] ~q~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L13] COND TRUE ~p1~0 == ~p2~0 VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L19] assert false; VAL [#NULL!base=0, #NULL!offset=0, old(~q~0)=0, ~#a~0!base=7, ~#a~0!offset=0, ~p1~0!base=7, ~p1~0!offset=0, ~p2~0!base=7, ~p2~0!offset=0, ~q~0=0] [L4] int q; VAL [\old(q)=6, q=0] [L7] int a, b; [L8] int *p1 = &a; [L9] int *p2 = p1; [L11] q = 0 VAL [\old(q)=0, a={7:0}, p1={7:0}, p2={7:0}, q=0] [L13] COND TRUE p1 == p2 VAL [\old(q)=0, a={7:0}, p1={7:0}, p2={7:0}, q=0] [L19] __VERIFIER_error() VAL [\old(q)=0, a={7:0}, p1={7:0}, p2={7:0}, q=0] ----- [2018-11-23 12:54:13,606 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test02_false-unreach-call_true-termination.c-witness.graphml [2018-11-23 12:54:13,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:54:13,608 INFO L168 Benchmark]: Toolchain (without parser) took 1216.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -737.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:13,610 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:13,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:13,612 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:13,615 INFO L168 Benchmark]: Boogie Preprocessor took 25.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:13,616 INFO L168 Benchmark]: RCFGBuilder took 500.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:13,617 INFO L168 Benchmark]: TraceAbstraction took 305.30 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: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:13,617 INFO L168 Benchmark]: Witness Printer took 66.82 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:13,622 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 284.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 500.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 305.30 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: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * Witness Printer took 66.82 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L4] int q; VAL [\old(q)=6, q=0] [L7] int a, b; [L8] int *p1 = &a; [L9] int *p2 = p1; [L11] q = 0 VAL [\old(q)=0, a={7:0}, p1={7:0}, p2={7:0}, q=0] [L13] COND TRUE p1 == p2 VAL [\old(q)=0, a={7:0}, p1={7:0}, p2={7:0}, q=0] [L19] __VERIFIER_error() VAL [\old(q)=0, a={7:0}, p1={7:0}, p2={7:0}, q=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 13 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...