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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/ldv-regression/test22_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:10:39,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:10:39,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:10:39,510 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:10:39,510 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:10:39,512 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:10:39,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:10:39,517 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:10:39,519 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:10:39,520 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:10:39,521 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:10:39,522 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:10:39,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:10:39,524 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:10:39,525 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:10:39,526 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:10:39,527 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:10:39,529 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:10:39,531 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:10:39,533 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:10:39,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:10:39,536 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:10:39,540 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:10:39,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:10:39,541 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:10:39,542 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:10:39,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:10:39,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:10:39,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:10:39,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:10:39,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:10:39,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:10:39,555 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:10:39,556 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:10:39,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:10:39,560 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:10:39,561 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:10:39,589 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:10:39,590 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:10:39,590 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:10:39,591 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:10:39,591 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:10:39,592 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:10:39,592 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:10:39,592 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:10:39,592 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:10:39,592 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:10:39,593 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:10:39,593 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:10:39,593 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:10:39,593 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:10:39,593 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:10:39,594 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:10:39,594 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:10:39,594 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:10:39,594 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:10:39,595 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:10:39,595 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:10:39,595 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:10:39,595 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:10:39,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:10:39,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:10:39,596 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:10:39,596 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:10:39,596 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:10:39,596 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:10:39,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:10:39,597 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:10:39,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:10:39,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:10:39,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:10:39,679 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:10:39,679 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:10:39,680 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test22_false-unreach-call.c [2018-11-14 19:10:39,752 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06af283bf/d32a81a0ac3f46d9b879973251b5b150/FLAG6c47b1acb [2018-11-14 19:10:40,266 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:10:40,267 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test22_false-unreach-call.c [2018-11-14 19:10:40,274 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06af283bf/d32a81a0ac3f46d9b879973251b5b150/FLAG6c47b1acb [2018-11-14 19:10:40,295 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06af283bf/d32a81a0ac3f46d9b879973251b5b150 [2018-11-14 19:10:40,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:10:40,309 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:10:40,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:10:40,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:10:40,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:10:40,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:10:40" (1/1) ... [2018-11-14 19:10:40,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f6dc485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:40, skipping insertion in model container [2018-11-14 19:10:40,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:10:40" (1/1) ... [2018-11-14 19:10:40,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:10:40,363 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:10:40,602 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:10:40,618 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:10:40,657 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:10:40,690 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:10:40,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:40 WrapperNode [2018-11-14 19:10:40,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:10:40,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:10:40,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:10:40,692 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:10:40,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:40" (1/1) ... [2018-11-14 19:10:40,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:40" (1/1) ... [2018-11-14 19:10:40,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:40" (1/1) ... [2018-11-14 19:10:40,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:40" (1/1) ... [2018-11-14 19:10:40,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:40" (1/1) ... [2018-11-14 19:10:40,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:40" (1/1) ... [2018-11-14 19:10:40,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:40" (1/1) ... [2018-11-14 19:10:40,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:10:40,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:10:40,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:10:40,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:10:40,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:40" (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-14 19:10:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:10:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:10:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-14 19:10:40,946 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-14 19:10:40,947 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-14 19:10:40,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:10:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:10:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:10:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-14 19:10:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-14 19:10:40,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:10:40,950 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-14 19:10:40,950 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-14 19:10:40,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:10:40,950 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:10:40,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:10:40,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:10:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:10:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:10:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:10:41,874 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:10:41,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:10:41 BoogieIcfgContainer [2018-11-14 19:10:41,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:10:41,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:10:41,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:10:41,879 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:10:41,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:10:40" (1/3) ... [2018-11-14 19:10:41,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e10578a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:10:41, skipping insertion in model container [2018-11-14 19:10:41,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:10:40" (2/3) ... [2018-11-14 19:10:41,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e10578a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:10:41, skipping insertion in model container [2018-11-14 19:10:41,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:10:41" (3/3) ... [2018-11-14 19:10:41,882 INFO L112 eAbstractionObserver]: Analyzing ICFG test22_false-unreach-call.c [2018-11-14 19:10:41,891 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:10:41,897 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:10:41,913 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:10:41,946 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:10:41,947 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:10:41,947 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:10:41,947 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:10:41,947 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:10:41,948 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:10:41,948 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:10:41,948 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:10:41,948 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:10:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-14 19:10:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 19:10:41,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:10:41,975 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:10:41,977 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:10:41,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:10:41,983 INFO L82 PathProgramCache]: Analyzing trace with hash 379541984, now seen corresponding path program 1 times [2018-11-14 19:10:41,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:10:41,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:10:42,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:42,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:10:42,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:10:42,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-14 19:10:42,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#d1~0.base, ~#d1~0.offset + 0, 4);call write~unchecked~int(0, ~#d1~0.base, ~#d1~0.offset + 4, 4);call write~unchecked~int(0, ~#d1~0.base, ~#d1~0.offset + 0, 4);call write~unchecked~int(0, ~#d1~0.base, ~#d1~0.offset + 4, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#d2~0.base, ~#d2~0.offset + 0, 4);call write~unchecked~int(0, ~#d2~0.base, ~#d2~0.offset + 4, 4);call write~unchecked~int(0, ~#d2~0.base, ~#d2~0.offset + 0, 4);call write~unchecked~int(0, ~#d2~0.base, ~#d2~0.offset + 4, 4); {40#true} is VALID [2018-11-14 19:10:42,238 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-14 19:10:42,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #72#return; {40#true} is VALID [2018-11-14 19:10:42,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret17 := main(); {40#true} is VALID [2018-11-14 19:10:42,240 INFO L256 TraceCheckUtils]: 5: Hoare triple {40#true} call init(); {40#true} is VALID [2018-11-14 19:10:42,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {40#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset + 0, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, ~#d1~0.offset + 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset + 0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, ~#d2~0.offset + 4, 4);havoc #t~nondet3; {40#true} is VALID [2018-11-14 19:10:42,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-14 19:10:42,241 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {40#true} {40#true} #62#return; {40#true} is VALID [2018-11-14 19:10:42,241 INFO L256 TraceCheckUtils]: 9: Hoare triple {40#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {40#true} is VALID [2018-11-14 19:10:42,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#true} assume #t~nondet4 % 256 != 0;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {40#true} is VALID [2018-11-14 19:10:42,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {40#true} is VALID [2018-11-14 19:10:42,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-14 19:10:42,242 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {40#true} {40#true} #64#return; {40#true} is VALID [2018-11-14 19:10:42,242 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {40#true} is VALID [2018-11-14 19:10:42,243 INFO L256 TraceCheckUtils]: 15: Hoare triple {40#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {40#true} is VALID [2018-11-14 19:10:42,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#true} assume #t~nondet4 % 256 != 0;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {40#true} is VALID [2018-11-14 19:10:42,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {40#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {40#true} is VALID [2018-11-14 19:10:42,244 INFO L273 TraceCheckUtils]: 18: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-14 19:10:42,244 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {40#true} {40#true} #66#return; {40#true} is VALID [2018-11-14 19:10:42,244 INFO L273 TraceCheckUtils]: 20: Hoare triple {40#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {40#true} is VALID [2018-11-14 19:10:42,245 INFO L256 TraceCheckUtils]: 21: Hoare triple {40#true} call #t~ret9.base, #t~ret9.offset := get_dummy(); {40#true} is VALID [2018-11-14 19:10:42,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {40#true} assume #t~nondet4 % 256 != 0;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {40#true} is VALID [2018-11-14 19:10:42,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {40#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {40#true} is VALID [2018-11-14 19:10:42,246 INFO L273 TraceCheckUtils]: 24: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-14 19:10:42,246 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {40#true} {40#true} #68#return; {40#true} is VALID [2018-11-14 19:10:42,246 INFO L273 TraceCheckUtils]: 26: Hoare triple {40#true} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {40#true} is VALID [2018-11-14 19:10:42,247 INFO L273 TraceCheckUtils]: 27: Hoare triple {40#true} assume #t~short12;call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset + 0, 4);#t~short12 := #t~mem11 > 0; {40#true} is VALID [2018-11-14 19:10:42,247 INFO L273 TraceCheckUtils]: 28: Hoare triple {40#true} assume #t~short12;havoc #t~short12;havoc #t~mem11;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset + 0;call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset + 0, 4);~i~0 := #t~mem13 - 10;havoc #t~mem13; {40#true} is VALID [2018-11-14 19:10:42,260 INFO L273 TraceCheckUtils]: 29: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-14 19:10:42,261 INFO L256 TraceCheckUtils]: 30: Hoare triple {41#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {40#true} is VALID [2018-11-14 19:10:42,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {40#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset + 0, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; {40#true} is VALID [2018-11-14 19:10:42,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-14 19:10:42,262 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {40#true} {41#false} #70#return; {41#false} is VALID [2018-11-14 19:10:42,263 INFO L273 TraceCheckUtils]: 34: Hoare triple {41#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {41#false} is VALID [2018-11-14 19:10:42,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {41#false} assume #t~ret16 == 0;havoc #t~ret16; {41#false} is VALID [2018-11-14 19:10:42,263 INFO L273 TraceCheckUtils]: 36: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-14 19:10:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 19:10:42,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:10:42,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:10:42,279 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-14 19:10:42,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:10:42,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:10:42,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:10:42,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:10:42,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:10:42,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:10:42,539 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-14 19:10:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:42,741 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-14 19:10:42,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:10:42,742 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-14 19:10:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:10:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:10:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 19:10:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:10:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 19:10:42,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-14 19:10:43,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:10:43,089 INFO L225 Difference]: With dead ends: 50 [2018-11-14 19:10:43,090 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 19:10:43,093 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:10:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 19:10:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 19:10:43,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:10:43,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 19:10:43,139 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 19:10:43,139 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 19:10:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:43,146 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 19:10:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 19:10:43,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:43,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:43,148 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 19:10:43,148 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 19:10:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:43,154 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 19:10:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 19:10:43,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:43,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:43,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:10:43,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:10:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 19:10:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-14 19:10:43,161 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 37 [2018-11-14 19:10:43,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:10:43,162 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-14 19:10:43,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:10:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 19:10:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 19:10:43,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:10:43,165 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:10:43,165 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:10:43,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:10:43,166 INFO L82 PathProgramCache]: Analyzing trace with hash -144615034, now seen corresponding path program 1 times [2018-11-14 19:10:43,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:10:43,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:10:43,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:43,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:10:43,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:10:44,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {219#true} is VALID [2018-11-14 19:10:44,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#d1~0.base, ~#d1~0.offset + 0, 4);call write~unchecked~int(0, ~#d1~0.base, ~#d1~0.offset + 4, 4);call write~unchecked~int(0, ~#d1~0.base, ~#d1~0.offset + 0, 4);call write~unchecked~int(0, ~#d1~0.base, ~#d1~0.offset + 4, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#d2~0.base, ~#d2~0.offset + 0, 4);call write~unchecked~int(0, ~#d2~0.base, ~#d2~0.offset + 4, 4);call write~unchecked~int(0, ~#d2~0.base, ~#d2~0.offset + 0, 4);call write~unchecked~int(0, ~#d2~0.base, ~#d2~0.offset + 4, 4); {219#true} is VALID [2018-11-14 19:10:44,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2018-11-14 19:10:44,426 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #72#return; {219#true} is VALID [2018-11-14 19:10:44,426 INFO L256 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret17 := main(); {219#true} is VALID [2018-11-14 19:10:44,426 INFO L256 TraceCheckUtils]: 5: Hoare triple {219#true} call init(); {219#true} is VALID [2018-11-14 19:10:44,427 INFO L273 TraceCheckUtils]: 6: Hoare triple {219#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset + 0, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, ~#d1~0.offset + 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset + 0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, ~#d2~0.offset + 4, 4);havoc #t~nondet3; {219#true} is VALID [2018-11-14 19:10:44,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {219#true} assume true; {219#true} is VALID [2018-11-14 19:10:44,428 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {219#true} {219#true} #62#return; {219#true} is VALID [2018-11-14 19:10:44,428 INFO L256 TraceCheckUtils]: 9: Hoare triple {219#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {219#true} is VALID [2018-11-14 19:10:44,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {219#true} assume #t~nondet4 % 256 != 0;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {221#(and (= |~#d1~0.offset| |get_dummy_#t~ite5.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2018-11-14 19:10:44,430 INFO L273 TraceCheckUtils]: 11: Hoare triple {221#(and (= |~#d1~0.offset| |get_dummy_#t~ite5.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {222#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-14 19:10:44,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {222#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {222#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-14 19:10:44,434 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {222#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {219#true} #64#return; {223#(and (= |~#d1~0.base| |main_#t~ret7.base|) (= |~#d1~0.offset| |main_#t~ret7.offset|))} is VALID [2018-11-14 19:10:44,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {223#(and (= |~#d1~0.base| |main_#t~ret7.base|) (= |~#d1~0.offset| |main_#t~ret7.offset|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {224#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} is VALID [2018-11-14 19:10:44,436 INFO L256 TraceCheckUtils]: 15: Hoare triple {224#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {219#true} is VALID [2018-11-14 19:10:44,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {219#true} assume #t~nondet4 % 256 != 0;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {219#true} is VALID [2018-11-14 19:10:44,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {219#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {219#true} is VALID [2018-11-14 19:10:44,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {219#true} assume true; {219#true} is VALID [2018-11-14 19:10:44,438 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {219#true} {224#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} #66#return; {224#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} is VALID [2018-11-14 19:10:44,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {224#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {224#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} is VALID [2018-11-14 19:10:44,439 INFO L256 TraceCheckUtils]: 21: Hoare triple {224#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {219#true} is VALID [2018-11-14 19:10:44,442 INFO L273 TraceCheckUtils]: 22: Hoare triple {219#true} assume #t~nondet4 % 256 != 0;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {221#(and (= |~#d1~0.offset| |get_dummy_#t~ite5.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2018-11-14 19:10:44,459 INFO L273 TraceCheckUtils]: 23: Hoare triple {221#(and (= |~#d1~0.offset| |get_dummy_#t~ite5.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {222#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-14 19:10:44,473 INFO L273 TraceCheckUtils]: 24: Hoare triple {222#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {222#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-14 19:10:44,476 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {222#(and (= |~#d1~0.offset| |get_dummy_#res.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {224#(and (= |~#d1~0.offset| main_~pd1~0.offset) (= |~#d1~0.base| main_~pd1~0.base))} #68#return; {225#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= |main_#t~ret9.offset| main_~pd1~0.offset))} is VALID [2018-11-14 19:10:44,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {225#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= |main_#t~ret9.offset| main_~pd1~0.offset))} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {226#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2018-11-14 19:10:44,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {226#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} assume #t~short12;call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset + 0, 4);#t~short12 := #t~mem11 > 0; {226#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} is VALID [2018-11-14 19:10:44,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {226#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd3~0.offset main_~pd1~0.offset))} assume #t~short12;havoc #t~short12;havoc #t~mem11;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset + 0;call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset + 0, 4);~i~0 := #t~mem13 - 10;havoc #t~mem13; {227#(= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-14 19:10:44,480 INFO L273 TraceCheckUtils]: 29: Hoare triple {227#(= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume true; {227#(= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-14 19:10:44,482 INFO L273 TraceCheckUtils]: 30: Hoare triple {227#(= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); {228#(= (+ main_~i~0 10) |main_#t~mem14|)} is VALID [2018-11-14 19:10:44,485 INFO L273 TraceCheckUtils]: 31: Hoare triple {228#(= (+ main_~i~0 10) |main_#t~mem14|)} assume !(~i~0 < #t~mem14);havoc #t~mem14; {220#false} is VALID [2018-11-14 19:10:44,486 INFO L256 TraceCheckUtils]: 32: Hoare triple {220#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {219#true} is VALID [2018-11-14 19:10:44,486 INFO L273 TraceCheckUtils]: 33: Hoare triple {219#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset + 0, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; {219#true} is VALID [2018-11-14 19:10:44,486 INFO L273 TraceCheckUtils]: 34: Hoare triple {219#true} assume true; {219#true} is VALID [2018-11-14 19:10:44,487 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {219#true} {220#false} #70#return; {220#false} is VALID [2018-11-14 19:10:44,487 INFO L273 TraceCheckUtils]: 36: Hoare triple {220#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {220#false} is VALID [2018-11-14 19:10:44,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {220#false} assume #t~ret16 == 0;havoc #t~ret16; {220#false} is VALID [2018-11-14 19:10:44,487 INFO L273 TraceCheckUtils]: 38: Hoare triple {220#false} assume !false; {220#false} is VALID [2018-11-14 19:10:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 19:10:44,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:10:44,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:10:44,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:10:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:10:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:10:44,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:10:44,972 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-14 19:10:45,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-14 19:10:45,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-14 19:10:45,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:10:45,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:10:45,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:10:45,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:5 [2018-11-14 19:10:45,726 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:10:45,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {219#true} is VALID [2018-11-14 19:10:45,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#d1~0.base, ~#d1~0.offset + 0, 4);call write~unchecked~int(0, ~#d1~0.base, ~#d1~0.offset + 4, 4);call write~unchecked~int(0, ~#d1~0.base, ~#d1~0.offset + 0, 4);call write~unchecked~int(0, ~#d1~0.base, ~#d1~0.offset + 4, 4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);call write~unchecked~int(0, ~#d2~0.base, ~#d2~0.offset + 0, 4);call write~unchecked~int(0, ~#d2~0.base, ~#d2~0.offset + 4, 4);call write~unchecked~int(0, ~#d2~0.base, ~#d2~0.offset + 0, 4);call write~unchecked~int(0, ~#d2~0.base, ~#d2~0.offset + 4, 4); {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:45,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {235#(= 0 |~#d1~0.offset|)} assume true; {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:45,983 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {235#(= 0 |~#d1~0.offset|)} {219#true} #72#return; {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:45,996 INFO L256 TraceCheckUtils]: 4: Hoare triple {235#(= 0 |~#d1~0.offset|)} call #t~ret17 := main(); {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:46,002 INFO L256 TraceCheckUtils]: 5: Hoare triple {235#(= 0 |~#d1~0.offset|)} call init(); {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:46,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {235#(= 0 |~#d1~0.offset|)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#d1~0.base, ~#d1~0.offset + 0, 4);havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#d1~0.base, ~#d1~0.offset + 4, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#d2~0.base, ~#d2~0.offset + 0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#d2~0.base, ~#d2~0.offset + 4, 4);havoc #t~nondet3; {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:46,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {235#(= 0 |~#d1~0.offset|)} assume true; {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:46,005 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {235#(= 0 |~#d1~0.offset|)} {235#(= 0 |~#d1~0.offset|)} #62#return; {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:46,006 INFO L256 TraceCheckUtils]: 9: Hoare triple {235#(= 0 |~#d1~0.offset|)} call #t~ret7.base, #t~ret7.offset := get_dummy(); {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:46,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {235#(= 0 |~#d1~0.offset|)} assume #t~nondet4 % 256 != 0;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {263#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2018-11-14 19:10:46,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {263#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {267#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-14 19:10:46,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {267#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {267#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-14 19:10:46,015 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {267#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {235#(= 0 |~#d1~0.offset|)} #64#return; {274#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (= 0 |~#d1~0.offset|))} is VALID [2018-11-14 19:10:46,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {274#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (= 0 |~#d1~0.offset|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {278#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2018-11-14 19:10:46,017 INFO L256 TraceCheckUtils]: 15: Hoare triple {278#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:46,022 INFO L273 TraceCheckUtils]: 16: Hoare triple {235#(= 0 |~#d1~0.offset|)} assume #t~nondet4 % 256 != 0;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:46,022 INFO L273 TraceCheckUtils]: 17: Hoare triple {235#(= 0 |~#d1~0.offset|)} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:46,023 INFO L273 TraceCheckUtils]: 18: Hoare triple {235#(= 0 |~#d1~0.offset|)} assume true; {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:46,024 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {235#(= 0 |~#d1~0.offset|)} {278#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #66#return; {278#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2018-11-14 19:10:46,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {278#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {278#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2018-11-14 19:10:46,029 INFO L256 TraceCheckUtils]: 21: Hoare triple {278#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {235#(= 0 |~#d1~0.offset|)} is VALID [2018-11-14 19:10:46,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {235#(= 0 |~#d1~0.offset|)} assume #t~nondet4 % 256 != 0;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {263#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2018-11-14 19:10:46,031 INFO L273 TraceCheckUtils]: 23: Hoare triple {263#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= 0 |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {267#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-14 19:10:46,033 INFO L273 TraceCheckUtils]: 24: Hoare triple {267#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} assume true; {267#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} is VALID [2018-11-14 19:10:46,034 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {267#(and (= 0 |~#d1~0.offset|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#res.base|))} {278#(and (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #68#return; {312#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= 0 |main_#t~ret9.offset|) (= main_~pd1~0.offset 0))} is VALID [2018-11-14 19:10:46,036 INFO L273 TraceCheckUtils]: 26: Hoare triple {312#(and (= |main_#t~ret9.base| main_~pd1~0.base) (= 0 |main_#t~ret9.offset|) (= main_~pd1~0.offset 0))} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0 || ~pd1~0.offset != 0) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {316#(and (= main_~pd3~0.base main_~pd1~0.base) (or (not (= 0 main_~pd1~0.base)) (not |main_#t~short12|)) (= main_~pd1~0.offset 0) (= main_~pd3~0.offset 0))} is VALID [2018-11-14 19:10:46,041 INFO L273 TraceCheckUtils]: 27: Hoare triple {316#(and (= main_~pd3~0.base main_~pd1~0.base) (or (not (= 0 main_~pd1~0.base)) (not |main_#t~short12|)) (= main_~pd1~0.offset 0) (= main_~pd3~0.offset 0))} assume #t~short12;call #t~mem11 := read~int(~pd2~0.base, ~pd2~0.offset + 0, 4);#t~short12 := #t~mem11 > 0; {320#(and (= main_~pd3~0.base main_~pd1~0.base) (not (= 0 main_~pd1~0.base)) (= main_~pd1~0.offset 0) (= main_~pd3~0.offset 0))} is VALID [2018-11-14 19:10:46,042 INFO L273 TraceCheckUtils]: 28: Hoare triple {320#(and (= main_~pd3~0.base main_~pd1~0.base) (not (= 0 main_~pd1~0.base)) (= main_~pd1~0.offset 0) (= main_~pd3~0.offset 0))} assume #t~short12;havoc #t~short12;havoc #t~mem11;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset + 0;call #t~mem13 := read~int(~pd3~0.base, ~pd3~0.offset + 0, 4);~i~0 := #t~mem13 - 10;havoc #t~mem13; {324#(and (not (= 0 main_~pa~0.base)) (= 0 main_~pa~0.offset) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) 0)))} is VALID [2018-11-14 19:10:46,043 INFO L273 TraceCheckUtils]: 29: Hoare triple {324#(and (not (= 0 main_~pa~0.base)) (= 0 main_~pa~0.offset) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) 0)))} assume true; {324#(and (not (= 0 main_~pa~0.base)) (= 0 main_~pa~0.offset) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) 0)))} is VALID [2018-11-14 19:10:46,044 INFO L273 TraceCheckUtils]: 30: Hoare triple {324#(and (not (= 0 main_~pa~0.base)) (= 0 main_~pa~0.offset) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) 0)))} call #t~mem14 := read~int(~pa~0.base, ~pa~0.offset, 4); {331#(<= (+ main_~i~0 10) |main_#t~mem14|)} is VALID [2018-11-14 19:10:46,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {331#(<= (+ main_~i~0 10) |main_#t~mem14|)} assume !(~i~0 < #t~mem14);havoc #t~mem14; {220#false} is VALID [2018-11-14 19:10:46,046 INFO L256 TraceCheckUtils]: 32: Hoare triple {220#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {220#false} is VALID [2018-11-14 19:10:46,046 INFO L273 TraceCheckUtils]: 33: Hoare triple {220#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~int(~s1.base, ~s1.offset + 0, 4);#res := (if #t~mem6 == ~i then 1 else 0);havoc #t~mem6; {220#false} is VALID [2018-11-14 19:10:46,047 INFO L273 TraceCheckUtils]: 34: Hoare triple {220#false} assume true; {220#false} is VALID [2018-11-14 19:10:46,047 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {220#false} {220#false} #70#return; {220#false} is VALID [2018-11-14 19:10:46,048 INFO L273 TraceCheckUtils]: 36: Hoare triple {220#false} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; {220#false} is VALID [2018-11-14 19:10:46,048 INFO L273 TraceCheckUtils]: 37: Hoare triple {220#false} assume #t~ret16 == 0;havoc #t~ret16; {220#false} is VALID [2018-11-14 19:10:46,048 INFO L273 TraceCheckUtils]: 38: Hoare triple {220#false} assume !false; {220#false} is VALID [2018-11-14 19:10:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 19:10:46,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:10:46,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-11-14 19:10:46,084 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-11-14 19:10:46,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:10:46,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 19:10:46,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:10:46,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 19:10:46,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 19:10:46,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-11-14 19:10:46,271 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 20 states. [2018-11-14 19:10:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:49,014 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2018-11-14 19:10:49,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 19:10:49,015 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-11-14 19:10:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:10:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 19:10:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2018-11-14 19:10:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 19:10:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 87 transitions. [2018-11-14 19:10:49,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 87 transitions. [2018-11-14 19:10:49,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:10:49,235 INFO L225 Difference]: With dead ends: 73 [2018-11-14 19:10:49,235 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 19:10:49,241 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2018-11-14 19:10:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 19:10:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2018-11-14 19:10:49,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:10:49,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 45 states. [2018-11-14 19:10:49,319 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 45 states. [2018-11-14 19:10:49,320 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 45 states. [2018-11-14 19:10:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:49,327 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-14 19:10:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2018-11-14 19:10:49,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:49,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:49,330 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 65 states. [2018-11-14 19:10:49,330 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 65 states. [2018-11-14 19:10:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:10:49,337 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-14 19:10:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2018-11-14 19:10:49,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:10:49,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:10:49,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:10:49,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:10:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 19:10:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2018-11-14 19:10:49,344 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 39 [2018-11-14 19:10:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:10:49,344 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2018-11-14 19:10:49,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 19:10:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-11-14 19:10:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 19:10:49,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:10:49,347 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:10:49,347 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:10:49,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:10:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1732962936, now seen corresponding path program 1 times [2018-11-14 19:10:49,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:10:49,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:10:49,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:49,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:10:49,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:10:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 19:10:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 19:10:49,495 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 19:10:49,553 WARN L170 areAnnotationChecker]: initENTRY has no Hoare annotation [2018-11-14 19:10:49,553 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 19:10:49,553 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 19:10:49,554 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 19:10:49,554 WARN L170 areAnnotationChecker]: get_dummyENTRY has no Hoare annotation [2018-11-14 19:10:49,554 WARN L170 areAnnotationChecker]: get_dummyENTRY has no Hoare annotation [2018-11-14 19:10:49,554 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 19:10:49,554 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 19:10:49,554 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2018-11-14 19:10:49,554 WARN L170 areAnnotationChecker]: initFINAL has no Hoare annotation [2018-11-14 19:10:49,555 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:10:49,555 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 19:10:49,555 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 19:10:49,555 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-14 19:10:49,555 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-14 19:10:49,555 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-14 19:10:49,555 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-14 19:10:49,556 WARN L170 areAnnotationChecker]: initEXIT has no Hoare annotation [2018-11-14 19:10:49,556 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:10:49,556 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:10:49,556 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2018-11-14 19:10:49,556 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-14 19:10:49,556 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2018-11-14 19:10:49,556 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-14 19:10:49,556 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-14 19:10:49,557 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-14 19:10:49,557 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-14 19:10:49,557 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-14 19:10:49,557 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 19:10:49,557 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2018-11-14 19:10:49,557 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2018-11-14 19:10:49,557 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-14 19:10:49,558 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-14 19:10:49,558 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-14 19:10:49,558 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-14 19:10:49,558 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 19:10:49,558 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 19:10:49,558 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-14 19:10:49,558 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-14 19:10:49,559 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2018-11-14 19:10:49,559 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2018-11-14 19:10:49,559 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2018-11-14 19:10:49,559 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:10:49,559 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2018-11-14 19:10:49,559 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2018-11-14 19:10:49,559 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:10:49,560 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2018-11-14 19:10:49,560 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2018-11-14 19:10:49,560 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2018-11-14 19:10:49,560 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2018-11-14 19:10:49,560 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2018-11-14 19:10:49,560 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-14 19:10:49,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:10:49 BoogieIcfgContainer [2018-11-14 19:10:49,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:10:49,570 INFO L168 Benchmark]: Toolchain (without parser) took 9262.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -198.2 MB). Peak memory consumption was 523.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:10:49,575 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-14 19:10:49,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.19 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-14 19:10:49,576 INFO L168 Benchmark]: Boogie Preprocessor took 91.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: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:10:49,579 INFO L168 Benchmark]: RCFGBuilder took 1091.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:10:49,580 INFO L168 Benchmark]: TraceAbstraction took 7693.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 541.5 MB). Peak memory consumption was 541.5 MB. Max. memory is 7.1 GB. [2018-11-14 19:10:49,586 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 381.19 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 Preprocessor took 91.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: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1091.06 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7693.63 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 541.5 MB). Peak memory consumption was 541.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 48]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] FCALL struct dummy d1, d2; VAL [\old(d1)=24, \old(d1)=19, \old(d2)=20, \old(d2)=23, d1={1:0}, d2={21:0}] [L32] CALL init() VAL [d1={1:0}, d2={21:0}] [L13] FCALL d1.a = __VERIFIER_nondet_int() [L14] FCALL d1.b = __VERIFIER_nondet_int() [L16] FCALL d2.a = __VERIFIER_nondet_int() [L17] RET, FCALL d2.b = __VERIFIER_nondet_int() [L32] init() VAL [d1={1:0}, d2={21:0}] [L33] CALL, EXPR get_dummy() VAL [d1={1:0}, d2={21:0}] [L22] COND TRUE, EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={1:0}, d1={1:0}, d2={21:0}] [L22] RET return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] EXPR get_dummy() VAL [d1={1:0}, d2={21:0}, get_dummy()={1:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() VAL [d1={1:0}, d2={21:0}] [L22] COND TRUE, EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={1:0}, d1={1:0}, d2={21:0}] [L22] RET return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] EXPR get_dummy() VAL [d1={1:0}, d2={21:0}, get_dummy()={1:0}, pd1={1:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() VAL [d1={1:0}, d2={21:0}] [L22] COND FALSE, EXPR !(__VERIFIER_nondet_bool() ? &d1 : &d2) VAL [__VERIFIER_nondet_bool()=0, __VERIFIER_nondet_bool() ? &d1 : &d2={21:0}, d1={1:0}, d2={21:0}] [L22] RET return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] EXPR get_dummy() VAL [d1={1:0}, d2={21:0}, get_dummy()={21:0}, pd1={1:0}, pd2={1:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L34] int i = __VERIFIER_nondet_int(); [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L35] EXPR, FCALL (*pd2).a [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 VAL [(*pd2).a=6, d1={1:0}, d2={21:0}, i=0, pd1={1:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={1:0}, pd3={21:0}] [L35] COND TRUE pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L36] int *pa = &pd1->a; [L37] EXPR, FCALL pd3->a [L37] i = pd3->a - 10 [L38] EXPR, FCALL \read(*pa) VAL [\read(*pa)=6, d1={1:0}, d2={21:0}, i=7, pa={1:0}, pd1={1:0}, pd2={1:0}, pd3={21:0}] [L38] COND FALSE !(i < *pa) [L41] CALL, EXPR check(pd2, i) VAL [\old(i)=7, d1={1:0}, d2={21:0}, s1={1:0}] [L27] EXPR, FCALL s1->a [L27] RET return s1->a == i; [L41] EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={1:0}, d2={21:0}, i=7, pa={1:0}, pd1={1:0}, pd2={1:0}, pd3={21:0}] [L41] COND TRUE !check(pd2, i) [L48] __VERIFIER_error() VAL [d1={1:0}, d2={21:0}, i=7, pa={1:0}, pd1={1:0}, pd2={1:0}, pd3={21:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. UNSAFE Result, 7.6s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 76 SDtfs, 84 SDslu, 371 SDs, 0 SdLazy, 313 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=2, 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, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 15204 SizeOfPredicates, 12 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 30/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...