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/test29_false-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:22,015 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:22,017 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:22,033 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:22,033 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:22,035 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:22,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:22,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:22,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:22,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:22,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:22,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:22,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:22,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:22,053 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:22,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:22,060 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:22,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:22,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:22,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:22,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:22,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:22,077 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:22,077 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:22,078 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:22,079 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:22,081 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:22,082 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:22,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:22,086 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:22,086 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:22,087 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:22,088 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:22,088 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:22,090 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:22,090 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:22,091 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:22,115 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:22,115 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:22,117 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:22,117 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:22,118 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:22,118 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:22,118 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:22,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:22,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:22,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:22,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:22,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:22,120 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:22,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:22,120 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:22,120 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:22,120 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:22,120 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:22,122 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:22,122 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:22,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:22,122 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:22,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:22,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:22,123 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:22,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:22,124 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:22,124 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:22,124 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:22,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:22,124 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:22,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:22,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:22,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:22,206 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:22,206 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:22,207 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test29_false-unreach-call_true-termination.c [2018-11-23 12:54:22,269 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d0d8dc3/3e8ea192b3ec4b04bcd39c9083271282/FLAG1c4b9071b [2018-11-23 12:54:22,701 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:22,701 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test29_false-unreach-call_true-termination.c [2018-11-23 12:54:22,706 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d0d8dc3/3e8ea192b3ec4b04bcd39c9083271282/FLAG1c4b9071b [2018-11-23 12:54:23,064 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d0d8dc3/3e8ea192b3ec4b04bcd39c9083271282 [2018-11-23 12:54:23,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:23,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:23,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:23,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:23,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:23,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:23" (1/1) ... [2018-11-23 12:54:23,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49920525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23, skipping insertion in model container [2018-11-23 12:54:23,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:23" (1/1) ... [2018-11-23 12:54:23,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:23,126 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:23,387 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:23,403 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:23,431 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:23,457 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:23,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23 WrapperNode [2018-11-23 12:54:23,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:23,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:23,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:23,459 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:23,470 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:23" (1/1) ... [2018-11-23 12:54:23,481 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:23" (1/1) ... [2018-11-23 12:54:23,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:23,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:23,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:23,492 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:23,502 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:23" (1/1) ... [2018-11-23 12:54:23,503 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:23" (1/1) ... [2018-11-23 12:54:23,504 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:23" (1/1) ... [2018-11-23 12:54:23,505 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:23" (1/1) ... [2018-11-23 12:54:23,519 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:23" (1/1) ... [2018-11-23 12:54:23,522 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:23" (1/1) ... [2018-11-23 12:54:23,524 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:23" (1/1) ... [2018-11-23 12:54:23,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:23,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:23,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:23,527 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:23,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (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:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:23,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:23,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:23,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:23,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:23,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:23,692 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:23,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:24,169 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:24,170 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:54:24,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:24 BoogieIcfgContainer [2018-11-23 12:54:24,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:24,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:24,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:24,175 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:24,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:54:23" (1/3) ... [2018-11-23 12:54:24,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57253b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:24, skipping insertion in model container [2018-11-23 12:54:24,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:23" (2/3) ... [2018-11-23 12:54:24,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57253b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:24, skipping insertion in model container [2018-11-23 12:54:24,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:24" (3/3) ... [2018-11-23 12:54:24,179 INFO L112 eAbstractionObserver]: Analyzing ICFG test29_false-unreach-call_true-termination.c [2018-11-23 12:54:24,189 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:24,197 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:24,216 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:24,249 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:24,250 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:24,250 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:24,250 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:24,251 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:24,251 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:24,251 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:24,252 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:24,252 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 12:54:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:54:24,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:24,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:24,279 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:24,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:24,284 INFO L82 PathProgramCache]: Analyzing trace with hash 668850033, now seen corresponding path program 1 times [2018-11-23 12:54:24,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:24,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:24,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:24,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 12:54:24,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21#true} is VALID [2018-11-23 12:54:24,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 12:54:24,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #35#return; {21#true} is VALID [2018-11-23 12:54:24,623 INFO L256 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2018-11-23 12:54:24,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {21#true} is VALID [2018-11-23 12:54:24,624 INFO L273 TraceCheckUtils]: 6: Hoare triple {21#true} assume 0 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {23#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (= |main_~#d1~0.offset| |main_#t~ite1.offset|))} is VALID [2018-11-23 12:54:24,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (= |main_~#d1~0.offset| |main_#t~ite1.offset|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet2; {24#(and (= main_~pd~0.base |main_~#d1~0.base|) (= |main_~#d1~0.offset| main_~pd~0.offset))} is VALID [2018-11-23 12:54:24,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#(and (= main_~pd~0.base |main_~#d1~0.base|) (= |main_~#d1~0.offset| main_~pd~0.offset))} assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int(0, ~pd~0.base, ~pd~0.offset, 1); {22#false} is VALID [2018-11-23 12:54:24,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} #t~short4 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {22#false} is VALID [2018-11-23 12:54:24,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {22#false} assume #t~short4;call #t~mem3 := read~int(~#d1~0.base, ~#d1~0.offset, 4);#t~short4 := 0 != #t~mem3; {22#false} is VALID [2018-11-23 12:54:24,648 INFO L273 TraceCheckUtils]: 11: Hoare triple {22#false} assume #t~short4;havoc #t~short4;havoc #t~mem3; {22#false} is VALID [2018-11-23 12:54:24,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 12:54:24,652 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:54:24,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:24,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:54:24,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 12:54:24,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:24,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:54:24,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:24,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:54:24,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:54:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:54:24,766 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2018-11-23 12:54:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:25,142 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-23 12:54:25,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:54:25,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 12:54:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:54:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-23 12:54:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:54:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-23 12:54:25,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2018-11-23 12:54:25,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:25,379 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:54:25,380 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:54:25,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:54:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:54:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-11-23 12:54:25,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:25,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 16 states. [2018-11-23 12:54:25,483 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 16 states. [2018-11-23 12:54:25,483 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 16 states. [2018-11-23 12:54:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:25,487 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 12:54:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:54:25,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:25,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:25,489 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 21 states. [2018-11-23 12:54:25,489 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 21 states. [2018-11-23 12:54:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:25,493 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 12:54:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 12:54:25,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:25,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:25,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:25,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:54:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 12:54:25,502 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-11-23 12:54:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:25,503 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 12:54:25,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:54:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 12:54:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:54:25,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:25,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:25,504 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:25,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:25,505 INFO L82 PathProgramCache]: Analyzing trace with hash 667002991, now seen corresponding path program 1 times [2018-11-23 12:54:25,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:25,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:25,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:25,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:25,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:25,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {131#true} call ULTIMATE.init(); {131#true} is VALID [2018-11-23 12:54:25,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {131#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {131#true} is VALID [2018-11-23 12:54:25,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {131#true} assume true; {131#true} is VALID [2018-11-23 12:54:25,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {131#true} {131#true} #35#return; {131#true} is VALID [2018-11-23 12:54:25,785 INFO L256 TraceCheckUtils]: 4: Hoare triple {131#true} call #t~ret5 := main(); {131#true} is VALID [2018-11-23 12:54:25,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {131#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {133#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2018-11-23 12:54:25,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {133#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume 0 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {134#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_#t~ite1.base| |main_~#d1~0.base|))} is VALID [2018-11-23 12:54:25,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {134#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_#t~ite1.base| |main_~#d1~0.base|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet2; {135#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= main_~pd~0.base |main_~#d1~0.base|))} is VALID [2018-11-23 12:54:25,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {135#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= main_~pd~0.base |main_~#d1~0.base|))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int(0, ~pd~0.base, ~pd~0.offset, 4); {135#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= main_~pd~0.base |main_~#d1~0.base|))} is VALID [2018-11-23 12:54:25,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {135#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= main_~pd~0.base |main_~#d1~0.base|))} #t~short4 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {136#(not |main_#t~short4|)} is VALID [2018-11-23 12:54:25,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#(not |main_#t~short4|)} assume #t~short4;call #t~mem3 := read~int(~#d1~0.base, ~#d1~0.offset, 4);#t~short4 := 0 != #t~mem3; {132#false} is VALID [2018-11-23 12:54:25,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {132#false} assume #t~short4;havoc #t~short4;havoc #t~mem3; {132#false} is VALID [2018-11-23 12:54:25,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {132#false} assume !false; {132#false} is VALID [2018-11-23 12:54:25,820 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:54:25,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:25,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:54:25,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 12:54:25,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:25,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:54:25,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:25,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:54:25,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:54:25,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:54:25,865 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 6 states. [2018-11-23 12:54:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,452 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 12:54:26,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:54:26,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 12:54:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:54:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-23 12:54:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:54:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-23 12:54:26,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 25 transitions. [2018-11-23 12:54:26,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:26,496 INFO L225 Difference]: With dead ends: 23 [2018-11-23 12:54:26,496 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 12:54:26,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:26,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 12:54:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 12:54:26,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:26,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,507 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,508 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,509 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2018-11-23 12:54:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 12:54:26,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,510 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,510 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 12:54:26,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,512 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2018-11-23 12:54:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 12:54:26,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:26,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:54:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2018-11-23 12:54:26,515 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2018-11-23 12:54:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:26,515 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2018-11-23 12:54:26,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:54:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 12:54:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:54:26,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:26,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:26,517 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:26,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:26,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1851109901, now seen corresponding path program 1 times [2018-11-23 12:54:26,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:26,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:26,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:26,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:26,614 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] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] RET #35#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; VAL [main_~n~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] assume !(0 != ~n~0);#t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [main_~n~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ite1.base|=6, |main_#t~ite1.offset|=0, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet2; VAL [main_~n~0=0, main_~pd~0.base=6, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int(0, ~pd~0.base, ~pd~0.offset, 1); VAL [main_~n~0=0, main_~pd~0.base=6, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] #t~short4 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [main_~n~0=0, main_~pd~0.base=6, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short4|=true, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] assume #t~short4;call #t~mem3 := read~int(~#d1~0.base, ~#d1~0.offset, 4);#t~short4 := 0 != #t~mem3; VAL [main_~n~0=0, main_~pd~0.base=6, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=1, |main_#t~short4|=true, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] assume #t~short4;havoc #t~short4;havoc #t~mem3; VAL [main_~n~0=0, main_~pd~0.base=6, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] assume !false; VAL [main_~n~0=0, main_~pd~0.base=6, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=8, #NULL.offset=5, old(#NULL.base)=8, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4); [L13] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4); [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~n~0 := #t~nondet0; [L14] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0] [L15] assume !(0 != ~n~0); [L15] #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite1.base=6, #t~ite1.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0] [L15] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; [L15] havoc #t~ite1.base, #t~ite1.offset; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] call write~int(#t~nondet2, ~#d1~0.base, ~#d1~0.offset, 4); [L16] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L17-L21] assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset); [L20] call write~int(0, ~pd~0.base, ~pd~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L22] #t~short4 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L22] assume #t~short4; [L22] call #t~mem3 := read~int(~#d1~0.base, ~#d1~0.offset, 4); [L22] #t~short4 := 0 != #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, #t~short4=true, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L22-L24] assume #t~short4; [L22] havoc #t~short4; [L22] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L28] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=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] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4); [L13] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4); [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~n~0 := #t~nondet0; [L14] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0] [L15] assume !(0 != ~n~0); [L15] #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite1.base=6, #t~ite1.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0] [L15] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; [L15] havoc #t~ite1.base, #t~ite1.offset; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] call write~int(#t~nondet2, ~#d1~0.base, ~#d1~0.offset, 4); [L16] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L17-L21] assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset); [L20] call write~int(0, ~pd~0.base, ~pd~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L22] #t~short4 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L22] assume #t~short4; [L22] call #t~mem3 := read~int(~#d1~0.base, ~#d1~0.offset, 4); [L22] #t~short4 := 0 != #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, #t~short4=true, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L22-L24] assume #t~short4; [L22] havoc #t~short4; [L22] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L28] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#d1~0 := #Ultimate.alloc(4); [L13] FCALL call ~#d2~0 := #Ultimate.alloc(4); [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~n~0 := #t~nondet0; [L14] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] COND FALSE !(0 != ~n~0) [L15] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=6, #t~ite1!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] ~pd~0 := #t~ite1; [L15] havoc #t~ite1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L16] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L17] COND FALSE !(~pd~0 == ~#d1~0) [L20] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] #t~short4 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] FCALL call #t~mem3 := read~int({ base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L22] #t~short4 := 0 != #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] havoc #t~short4; [L22] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L28] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=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] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#d1~0 := #Ultimate.alloc(4); [L13] FCALL call ~#d2~0 := #Ultimate.alloc(4); [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~n~0 := #t~nondet0; [L14] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] COND FALSE !(0 != ~n~0) [L15] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=6, #t~ite1!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] ~pd~0 := #t~ite1; [L15] havoc #t~ite1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L16] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L17] COND FALSE !(~pd~0 == ~#d1~0) [L20] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] #t~short4 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] FCALL call #t~mem3 := read~int({ base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L22] #t~short4 := 0 != #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] havoc #t~short4; [L22] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L28] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#d1~0 := #Ultimate.alloc(4); [L13] FCALL call ~#d2~0 := #Ultimate.alloc(4); [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~n~0 := #t~nondet0; [L14] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] COND FALSE !(0 != ~n~0) [L15] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=6, #t~ite1!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] ~pd~0 := #t~ite1; [L15] havoc #t~ite1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L16] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L17] COND FALSE !(~pd~0 == ~#d1~0) [L20] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] #t~short4 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] FCALL call #t~mem3 := read~int({ base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L22] #t~short4 := 0 != #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] havoc #t~short4; [L22] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L28] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=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] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#d1~0 := #Ultimate.alloc(4); [L13] FCALL call ~#d2~0 := #Ultimate.alloc(4); [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~n~0 := #t~nondet0; [L14] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] COND FALSE !(0 != ~n~0) [L15] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=6, #t~ite1!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] ~pd~0 := #t~ite1; [L15] havoc #t~ite1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L16] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L17] COND FALSE !(~pd~0 == ~#d1~0) [L20] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] #t~short4 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] FCALL call #t~mem3 := read~int({ base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L22] #t~short4 := 0 != #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] havoc #t~short4; [L22] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L28] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L13] union dummy d1, d2; [L14] int n = __VERIFIER_nondet_int(); [L15] EXPR n ? &d1 : &d2 VAL [d1={7:0}, d2={6:0}, n=0, n ? &d1 : &d2={6:0}] [L15] union dummy *pd = n ? &d1 : &d2; [L16] d1.a = __VERIFIER_nondet_int() [L17] COND FALSE !(pd == &d1) [L20] pd->b = 0 VAL [d1={7:0}, d2={6:0}, n=0, pd={6:0}] [L22] pd == &d2 && d1.a != 0 [L22] EXPR d1.a [L22] pd == &d2 && d1.a != 0 VAL [d1={7:0}, d1.a=1, d2={6:0}, n=0, pd={6:0}, pd == &d2 && d1.a != 0=1] [L22] COND TRUE pd == &d2 && d1.a != 0 [L28] __VERIFIER_error() VAL [d1={7:0}, d2={6:0}, n=0, pd={6:0}] ----- [2018-11-23 12:54:26,668 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:54:26,668 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:54:26,668 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:54:26,668 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:54:26,669 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:26,669 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:54:26,669 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:54:26,669 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 12:54:26,669 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 12:54:26,669 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:54:26,670 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:26,670 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2018-11-23 12:54:26,670 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 12:54:26,670 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 12:54:26,670 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2018-11-23 12:54:26,670 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 12:54:26,671 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 12:54:26,671 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2018-11-23 12:54:26,671 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2018-11-23 12:54:26,671 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 12:54:26,671 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 12:54:26,671 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:26,672 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:54:26,672 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:26,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:54:26 BoogieIcfgContainer [2018-11-23 12:54:26,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:54:26,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:54:26,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:54:26,676 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:54:26,676 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:24" (3/4) ... [2018-11-23 12:54:26,679 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] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] RET #35#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; VAL [main_~n~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] assume !(0 != ~n~0);#t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [main_~n~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ite1.base|=6, |main_#t~ite1.offset|=0, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet2; VAL [main_~n~0=0, main_~pd~0.base=6, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int(0, ~pd~0.base, ~pd~0.offset, 1); VAL [main_~n~0=0, main_~pd~0.base=6, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] #t~short4 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [main_~n~0=0, main_~pd~0.base=6, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short4|=true, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] assume #t~short4;call #t~mem3 := read~int(~#d1~0.base, ~#d1~0.offset, 4);#t~short4 := 0 != #t~mem3; VAL [main_~n~0=0, main_~pd~0.base=6, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=1, |main_#t~short4|=true, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] assume #t~short4;havoc #t~short4;havoc #t~mem3; VAL [main_~n~0=0, main_~pd~0.base=6, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] assume !false; VAL [main_~n~0=0, main_~pd~0.base=6, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=7, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=6, |main_~#d2~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=8, #NULL.offset=5, old(#NULL.base)=8, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4); [L13] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4); [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~n~0 := #t~nondet0; [L14] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0] [L15] assume !(0 != ~n~0); [L15] #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite1.base=6, #t~ite1.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0] [L15] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; [L15] havoc #t~ite1.base, #t~ite1.offset; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] call write~int(#t~nondet2, ~#d1~0.base, ~#d1~0.offset, 4); [L16] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L17-L21] assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset); [L20] call write~int(0, ~pd~0.base, ~pd~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L22] #t~short4 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L22] assume #t~short4; [L22] call #t~mem3 := read~int(~#d1~0.base, ~#d1~0.offset, 4); [L22] #t~short4 := 0 != #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, #t~short4=true, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L22-L24] assume #t~short4; [L22] havoc #t~short4; [L22] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L28] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=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] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(4); [L13] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(4); [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~n~0 := #t~nondet0; [L14] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0] [L15] assume !(0 != ~n~0); [L15] #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite1.base=6, #t~ite1.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0] [L15] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; [L15] havoc #t~ite1.base, #t~ite1.offset; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] call write~int(#t~nondet2, ~#d1~0.base, ~#d1~0.offset, 4); [L16] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L17-L21] assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset); [L20] call write~int(0, ~pd~0.base, ~pd~0.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L22] #t~short4 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short4=true, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L22] assume #t~short4; [L22] call #t~mem3 := read~int(~#d1~0.base, ~#d1~0.offset, 4); [L22] #t~short4 := 0 != #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, #t~short4=true, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L22-L24] assume #t~short4; [L22] havoc #t~short4; [L22] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [L28] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=7, ~#d1~0.offset=0, ~#d2~0.base=6, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=6, ~pd~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#d1~0 := #Ultimate.alloc(4); [L13] FCALL call ~#d2~0 := #Ultimate.alloc(4); [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~n~0 := #t~nondet0; [L14] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] COND FALSE !(0 != ~n~0) [L15] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=6, #t~ite1!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] ~pd~0 := #t~ite1; [L15] havoc #t~ite1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L16] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L17] COND FALSE !(~pd~0 == ~#d1~0) [L20] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] #t~short4 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] FCALL call #t~mem3 := read~int({ base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L22] #t~short4 := 0 != #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] havoc #t~short4; [L22] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L28] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=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] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#d1~0 := #Ultimate.alloc(4); [L13] FCALL call ~#d2~0 := #Ultimate.alloc(4); [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~n~0 := #t~nondet0; [L14] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] COND FALSE !(0 != ~n~0) [L15] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=6, #t~ite1!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] ~pd~0 := #t~ite1; [L15] havoc #t~ite1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L16] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L17] COND FALSE !(~pd~0 == ~#d1~0) [L20] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] #t~short4 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] FCALL call #t~mem3 := read~int({ base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L22] #t~short4 := 0 != #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] havoc #t~short4; [L22] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L28] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#d1~0 := #Ultimate.alloc(4); [L13] FCALL call ~#d2~0 := #Ultimate.alloc(4); [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~n~0 := #t~nondet0; [L14] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] COND FALSE !(0 != ~n~0) [L15] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=6, #t~ite1!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] ~pd~0 := #t~ite1; [L15] havoc #t~ite1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L16] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L17] COND FALSE !(~pd~0 == ~#d1~0) [L20] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] #t~short4 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] FCALL call #t~mem3 := read~int({ base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L22] #t~short4 := 0 != #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] havoc #t~short4; [L22] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L28] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=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] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] FCALL call ~#d1~0 := #Ultimate.alloc(4); [L13] FCALL call ~#d2~0 := #Ultimate.alloc(4); [L14] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L14] ~n~0 := #t~nondet0; [L14] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] COND FALSE !(0 != ~n~0) [L15] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=6, #t~ite1!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0] [L15] ~pd~0 := #t~ite1; [L15] havoc #t~ite1; [L16] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L16] FCALL call write~int(#t~nondet2, { base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L16] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L17] COND FALSE !(~pd~0 == ~#d1~0) [L20] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] #t~short4 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] FCALL call #t~mem3 := read~int({ base: ~#d1~0!base, offset: ~#d1~0!offset }, 4); [L22] #t~short4 := 0 != #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, #t~short4=true, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L22] COND TRUE #t~short4 [L22] havoc #t~short4; [L22] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L28] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=7, ~#d1~0!offset=0, ~#d2~0!base=6, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=6, ~pd~0!offset=0] [L13] union dummy d1, d2; [L14] int n = __VERIFIER_nondet_int(); [L15] EXPR n ? &d1 : &d2 VAL [d1={7:0}, d2={6:0}, n=0, n ? &d1 : &d2={6:0}] [L15] union dummy *pd = n ? &d1 : &d2; [L16] d1.a = __VERIFIER_nondet_int() [L17] COND FALSE !(pd == &d1) [L20] pd->b = 0 VAL [d1={7:0}, d2={6:0}, n=0, pd={6:0}] [L22] pd == &d2 && d1.a != 0 [L22] EXPR d1.a [L22] pd == &d2 && d1.a != 0 VAL [d1={7:0}, d1.a=1, d2={6:0}, n=0, pd={6:0}, pd == &d2 && d1.a != 0=1] [L22] COND TRUE pd == &d2 && d1.a != 0 [L28] __VERIFIER_error() VAL [d1={7:0}, d2={6:0}, n=0, pd={6:0}] ----- [2018-11-23 12:54:26,747 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test29_false-unreach-call_true-termination.c-witness.graphml [2018-11-23 12:54:26,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:54:26,748 INFO L168 Benchmark]: Toolchain (without parser) took 3674.36 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -678.1 MB). Peak memory consumption was 68.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:26,750 INFO L168 Benchmark]: CDTParser took 0.19 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:26,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.28 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:26,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.25 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:26,752 INFO L168 Benchmark]: Boogie Preprocessor took 34.57 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:26,753 INFO L168 Benchmark]: RCFGBuilder took 644.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:26,754 INFO L168 Benchmark]: TraceAbstraction took 2503.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 94.0 MB). Peak memory consumption was 94.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:26,754 INFO L168 Benchmark]: Witness Printer took 72.03 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:26,759 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.19 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 382.28 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 32.25 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 34.57 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 644.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.7 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2503.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 94.0 MB). Peak memory consumption was 94.0 MB. Max. memory is 7.1 GB. * Witness Printer took 72.03 ms. Allocated memory is still 2.3 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 28]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] union dummy d1, d2; [L14] int n = __VERIFIER_nondet_int(); [L15] EXPR n ? &d1 : &d2 VAL [d1={7:0}, d2={6:0}, n=0, n ? &d1 : &d2={6:0}] [L15] union dummy *pd = n ? &d1 : &d2; [L16] d1.a = __VERIFIER_nondet_int() [L17] COND FALSE !(pd == &d1) [L20] pd->b = 0 VAL [d1={7:0}, d2={6:0}, n=0, pd={6:0}] [L22] pd == &d2 && d1.a != 0 [L22] EXPR d1.a [L22] pd == &d2 && d1.a != 0 VAL [d1={7:0}, d1.a=1, d2={6:0}, n=0, pd={6:0}, pd == &d2 && d1.a != 0=1] [L22] COND TRUE pd == &d2 && d1.a != 0 [L28] __VERIFIER_error() VAL [d1={7:0}, d2={6:0}, n=0, pd={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. UNSAFE Result, 2.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 22 SDslu, 40 SDs, 0 SdLazy, 51 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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...