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_Bitvector.epf -i ../../../trunk/examples/svcomp/array-tiling/skippedu_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:25:15,846 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:25:15,848 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:25:15,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:25:15,860 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:25:15,861 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:25:15,863 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:25:15,867 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:25:15,870 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:25:15,871 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:25:15,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:25:15,872 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:25:15,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:25:15,875 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:25:15,877 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:25:15,878 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:25:15,879 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:25:15,881 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:25:15,883 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:25:15,885 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:25:15,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:25:15,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:25:15,890 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:25:15,891 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:25:15,891 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:25:15,894 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:25:15,896 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:25:15,898 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:25:15,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:25:15,903 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:25:15,903 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:25:15,904 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:25:15,905 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:25:15,905 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:25:15,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:25:15,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:25:15,908 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:25:15,929 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:25:15,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:25:15,930 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:25:15,930 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:25:15,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:25:15,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:25:15,931 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:25:15,931 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:25:15,932 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:25:15,932 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:25:15,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:25:15,932 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:25:15,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:25:15,933 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:25:15,933 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:25:15,933 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:25:15,933 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:25:15,933 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:25:15,934 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:25:15,934 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:25:15,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:25:15,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:25:15,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:25:15,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:25:15,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:25:15,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:25:15,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:25:15,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:25:15,936 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:25:15,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:25:15,936 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:25:15,936 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:25:15,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:25:15,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:25:16,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:25:16,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:25:16,018 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:25:16,018 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:25:16,019 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 10:25:16,087 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0bc98d69/c27241db5be2428bbe169ca07b564be9/FLAG15d6b0734 [2018-11-23 10:25:16,579 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:25:16,581 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/skippedu_false-unreach-call.i [2018-11-23 10:25:16,589 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0bc98d69/c27241db5be2428bbe169ca07b564be9/FLAG15d6b0734 [2018-11-23 10:25:16,914 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0bc98d69/c27241db5be2428bbe169ca07b564be9 [2018-11-23 10:25:16,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:25:16,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:25:16,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:25:16,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:25:16,933 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:25:16,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:25:16" (1/1) ... [2018-11-23 10:25:16,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ec867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:16, skipping insertion in model container [2018-11-23 10:25:16,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:25:16" (1/1) ... [2018-11-23 10:25:16,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:25:16,976 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:25:17,187 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:25:17,193 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:25:17,239 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:25:17,281 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:25:17,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:17 WrapperNode [2018-11-23 10:25:17,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:25:17,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:25:17,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:25:17,283 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:25:17,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:17" (1/1) ... [2018-11-23 10:25:17,307 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:17" (1/1) ... [2018-11-23 10:25:17,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:25:17,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:25:17,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:25:17,317 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:25:17,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:17" (1/1) ... [2018-11-23 10:25:17,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:17" (1/1) ... [2018-11-23 10:25:17,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:17" (1/1) ... [2018-11-23 10:25:17,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:17" (1/1) ... [2018-11-23 10:25:17,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:17" (1/1) ... [2018-11-23 10:25:17,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:17" (1/1) ... [2018-11-23 10:25:17,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:17" (1/1) ... [2018-11-23 10:25:17,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:25:17,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:25:17,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:25:17,386 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:25:17,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:17" (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 10:25:17,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:25:17,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:25:17,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:25:17,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:25:17,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:25:17,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:25:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:25:17,537 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:25:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:25:17,537 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:25:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:25:17,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:25:18,239 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:25:18,239 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:25:18,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:18 BoogieIcfgContainer [2018-11-23 10:25:18,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:25:18,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:25:18,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:25:18,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:25:18,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:25:16" (1/3) ... [2018-11-23 10:25:18,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c3b4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:25:18, skipping insertion in model container [2018-11-23 10:25:18,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:17" (2/3) ... [2018-11-23 10:25:18,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c3b4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:25:18, skipping insertion in model container [2018-11-23 10:25:18,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:18" (3/3) ... [2018-11-23 10:25:18,249 INFO L112 eAbstractionObserver]: Analyzing ICFG skippedu_false-unreach-call.i [2018-11-23 10:25:18,259 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:25:18,268 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:25:18,287 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:25:18,322 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:25:18,323 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:25:18,323 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:25:18,324 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:25:18,325 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:25:18,325 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:25:18,325 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:25:18,326 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:25:18,326 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:25:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 10:25:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:25:18,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:18,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:25:18,353 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:18,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:18,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1661916020, now seen corresponding path program 1 times [2018-11-23 10:25:18,363 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:18,364 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:18,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:18,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:18,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 10:25:18,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {33#true} is VALID [2018-11-23 10:25:18,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 10:25:18,947 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #72#return; {33#true} is VALID [2018-11-23 10:25:18,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2018-11-23 10:25:18,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2018-11-23 10:25:18,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); {56#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:25:18,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {56#(bvsgt ~SIZE~0 (_ bv1 32))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {60#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:25:18,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {60#(and (= (bvsrem ~SIZE~0 (_ bv2 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {34#false} is VALID [2018-11-23 10:25:18,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0bv32; {34#false} is VALID [2018-11-23 10:25:18,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {34#false} is VALID [2018-11-23 10:25:18,968 INFO L256 TraceCheckUtils]: 11: Hoare triple {34#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); {34#false} is VALID [2018-11-23 10:25:18,968 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 10:25:18,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0bv32 == ~cond; {34#false} is VALID [2018-11-23 10:25:18,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 10:25:18,978 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 10:25:18,978 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:25:18,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:25:18,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:25:18,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 10:25:18,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:18,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:25:19,054 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 10:25:19,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:25:19,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:25:19,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:25:19,065 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-11-23 10:25:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:19,916 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2018-11-23 10:25:19,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:25:19,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 10:25:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:25:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2018-11-23 10:25:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:25:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2018-11-23 10:25:19,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2018-11-23 10:25:20,527 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 10:25:20,539 INFO L225 Difference]: With dead ends: 57 [2018-11-23 10:25:20,539 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 10:25:20,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:25:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 10:25:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-11-23 10:25:20,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:20,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 25 states. [2018-11-23 10:25:20,594 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 25 states. [2018-11-23 10:25:20,594 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 25 states. [2018-11-23 10:25:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:20,599 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 10:25:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 10:25:20,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:20,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:20,600 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 29 states. [2018-11-23 10:25:20,601 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 29 states. [2018-11-23 10:25:20,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:20,605 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 10:25:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 10:25:20,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:20,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:20,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:20,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:25:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 10:25:20,612 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-11-23 10:25:20,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:20,613 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 10:25:20,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:25:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 10:25:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:25:20,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:20,614 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 10:25:20,615 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:20,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:20,615 INFO L82 PathProgramCache]: Analyzing trace with hash 505215540, now seen corresponding path program 1 times [2018-11-23 10:25:20,616 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:20,616 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:20,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:20,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:20,909 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 10:25:20,926 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 10:25:20,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:20,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:20,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:20,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 10:25:21,141 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 17 treesize of output 13 [2018-11-23 10:25:21,146 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:21,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-11-23 10:25:21,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:21,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:25:21,176 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 10:25:21,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-23 10:25:21,182 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:25:21,182 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= |main_#t~mem6| (select .cse0 (bvmul (_ bv4 32) main_~i~0))) (= (_ bv0 32) (select .cse0 (_ bv0 32))) (= main_~i~0 (_ bv0 32)))) [2018-11-23 10:25:21,182 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvmul (_ bv4 32) main_~i~0) |main_#t~mem6|) (= main_~i~0 (_ bv0 32))) [2018-11-23 10:25:21,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2018-11-23 10:25:21,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {242#true} is VALID [2018-11-23 10:25:21,305 INFO L273 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2018-11-23 10:25:21,305 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #72#return; {242#true} is VALID [2018-11-23 10:25:21,305 INFO L256 TraceCheckUtils]: 4: Hoare triple {242#true} call #t~ret7 := main(); {242#true} is VALID [2018-11-23 10:25:21,305 INFO L273 TraceCheckUtils]: 5: Hoare triple {242#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {242#true} is VALID [2018-11-23 10:25:21,306 INFO L273 TraceCheckUtils]: 6: Hoare triple {242#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); {265#(= |main_~#a~0.offset| (_ bv0 32))} is VALID [2018-11-23 10:25:21,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {265#(= |main_~#a~0.offset| (_ bv0 32))} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {269#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:25:21,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {269#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {269#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:25:21,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {269#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvsgt32(#t~mem3, ~i~0);havoc #t~mem3;call write~intINTTYPE4(~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {276#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:25:21,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {276#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {276#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:25:21,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {276#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvsgt32(#t~mem4, ~i~0);havoc #t~mem4; {276#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:25:21,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {276#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {276#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:25:21,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {276#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {276#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:25:21,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {276#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := 0bv32; {292#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:25:21,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {292#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {296#(and (= (bvmul (_ bv4 32) main_~i~0) |main_#t~mem6|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:25:21,327 INFO L256 TraceCheckUtils]: 16: Hoare triple {296#(and (= (bvmul (_ bv4 32) main_~i~0) |main_#t~mem6|) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); {300#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:21,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {300#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {304#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:21,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {304#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {243#false} is VALID [2018-11-23 10:25:21,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {243#false} assume !false; {243#false} is VALID [2018-11-23 10:25:21,332 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 10:25:21,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:21,607 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 17 [2018-11-23 10:25:21,776 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 10:25:21,783 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-23 10:25:21,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:25:21,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:25:21,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 10:25:21,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-11-23 10:25:21,815 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:25:21,816 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (bvsle (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) main_~i~0) (_ bv4294967288 32)) (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32))) |main_~#a~0.offset|) (_ bv0 32)) [2018-11-23 10:25:21,816 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (bvsle (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32)) (_ bv0 32))) [2018-11-23 10:25:21,928 INFO L273 TraceCheckUtils]: 19: Hoare triple {243#false} assume !false; {243#false} is VALID [2018-11-23 10:25:21,929 INFO L273 TraceCheckUtils]: 18: Hoare triple {314#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {243#false} is VALID [2018-11-23 10:25:21,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {318#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {314#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:25:21,932 INFO L256 TraceCheckUtils]: 16: Hoare triple {322#(bvsle |main_#t~mem6| main_~i~0)} call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); {318#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:25:21,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {326#(bvsle (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {322#(bvsle |main_#t~mem6| main_~i~0)} is VALID [2018-11-23 10:25:21,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {330#(bvsle (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} ~i~0 := 0bv32; {326#(bvsle (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) main_~i~0)} is VALID [2018-11-23 10:25:21,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {330#(bvsle (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); {330#(bvsle (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:25:21,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {330#(bvsle (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {330#(bvsle (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:25:21,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {330#(bvsle (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} assume !~bvsgt32(#t~mem4, ~i~0);havoc #t~mem4; {330#(bvsle (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:25:21,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {330#(bvsle (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); {330#(bvsle (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:25:21,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {346#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (bvsle (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32)) (_ bv0 32)))} assume ~bvsgt32(#t~mem3, ~i~0);havoc #t~mem3;call write~intINTTYPE4(~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {330#(bvsle (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:25:21,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {346#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (bvsle (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); {346#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (bvsle (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 10:25:21,943 INFO L273 TraceCheckUtils]: 7: Hoare triple {242#true} assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; {346#(and (= (_ bv8 32) (bvmul (_ bv8 32) main_~i~0)) (bvsle (bvadd (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 10:25:21,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {242#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); {242#true} is VALID [2018-11-23 10:25:21,943 INFO L273 TraceCheckUtils]: 5: Hoare triple {242#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {242#true} is VALID [2018-11-23 10:25:21,944 INFO L256 TraceCheckUtils]: 4: Hoare triple {242#true} call #t~ret7 := main(); {242#true} is VALID [2018-11-23 10:25:21,944 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #72#return; {242#true} is VALID [2018-11-23 10:25:21,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2018-11-23 10:25:21,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {242#true} is VALID [2018-11-23 10:25:21,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2018-11-23 10:25:21,947 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 10:25:21,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:21,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-23 10:25:21,953 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-11-23 10:25:21,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:21,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 10:25:22,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:22,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 10:25:22,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 10:25:22,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-23 10:25:22,074 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 15 states. [2018-11-23 10:25:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:25,274 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-23 10:25:25,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:25:25,275 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-11-23 10:25:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 10:25:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2018-11-23 10:25:25,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 10:25:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2018-11-23 10:25:25,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 69 transitions. [2018-11-23 10:25:25,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:25:25,563 INFO L225 Difference]: With dead ends: 58 [2018-11-23 10:25:25,563 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 10:25:25,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-23 10:25:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 10:25:25,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2018-11-23 10:25:25,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:25,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 38 states. [2018-11-23 10:25:25,616 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 38 states. [2018-11-23 10:25:25,616 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 38 states. [2018-11-23 10:25:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:25,624 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-23 10:25:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-23 10:25:25,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:25,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:25,626 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 56 states. [2018-11-23 10:25:25,626 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 56 states. [2018-11-23 10:25:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:25,632 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-23 10:25:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-23 10:25:25,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:25,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:25,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:25,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 10:25:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 10:25:25,637 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 20 [2018-11-23 10:25:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:25,638 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 10:25:25,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 10:25:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 10:25:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:25:25,640 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:25,640 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 10:25:25,640 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:25,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:25,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1206280118, now seen corresponding path program 1 times [2018-11-23 10:25:25,641 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:25,641 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:25:25,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 10:25:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 10:25:25,852 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv0 32)] [?] RET #72#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), ~SIZE~0=(_ bv0 32)] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv0 32)] [?] ~SIZE~0 := #t~nondet1;havoc #t~nondet1; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; VAL [main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); VAL [main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem3|=(_ bv1 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !~bvsgt32(#t~mem3, ~i~0);havoc #t~mem3; VAL [main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); VAL [main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem4|=(_ bv2147483648 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !~bvsgt32(#t~mem4, ~i~0);havoc #t~mem4; VAL [main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; VAL [main_~i~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); VAL [main_~i~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] ~i~0 := 0bv32; VAL [main_~i~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); VAL [main_~i~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem6|=(_ bv1 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; [L8] ~SIZE~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~SIZE~0=0bv32] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L13-L37] assume ~bvsgt32(~SIZE~0, 1bv32); [L15] havoc ~i~0; [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~SIZE~0=2bv32] [L18] assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32)); [L20] assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32); [L21] ~i~0 := 1bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21-L31] assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); [L23] call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem3=1bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L23-L26] assume !~bvsgt32(#t~mem3, ~i~0); [L23] havoc #t~mem3; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem4=2147483648bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27-L30] assume !~bvsgt32(#t~mem4, ~i~0); [L27] havoc #t~mem4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21] #t~post2 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post2); [L21] havoc #t~post2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L21-L31] assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L33] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L33-L36] assume !!~bvslt32(~i~0, ~SIZE~0); [L35] call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem6=1bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L35] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L5] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; [L8] ~SIZE~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~SIZE~0=0bv32] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L13-L37] assume ~bvsgt32(~SIZE~0, 1bv32); [L15] havoc ~i~0; [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~SIZE~0=2bv32] [L18] assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32)); [L20] assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32); [L21] ~i~0 := 1bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21-L31] assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); [L23] call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem3=1bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L23-L26] assume !~bvsgt32(#t~mem3, ~i~0); [L23] havoc #t~mem3; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem4=2147483648bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27-L30] assume !~bvsgt32(#t~mem4, ~i~0); [L27] havoc #t~mem4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21] #t~post2 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post2); [L21] havoc #t~post2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L21-L31] assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L33] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L33-L36] assume !!~bvslt32(~i~0, ~SIZE~0); [L35] call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem6=1bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L35] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L5] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L8] ~SIZE~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~SIZE~0=0bv32] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L13] COND TRUE ~bvsgt32(~SIZE~0, 1bv32) [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~SIZE~0=2bv32] [L18] COND FALSE !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32)) [L20] assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32); [L21] ~i~0 := 1bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21-L31] COND FALSE !(!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32))) [L23] FCALL call #t~mem3 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L23] COND FALSE !(~bvsgt32(#t~mem3, ~i~0)) [L23] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem4=2147483648bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] COND FALSE !(~bvsgt32(#t~mem4, ~i~0)) [L27] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21] #t~post2 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post2); [L21] havoc #t~post2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L21-L31] COND TRUE !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L33] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L33-L36] COND FALSE !(!~bvslt32(~i~0, ~SIZE~0)) [L35] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L35] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L5] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L8] ~SIZE~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~SIZE~0=0bv32] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L13] COND TRUE ~bvsgt32(~SIZE~0, 1bv32) [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~SIZE~0=2bv32] [L18] COND FALSE !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32)) [L20] assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32); [L21] ~i~0 := 1bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21-L31] COND FALSE !(!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32))) [L23] FCALL call #t~mem3 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L23] COND FALSE !(~bvsgt32(#t~mem3, ~i~0)) [L23] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem4=2147483648bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] COND FALSE !(~bvsgt32(#t~mem4, ~i~0)) [L27] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21] #t~post2 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post2); [L21] havoc #t~post2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L21-L31] COND TRUE !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L33] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L33-L36] COND FALSE !(!~bvslt32(~i~0, ~SIZE~0)) [L35] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L35] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L5] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L8] ~SIZE~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~SIZE~0=0bv32] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L13] COND TRUE ~bvsgt32(~SIZE~0, 1bv32) [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~SIZE~0=2bv32] [L18] COND FALSE !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32)) [L20] assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32); [L21] ~i~0 := 1bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21-L31] COND FALSE !(!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32))) [L23] FCALL call #t~mem3 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L23] COND FALSE !(~bvsgt32(#t~mem3, ~i~0)) [L23] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem4=2147483648bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] COND FALSE !(~bvsgt32(#t~mem4, ~i~0)) [L27] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21] #t~post2 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post2); [L21] havoc #t~post2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L21-L31] COND TRUE !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L33] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L33-L36] COND FALSE !(!~bvslt32(~i~0, ~SIZE~0)) [L35] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L35] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L5] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L8] ~SIZE~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~SIZE~0=0bv32] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L13] COND TRUE ~bvsgt32(~SIZE~0, 1bv32) [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~SIZE~0=2bv32] [L18] COND FALSE !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32)) [L20] assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32); [L21] ~i~0 := 1bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21-L31] COND FALSE !(!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32))) [L23] FCALL call #t~mem3 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L23] COND FALSE !(~bvsgt32(#t~mem3, ~i~0)) [L23] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem4=2147483648bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] COND FALSE !(~bvsgt32(#t~mem4, ~i~0)) [L27] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21] #t~post2 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post2); [L21] havoc #t~post2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L21-L31] COND TRUE !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L33] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L33-L36] COND FALSE !(!~bvslt32(~i~0, ~SIZE~0)) [L35] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L35] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L5] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L8] int SIZE; VAL [\old(SIZE)=0, SIZE=0] [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] int a[SIZE]; VAL [\old(SIZE)=0, a={1:0}, SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [\old(SIZE)=0, a={1:0}, i=1, SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR a[2*i-2] VAL [\old(SIZE)=0, a={1: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={1:0}, a[2*i-1]=-2147483648, i=1, SIZE=2] [L27] COND FALSE !(a[2*i-1] > i) [L21] i++ VAL [\old(SIZE)=0, a={1:0}, i=2, SIZE=2] [L21] COND FALSE !(i <= SIZE/2) VAL [\old(SIZE)=0, a={1:0}, i=2, SIZE=2] [L33] i = 0 VAL [\old(SIZE)=0, a={1:0}, i=0, SIZE=2] [L33] COND TRUE i < SIZE [L35] EXPR a[i] VAL [\old(SIZE)=0, a={1: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 10:25:25,937 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 10:25:25,937 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 10:25:25,937 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 10:25:25,938 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 10:25:25,938 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 10:25:25,938 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 10:25:25,938 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 10:25:25,939 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 10:25:25,939 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 10:25:25,939 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 10:25:25,940 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 10:25:25,940 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 10:25:25,940 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:25:25,940 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:25:25,941 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 10:25:25,941 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 10:25:25,941 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 10:25:25,941 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2018-11-23 10:25:25,942 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2018-11-23 10:25:25,942 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2018-11-23 10:25:25,942 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:25:25,942 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-23 10:25:25,943 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-23 10:25:25,943 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-23 10:25:25,943 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 10:25:25,943 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 10:25:25,944 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2018-11-23 10:25:25,944 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 10:25:25,944 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 10:25:25,944 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2018-11-23 10:25:25,945 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-23 10:25:25,945 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-23 10:25:25,945 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-23 10:25:25,945 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2018-11-23 10:25:25,953 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2018-11-23 10:25:25,953 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2018-11-23 10:25:25,953 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 10:25:25,954 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 10:25:25,954 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-23 10:25:25,954 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-23 10:25:25,954 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 10:25:25,955 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 10:25:25,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:25:25 BoogieIcfgContainer [2018-11-23 10:25:25,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 10:25:25,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 10:25:25,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 10:25:25,962 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 10:25:25,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:18" (3/4) ... [2018-11-23 10:25:25,967 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|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv0 32)] [?] RET #72#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), ~SIZE~0=(_ bv0 32)] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv0 32)] [?] ~SIZE~0 := #t~nondet1;havoc #t~nondet1; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32));assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32);~i~0 := 1bv32; VAL [main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32));call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); VAL [main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem3|=(_ bv1 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !~bvsgt32(#t~mem3, ~i~0);havoc #t~mem3; VAL [main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); VAL [main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem4|=(_ bv2147483648 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !~bvsgt32(#t~mem4, ~i~0);havoc #t~mem4; VAL [main_~i~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; VAL [main_~i~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); VAL [main_~i~0=(_ bv2 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] ~i~0 := 0bv32; VAL [main_~i~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); VAL [main_~i~0=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem6|=(_ bv1 32), |main_~#a~0.base|=(_ bv1 32), |main_~#a~0.offset|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32), |old(~SIZE~0)|=(_ bv0 32), ~SIZE~0=(_ bv2 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; [L8] ~SIZE~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~SIZE~0=0bv32] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L13-L37] assume ~bvsgt32(~SIZE~0, 1bv32); [L15] havoc ~i~0; [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~SIZE~0=2bv32] [L18] assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32)); [L20] assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32); [L21] ~i~0 := 1bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21-L31] assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); [L23] call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem3=1bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L23-L26] assume !~bvsgt32(#t~mem3, ~i~0); [L23] havoc #t~mem3; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem4=2147483648bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27-L30] assume !~bvsgt32(#t~mem4, ~i~0); [L27] havoc #t~mem4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21] #t~post2 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post2); [L21] havoc #t~post2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L21-L31] assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L33] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L33-L36] assume !!~bvslt32(~i~0, ~SIZE~0); [L35] call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem6=1bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L35] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L5] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; [L8] ~SIZE~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~SIZE~0=0bv32] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L13-L37] assume ~bvsgt32(~SIZE~0, 1bv32); [L15] havoc ~i~0; [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~SIZE~0=2bv32] [L18] assume !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32)); [L20] assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32); [L21] ~i~0 := 1bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21-L31] assume !!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); [L23] call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem3=1bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L23-L26] assume !~bvsgt32(#t~mem3, ~i~0); [L23] havoc #t~mem3; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem4=2147483648bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27-L30] assume !~bvsgt32(#t~mem4, ~i~0); [L27] havoc #t~mem4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21] #t~post2 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post2); [L21] havoc #t~post2; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L21-L31] assume !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L33] ~i~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L33-L36] assume !!~bvslt32(~i~0, ~SIZE~0); [L35] call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem6=1bv32, old(~SIZE~0)=0bv32, ~#a~0.base=1bv32, ~#a~0.offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L35] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L5] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L8] ~SIZE~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~SIZE~0=0bv32] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L13] COND TRUE ~bvsgt32(~SIZE~0, 1bv32) [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~SIZE~0=2bv32] [L18] COND FALSE !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32)) [L20] assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32); [L21] ~i~0 := 1bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21-L31] COND FALSE !(!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32))) [L23] FCALL call #t~mem3 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L23] COND FALSE !(~bvsgt32(#t~mem3, ~i~0)) [L23] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem4=2147483648bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] COND FALSE !(~bvsgt32(#t~mem4, ~i~0)) [L27] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21] #t~post2 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post2); [L21] havoc #t~post2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L21-L31] COND TRUE !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L33] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L33-L36] COND FALSE !(!~bvslt32(~i~0, ~SIZE~0)) [L35] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L35] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L5] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L8] ~SIZE~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~SIZE~0=0bv32] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L13] COND TRUE ~bvsgt32(~SIZE~0, 1bv32) [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~SIZE~0=2bv32] [L18] COND FALSE !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32)) [L20] assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32); [L21] ~i~0 := 1bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21-L31] COND FALSE !(!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32))) [L23] FCALL call #t~mem3 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L23] COND FALSE !(~bvsgt32(#t~mem3, ~i~0)) [L23] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem4=2147483648bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] COND FALSE !(~bvsgt32(#t~mem4, ~i~0)) [L27] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21] #t~post2 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post2); [L21] havoc #t~post2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L21-L31] COND TRUE !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L33] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L33-L36] COND FALSE !(!~bvslt32(~i~0, ~SIZE~0)) [L35] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L35] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L5] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L8] ~SIZE~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~SIZE~0=0bv32] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L13] COND TRUE ~bvsgt32(~SIZE~0, 1bv32) [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~SIZE~0=2bv32] [L18] COND FALSE !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32)) [L20] assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32); [L21] ~i~0 := 1bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21-L31] COND FALSE !(!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32))) [L23] FCALL call #t~mem3 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L23] COND FALSE !(~bvsgt32(#t~mem3, ~i~0)) [L23] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem4=2147483648bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] COND FALSE !(~bvsgt32(#t~mem4, ~i~0)) [L27] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21] #t~post2 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post2); [L21] havoc #t~post2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L21-L31] COND TRUE !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L33] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L33-L36] COND FALSE !(!~bvslt32(~i~0, ~SIZE~0)) [L35] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L35] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L5] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; [L8] ~SIZE~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~SIZE~0=0bv32] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=0bv32] [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L13] COND TRUE ~bvsgt32(~SIZE~0, 1bv32) [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0)); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~SIZE~0=2bv32] [L18] COND FALSE !(0bv32 != ~bvsrem32(~SIZE~0, 2bv32)) [L20] assume 0bv32 != (if 0bv32 == ~bvsrem32(~SIZE~0, 2bv32) then 1bv32 else 0bv32); [L21] ~i~0 := 1bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21-L31] COND FALSE !(!~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32))) [L23] FCALL call #t~mem3 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 2bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem3=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L23] COND FALSE !(~bvsgt32(#t~mem3, ~i~0)) [L23] havoc #t~mem3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] FCALL call #t~mem4 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~bvsub32(~bvmul32(2bv32, ~i~0), 1bv32))) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem4=2147483648bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L27] COND FALSE !(~bvsgt32(#t~mem4, ~i~0)) [L27] havoc #t~mem4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=1bv32, ~SIZE~0=2bv32] [L21] #t~post2 := ~i~0; [L21] ~i~0 := ~bvadd32(1bv32, #t~post2); [L21] havoc #t~post2; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L21-L31] COND TRUE !~bvsle32(~i~0, ~bvsdiv32(~SIZE~0, 2bv32)) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=2bv32, ~SIZE~0=2bv32] [L33] ~i~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L33-L36] COND FALSE !(!~bvslt32(~i~0, ~SIZE~0)) [L35] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#a~0!base, offset: ~bvadd32(~#a~0!offset, ~bvmul32(4bv32, ~i~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=1bv32, old(~SIZE~0)=0bv32, ~#a~0!base=1bv32, ~#a~0!offset=0bv32, ~i~0=0bv32, ~SIZE~0=2bv32] [L35] CALL call __VERIFIER_assert((if ~bvsle32(#t~mem6, ~i~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~SIZE~0=2bv32] [L5] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, old(~SIZE~0)=0bv32, ~cond=0bv32, ~SIZE~0=2bv32] [L8] int SIZE; VAL [\old(SIZE)=0, SIZE=0] [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] int a[SIZE]; VAL [\old(SIZE)=0, a={1:0}, SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [\old(SIZE)=0, a={1:0}, i=1, SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR a[2*i-2] VAL [\old(SIZE)=0, a={1: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={1:0}, a[2*i-1]=-2147483648, i=1, SIZE=2] [L27] COND FALSE !(a[2*i-1] > i) [L21] i++ VAL [\old(SIZE)=0, a={1:0}, i=2, SIZE=2] [L21] COND FALSE !(i <= SIZE/2) VAL [\old(SIZE)=0, a={1:0}, i=2, SIZE=2] [L33] i = 0 VAL [\old(SIZE)=0, a={1:0}, i=0, SIZE=2] [L33] COND TRUE i < SIZE [L35] EXPR a[i] VAL [\old(SIZE)=0, a={1: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 10:25:26,096 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/array-tiling/skippedu_false-unreach-call.i-witness.graphml [2018-11-23 10:25:26,096 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 10:25:26,098 INFO L168 Benchmark]: Toolchain (without parser) took 9171.56 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -382.3 MB). Peak memory consumption was 337.0 MB. Max. memory is 7.1 GB. [2018-11-23 10:25:26,099 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:25:26,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.44 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 10:25:26,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.81 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 10:25:26,101 INFO L168 Benchmark]: Boogie Preprocessor took 68.02 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 10:25:26,101 INFO L168 Benchmark]: RCFGBuilder took 854.40 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 10:25:26,102 INFO L168 Benchmark]: TraceAbstraction took 7720.28 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 343.4 MB). Peak memory consumption was 343.4 MB. Max. memory is 7.1 GB. [2018-11-23 10:25:26,103 INFO L168 Benchmark]: Witness Printer took 134.52 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2018-11-23 10:25:26,108 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 354.44 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.81 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 68.02 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 854.40 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 719.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7720.28 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 343.4 MB). Peak memory consumption was 343.4 MB. Max. memory is 7.1 GB. * Witness Printer took 134.52 ms. Allocated memory is still 2.2 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. 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)=0, SIZE=0] [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] int a[SIZE]; VAL [\old(SIZE)=0, a={1:0}, SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [\old(SIZE)=0, a={1:0}, i=1, SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR a[2*i-2] VAL [\old(SIZE)=0, a={1: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={1:0}, a[2*i-1]=-2147483648, i=1, SIZE=2] [L27] COND FALSE !(a[2*i-1] > i) [L21] i++ VAL [\old(SIZE)=0, a={1:0}, i=2, SIZE=2] [L21] COND FALSE !(i <= SIZE/2) VAL [\old(SIZE)=0, a={1:0}, i=2, SIZE=2] [L33] i = 0 VAL [\old(SIZE)=0, a={1:0}, i=0, SIZE=2] [L33] COND TRUE i < SIZE [L35] EXPR a[i] VAL [\old(SIZE)=0, a={1: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, 7.6s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 45 SDtfs, 97 SDslu, 172 SDs, 0 SdLazy, 254 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s 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, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 4339 SizeOfPredicates, 10 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 12 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...