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/array-tiling/skippedu_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:17:59,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:17:59,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:17:59,521 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:17:59,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:17:59,522 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:17:59,523 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:17:59,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:17:59,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:17:59,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:17:59,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:17:59,529 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:17:59,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:17:59,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:17:59,532 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:17:59,533 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:17:59,534 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:17:59,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:17:59,538 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:17:59,540 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:17:59,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:17:59,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:17:59,545 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:17:59,546 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:17:59,546 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:17:59,547 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:17:59,548 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:17:59,549 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:17:59,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:17:59,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:17:59,551 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:17:59,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:17:59,554 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:17:59,555 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:17:59,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:17:59,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:17:59,558 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:17:59,588 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:17:59,589 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:17:59,590 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:17:59,590 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:17:59,591 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:17:59,591 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:17:59,591 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:17:59,591 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:17:59,591 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:17:59,592 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:17:59,592 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:17:59,592 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:17:59,592 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:17:59,592 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:17:59,593 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:17:59,593 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:17:59,593 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:17:59,593 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:17:59,593 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:17:59,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:17:59,594 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:17:59,594 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:17:59,594 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:17:59,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:17:59,595 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:17:59,595 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:17:59,595 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:17:59,595 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:17:59,595 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:17:59,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:17:59,596 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:17:59,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:17:59,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:17:59,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:17:59,685 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:17:59,685 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:17:59,686 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/skippedu_false-unreach-call.i [2018-11-23 12:17:59,753 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c805d8c/440fc882ad7a4a8680b455dcde904e1e/FLAGb6777c23b [2018-11-23 12:18:00,169 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:18:00,170 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/skippedu_false-unreach-call.i [2018-11-23 12:18:00,176 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c805d8c/440fc882ad7a4a8680b455dcde904e1e/FLAGb6777c23b [2018-11-23 12:18:00,549 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4c805d8c/440fc882ad7a4a8680b455dcde904e1e [2018-11-23 12:18:00,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:18:00,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:18:00,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:18:00,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:18:00,570 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:18:00,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:18:00" (1/1) ... [2018-11-23 12:18:00,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a385c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:00, skipping insertion in model container [2018-11-23 12:18:00,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:18:00" (1/1) ... [2018-11-23 12:18:00,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:18:00,608 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:18:00,820 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:18:00,826 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:18:00,856 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:18:00,880 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:18:00,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:00 WrapperNode [2018-11-23 12:18:00,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:18:00,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:18:00,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:18:00,883 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:18:00,893 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:18:00" (1/1) ... [2018-11-23 12:18:00,903 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:18:00" (1/1) ... [2018-11-23 12:18:00,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:18:00,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:18:00,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:18:00,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:18:00,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:00" (1/1) ... [2018-11-23 12:18:00,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:00" (1/1) ... [2018-11-23 12:18:00,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:00" (1/1) ... [2018-11-23 12:18:00,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:00" (1/1) ... [2018-11-23 12:18:00,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:00" (1/1) ... [2018-11-23 12:18:00,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:00" (1/1) ... [2018-11-23 12:18:00,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:00" (1/1) ... [2018-11-23 12:18:00,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:18:00,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:18:00,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:18:00,951 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:18:00,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:00" (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:18:01,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:18:01,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:18:01,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:18:01,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:18:01,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:18:01,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:18:01,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:18:01,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:18:01,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:18:01,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:18:01,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:18:01,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:18:01,729 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:18:01,729 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:18:01,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:18:01 BoogieIcfgContainer [2018-11-23 12:18:01,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:18:01,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:18:01,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:18:01,735 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:18:01,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:18:00" (1/3) ... [2018-11-23 12:18:01,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ebc66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:18:01, skipping insertion in model container [2018-11-23 12:18:01,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:18:00" (2/3) ... [2018-11-23 12:18:01,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ebc66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:18:01, skipping insertion in model container [2018-11-23 12:18:01,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:18:01" (3/3) ... [2018-11-23 12:18:01,739 INFO L112 eAbstractionObserver]: Analyzing ICFG skippedu_false-unreach-call.i [2018-11-23 12:18:01,748 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:18:01,756 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:18:01,774 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:18:01,809 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:18:01,810 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:18:01,810 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:18:01,810 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:18:01,811 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:18:01,811 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:18:01,811 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:18:01,811 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:18:01,811 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:18:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 12:18:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:18:01,836 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:01,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:01,839 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:01,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:01,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1661916020, now seen corresponding path program 1 times [2018-11-23 12:18:01,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:01,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:01,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:01,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:01,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:02,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 12:18:02,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {33#true} is VALID [2018-11-23 12:18:02,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 12:18:02,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #72#return; {33#true} is VALID [2018-11-23 12:18:02,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2018-11-23 12:18:02,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2018-11-23 12:18:02,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {35#(<= 2 ~SIZE~0)} is VALID [2018-11-23 12:18:02,401 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#(<= 2 ~SIZE~0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 1; {36#(and (= main_~i~0 1) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= 2 ~SIZE~0))} is VALID [2018-11-23 12:18:02,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#(and (= main_~i~0 1) (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= 2 ~SIZE~0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {34#false} is VALID [2018-11-23 12:18:02,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0; {34#false} is VALID [2018-11-23 12:18:02,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {34#false} is VALID [2018-11-23 12:18:02,404 INFO L256 TraceCheckUtils]: 11: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); {34#false} is VALID [2018-11-23 12:18:02,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 12:18:02,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-23 12:18:02,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 12:18:02,409 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:18:02,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:18:02,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:18:02,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 12:18:02,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:02,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:18:02,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:02,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:18:02,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:18:02,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:18:02,649 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-11-23 12:18:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:03,462 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2018-11-23 12:18:03,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:18:03,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 12:18:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:18:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2018-11-23 12:18:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:18:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2018-11-23 12:18:03,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2018-11-23 12:18:03,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:03,990 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:18:03,990 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:18:03,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:18:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:18:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-11-23 12:18:04,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:04,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 25 states. [2018-11-23 12:18:04,065 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 25 states. [2018-11-23 12:18:04,065 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 25 states. [2018-11-23 12:18:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:04,070 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:18:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:18:04,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:04,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:04,071 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 29 states. [2018-11-23 12:18:04,071 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 29 states. [2018-11-23 12:18:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:04,076 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:18:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:18:04,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:04,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:04,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:04,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:18:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 12:18:04,083 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-11-23 12:18:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:04,083 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 12:18:04,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:18:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 12:18:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:18:04,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:04,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:04,085 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:04,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:04,086 INFO L82 PathProgramCache]: Analyzing trace with hash 505215540, now seen corresponding path program 1 times [2018-11-23 12:18:04,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:04,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:04,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:04,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:04,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:05,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {200#true} call ULTIMATE.init(); {200#true} is VALID [2018-11-23 12:18:05,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {200#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {200#true} is VALID [2018-11-23 12:18:05,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2018-11-23 12:18:05,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2018-11-23 12:18:05,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {200#true} call #t~ret7 := main(); {200#true} is VALID [2018-11-23 12:18:05,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {200#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {200#true} is VALID [2018-11-23 12:18:05,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {202#(and (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:18:05,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {202#(and (<= 2 ~SIZE~0) (= |main_~#a~0.offset| 0))} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 1; {203#(and (= main_~i~0 1) (or (<= 0 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:18:05,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {203#(and (= main_~i~0 1) (or (<= 0 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); {203#(and (= main_~i~0 1) (or (<= 0 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:18:05,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {203#(and (= main_~i~0 1) (or (<= 0 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))) (= |main_~#a~0.offset| 0))} assume #t~mem3 > ~i~0;havoc #t~mem3;call write~int(2 * ~i~0 - 2, ~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); {204#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 8 main_~i~0) (- 8)))) (or (<= 0 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:18:05,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {204#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 8 main_~i~0) (- 8)))) (or (<= 0 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))) (= |main_~#a~0.offset| 0))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); {204#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 8 main_~i~0) (- 8)))) (or (<= 0 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:18:05,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {204#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 8 main_~i~0) (- 8)))) (or (<= 0 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))) (= |main_~#a~0.offset| 0))} assume !(#t~mem4 > ~i~0);havoc #t~mem4; {204#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 8 main_~i~0) (- 8)))) (or (<= 0 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:18:05,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {204#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 8 main_~i~0) (- 8)))) (or (<= 0 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {205#(and (or (and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= (+ (* 8 main_~i~0) |main_~#a~0.offset|) (+ (* 4 ~SIZE~0) 7))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (or (<= 0 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:18:05,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {205#(and (or (and (= ~SIZE~0 (* 2 (div ~SIZE~0 2))) (<= (+ (* 8 main_~i~0) |main_~#a~0.offset|) (+ (* 4 ~SIZE~0) 7))) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0))) (or (<= 0 ~SIZE~0) (= ~SIZE~0 (* 2 (div ~SIZE~0 2)))) (= |main_~#a~0.offset| 0))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {206#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-23 12:18:05,138 INFO L273 TraceCheckUtils]: 14: Hoare triple {206#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} ~i~0 := 0; {207#(and (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:18:05,139 INFO L273 TraceCheckUtils]: 15: Hoare triple {207#(and (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {208#(and (= |main_#t~mem6| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:18:05,140 INFO L256 TraceCheckUtils]: 16: Hoare triple {208#(and (= |main_#t~mem6| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); {209#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:18:05,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {209#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {210#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:18:05,141 INFO L273 TraceCheckUtils]: 18: Hoare triple {210#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {201#false} is VALID [2018-11-23 12:18:05,141 INFO L273 TraceCheckUtils]: 19: Hoare triple {201#false} assume !false; {201#false} is VALID [2018-11-23 12:18:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:18:05,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:18:05,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:18:05,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:18:05,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:18:05,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 12:18:05,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 12:18:05,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:18:05,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:05,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:05,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 12:18:05,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 12:18:05,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 12:18:05,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:18:05,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:18:05,923 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-23 12:18:05,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-23 12:18:05,926 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:18:05,927 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (* 4 main_~i~0)))) (and (<= |main_#t~mem6| .cse0) (= 0 .cse0) (= main_~i~0 0))) [2018-11-23 12:18:05,927 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= |main_#t~mem6| 0) (= main_~i~0 0)) [2018-11-23 12:18:05,994 INFO L256 TraceCheckUtils]: 0: Hoare triple {200#true} call ULTIMATE.init(); {200#true} is VALID [2018-11-23 12:18:05,995 INFO L273 TraceCheckUtils]: 1: Hoare triple {200#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {200#true} is VALID [2018-11-23 12:18:05,995 INFO L273 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2018-11-23 12:18:05,995 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2018-11-23 12:18:05,996 INFO L256 TraceCheckUtils]: 4: Hoare triple {200#true} call #t~ret7 := main(); {200#true} is VALID [2018-11-23 12:18:05,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {200#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {200#true} is VALID [2018-11-23 12:18:05,997 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); {232#(= |main_~#a~0.offset| 0)} is VALID [2018-11-23 12:18:05,998 INFO L273 TraceCheckUtils]: 7: Hoare triple {232#(= |main_~#a~0.offset| 0)} assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 1; {236#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:18:05,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {236#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); {236#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:18:05,999 INFO L273 TraceCheckUtils]: 9: Hoare triple {236#(and (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume #t~mem3 > ~i~0;havoc #t~mem3;call write~int(2 * ~i~0 - 2, ~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); {206#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-23 12:18:06,000 INFO L273 TraceCheckUtils]: 10: Hoare triple {206#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); {206#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-23 12:18:06,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {206#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} assume !(#t~mem4 > ~i~0);havoc #t~mem4; {206#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-23 12:18:06,003 INFO L273 TraceCheckUtils]: 12: Hoare triple {206#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {206#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-23 12:18:06,020 INFO L273 TraceCheckUtils]: 13: Hoare triple {206#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); {206#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} is VALID [2018-11-23 12:18:06,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {206#(and (= |main_~#a~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#a~0.base|) 0)))} ~i~0 := 0; {207#(and (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:18:06,022 INFO L273 TraceCheckUtils]: 15: Hoare triple {207#(and (= 0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {261#(and (<= |main_#t~mem6| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:18:06,027 INFO L256 TraceCheckUtils]: 16: Hoare triple {261#(and (<= |main_#t~mem6| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); {265#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:18:06,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {265#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {269#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:18:06,028 INFO L273 TraceCheckUtils]: 18: Hoare triple {269#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {201#false} is VALID [2018-11-23 12:18:06,029 INFO L273 TraceCheckUtils]: 19: Hoare triple {201#false} assume !false; {201#false} is VALID [2018-11-23 12:18:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:18:06,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:18:06,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-11-23 12:18:06,056 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2018-11-23 12:18:06,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:18:06,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:18:06,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:06,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:18:06,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:18:06,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:18:06,261 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 16 states. [2018-11-23 12:18:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:07,916 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-23 12:18:07,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:18:07,917 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2018-11-23 12:18:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:18:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:18:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2018-11-23 12:18:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:18:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2018-11-23 12:18:07,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2018-11-23 12:18:08,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:18:08,049 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:18:08,049 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:18:08,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:18:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:18:08,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-11-23 12:18:08,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:18:08,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 38 states. [2018-11-23 12:18:08,121 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 38 states. [2018-11-23 12:18:08,121 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 38 states. [2018-11-23 12:18:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:08,129 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 12:18:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 12:18:08,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:08,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:08,130 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 54 states. [2018-11-23 12:18:08,130 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 54 states. [2018-11-23 12:18:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:18:08,136 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 12:18:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 12:18:08,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:18:08,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:18:08,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:18:08,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:18:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:18:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 12:18:08,141 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 20 [2018-11-23 12:18:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:18:08,142 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 12:18:08,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:18:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 12:18:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:18:08,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:18:08,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:18:08,143 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:18:08,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:18:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1206280118, now seen corresponding path program 1 times [2018-11-23 12:18:08,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:18:08,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:18:08,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:08,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:18:08,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:18:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:18:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:18:08,256 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~SIZE~0)|=10, ~SIZE~0=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~SIZE~0)|=10, ~SIZE~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~SIZE~0)|=10, ~SIZE~0=0] [?] RET #72#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 1; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=1, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(#t~mem3 > ~i~0);havoc #t~mem3; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(#t~mem4 > ~i~0);havoc #t~mem4; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); VAL [main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] ~i~0 := 0; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6|=1, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L8] ~SIZE~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13-L37] assume ~SIZE~0 > 1; [L15] havoc ~i~0; [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~SIZE~0=2] [L18] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L23] call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L23-L26] assume !(#t~mem3 > ~i~0); [L23] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27-L30] assume !(#t~mem4 > ~i~0); [L27] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] assume !!(~i~0 < ~SIZE~0); [L35] call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L8] ~SIZE~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13-L37] assume ~SIZE~0 > 1; [L15] havoc ~i~0; [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~SIZE~0=2] [L18] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L23] call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L23-L26] assume !(#t~mem3 > ~i~0); [L23] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27-L30] assume !(#t~mem4 > ~i~0); [L27] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] assume !!(~i~0 < ~SIZE~0); [L35] call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L8] int SIZE; VAL [\old(SIZE)=10, SIZE=0] [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] int a[SIZE]; VAL [\old(SIZE)=0, a={11:0}, SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [\old(SIZE)=0, a={11:0}, i=1, SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR a[2*i-2] VAL [\old(SIZE)=0, a={11:0}, a[2*i-2]=1, i=1, SIZE=2] [L23] COND FALSE !(a[2*i-2] > i) [L27] EXPR a[2*i-1] VAL [\old(SIZE)=0, a={11:0}, a[2*i-1]=0, i=1, SIZE=2] [L27] COND FALSE !(a[2*i-1] > i) [L21] i++ VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L21] COND FALSE !(i <= SIZE/2) VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L33] i = 0 VAL [\old(SIZE)=0, a={11:0}, i=0, SIZE=2] [L33] COND TRUE i < SIZE [L35] EXPR a[i] VAL [\old(SIZE)=0, a={11:0}, a[i]=1, i=0, SIZE=2] [L35] CALL __VERIFIER_assert( a[i] <= i ) VAL [\old(cond)=0, \old(SIZE)=0, SIZE=2] [L5] COND TRUE !(cond) VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] ----- [2018-11-23 12:18:08,323 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:18:08,323 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:18:08,323 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:18:08,323 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:18:08,324 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 12:18:08,324 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:18:08,324 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:18:08,324 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:18:08,324 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 12:18:08,324 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 12:18:08,324 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 12:18:08,325 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 12:18:08,325 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:18:08,325 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:18:08,325 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 12:18:08,325 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 12:18:08,325 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 12:18:08,326 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2018-11-23 12:18:08,326 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2018-11-23 12:18:08,326 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2018-11-23 12:18:08,326 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:18:08,326 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-23 12:18:08,326 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-23 12:18:08,327 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-23 12:18:08,327 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 12:18:08,327 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:18:08,327 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2018-11-23 12:18:08,327 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 12:18:08,327 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 12:18:08,328 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2018-11-23 12:18:08,328 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-23 12:18:08,328 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-23 12:18:08,328 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-23 12:18:08,328 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2018-11-23 12:18:08,328 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2018-11-23 12:18:08,329 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2018-11-23 12:18:08,329 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:18:08,329 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:18:08,329 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-23 12:18:08,329 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-23 12:18:08,329 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 12:18:08,330 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:18:08,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:18:08 BoogieIcfgContainer [2018-11-23 12:18:08,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:18:08,333 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:18:08,333 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:18:08,334 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:18:08,334 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:18:01" (3/4) ... [2018-11-23 12:18:08,337 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|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~SIZE~0)|=10, ~SIZE~0=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~SIZE~0)|=10, ~SIZE~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~SIZE~0)|=10, ~SIZE~0=0] [?] RET #72#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 1; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=1, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(#t~mem3 > ~i~0);havoc #t~mem3; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(#t~mem4 > ~i~0);havoc #t~mem4; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); VAL [main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] ~i~0 := 0; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6|=1, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L8] ~SIZE~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13-L37] assume ~SIZE~0 > 1; [L15] havoc ~i~0; [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~SIZE~0=2] [L18] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L23] call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L23-L26] assume !(#t~mem3 > ~i~0); [L23] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27-L30] assume !(#t~mem4 > ~i~0); [L27] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] assume !!(~i~0 < ~SIZE~0); [L35] call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L8] ~SIZE~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13-L37] assume ~SIZE~0 > 1; [L15] havoc ~i~0; [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~SIZE~0=2] [L18] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L23] call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L23-L26] assume !(#t~mem3 > ~i~0); [L23] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27-L30] assume !(#t~mem4 > ~i~0); [L27] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] assume !!(~i~0 < ~SIZE~0); [L35] call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L8] int SIZE; VAL [\old(SIZE)=10, SIZE=0] [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] int a[SIZE]; VAL [\old(SIZE)=0, a={11:0}, SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [\old(SIZE)=0, a={11:0}, i=1, SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR a[2*i-2] VAL [\old(SIZE)=0, a={11:0}, a[2*i-2]=1, i=1, SIZE=2] [L23] COND FALSE !(a[2*i-2] > i) [L27] EXPR a[2*i-1] VAL [\old(SIZE)=0, a={11:0}, a[2*i-1]=0, i=1, SIZE=2] [L27] COND FALSE !(a[2*i-1] > i) [L21] i++ VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L21] COND FALSE !(i <= SIZE/2) VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L33] i = 0 VAL [\old(SIZE)=0, a={11:0}, i=0, SIZE=2] [L33] COND TRUE i < SIZE [L35] EXPR a[i] VAL [\old(SIZE)=0, a={11:0}, a[i]=1, i=0, SIZE=2] [L35] CALL __VERIFIER_assert( a[i] <= i ) VAL [\old(cond)=0, \old(SIZE)=0, SIZE=2] [L5] COND TRUE !(cond) VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] ----- [2018-11-23 12:18:08,420 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/array-tiling/skippedu_false-unreach-call.i-witness.graphml [2018-11-23 12:18:08,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:18:08,422 INFO L168 Benchmark]: Toolchain (without parser) took 7862.90 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -338.6 MB). Peak memory consumption was 369.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:18:08,424 INFO L168 Benchmark]: CDTParser took 0.20 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:18:08,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.79 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:18:08,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.76 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:18:08,426 INFO L168 Benchmark]: Boogie Preprocessor took 37.31 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:18:08,427 INFO L168 Benchmark]: RCFGBuilder took 779.17 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -740.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:18:08,427 INFO L168 Benchmark]: TraceAbstraction took 6601.71 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 391.7 MB). Peak memory consumption was 391.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:18:08,428 INFO L168 Benchmark]: Witness Printer took 87.56 ms. Allocated memory is still 2.2 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:18:08,432 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 315.79 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 30.76 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 37.31 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 779.17 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -740.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6601.71 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 391.7 MB). Peak memory consumption was 391.7 MB. Max. memory is 7.1 GB. * Witness Printer took 87.56 ms. Allocated memory is still 2.2 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L8] int SIZE; VAL [\old(SIZE)=10, SIZE=0] [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] int a[SIZE]; VAL [\old(SIZE)=0, a={11:0}, SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [\old(SIZE)=0, a={11:0}, i=1, SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR a[2*i-2] VAL [\old(SIZE)=0, a={11:0}, a[2*i-2]=1, i=1, SIZE=2] [L23] COND FALSE !(a[2*i-2] > i) [L27] EXPR a[2*i-1] VAL [\old(SIZE)=0, a={11:0}, a[2*i-1]=0, i=1, SIZE=2] [L27] COND FALSE !(a[2*i-1] > i) [L21] i++ VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L21] COND FALSE !(i <= SIZE/2) VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L33] i = 0 VAL [\old(SIZE)=0, a={11:0}, i=0, SIZE=2] [L33] COND TRUE i < SIZE [L35] EXPR a[i] VAL [\old(SIZE)=0, a={11:0}, a[i]=1, i=0, SIZE=2] [L35] CALL __VERIFIER_assert( a[i] <= i ) VAL [\old(cond)=0, \old(SIZE)=0, SIZE=2] [L5] COND TRUE !(cond) VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. UNSAFE Result, 6.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 138 SDslu, 120 SDs, 0 SdLazy, 227 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 6790 SizeOfPredicates, 7 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...