java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum_array_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:02:49,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:49,089 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:49,101 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:49,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:49,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:49,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:49,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:49,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:49,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:49,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:49,111 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:49,111 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:49,113 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:49,114 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:49,115 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:49,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:49,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:49,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:49,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:49,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:49,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:49,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:49,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:49,141 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:49,146 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:49,147 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:49,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:49,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:49,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:49,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:49,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:49,155 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:49,155 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:49,158 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:49,159 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:49,160 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:02:49,188 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:49,189 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:49,190 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:49,191 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:49,191 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:49,191 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:49,192 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:49,192 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:49,192 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:49,192 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:49,193 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:49,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:49,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:49,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:49,193 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:49,194 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:49,194 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:49,194 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:49,194 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:49,194 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:49,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:49,195 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:49,195 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:49,195 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:49,195 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:49,196 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:49,196 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:49,196 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:49,196 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:49,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:49,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:02:49,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:49,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:49,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:49,290 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:49,291 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:49,291 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array_false-unreach-call.i [2018-11-23 13:02:49,369 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8efe36191/948a049767d04170b45ecec5d020f7c8/FLAGbd403e9db [2018-11-23 13:02:49,860 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:49,861 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array_false-unreach-call.i [2018-11-23 13:02:49,866 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8efe36191/948a049767d04170b45ecec5d020f7c8/FLAGbd403e9db [2018-11-23 13:02:50,219 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8efe36191/948a049767d04170b45ecec5d020f7c8 [2018-11-23 13:02:50,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:50,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:50,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:50,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:50,235 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:50,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:50" (1/1) ... [2018-11-23 13:02:50,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2690c4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50, skipping insertion in model container [2018-11-23 13:02:50,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:50" (1/1) ... [2018-11-23 13:02:50,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:50,271 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:50,497 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:50,502 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:50,537 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:50,567 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:50,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50 WrapperNode [2018-11-23 13:02:50,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:50,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:50,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:50,569 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:50,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50" (1/1) ... [2018-11-23 13:02:50,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50" (1/1) ... [2018-11-23 13:02:50,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:50,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:50,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:50,604 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:50,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50" (1/1) ... [2018-11-23 13:02:50,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50" (1/1) ... [2018-11-23 13:02:50,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50" (1/1) ... [2018-11-23 13:02:50,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50" (1/1) ... [2018-11-23 13:02:50,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50" (1/1) ... [2018-11-23 13:02:50,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50" (1/1) ... [2018-11-23 13:02:50,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50" (1/1) ... [2018-11-23 13:02:50,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:50,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:50,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:50,667 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:50,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50" (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 13:02:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:02:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:50,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:02:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:50,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:02:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:50,814 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:02:50,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:02:50,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:02:51,585 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:51,586 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 13:02:51,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:51 BoogieIcfgContainer [2018-11-23 13:02:51,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:51,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:51,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:51,591 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:51,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:50" (1/3) ... [2018-11-23 13:02:51,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cabd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:51, skipping insertion in model container [2018-11-23 13:02:51,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:50" (2/3) ... [2018-11-23 13:02:51,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cabd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:51, skipping insertion in model container [2018-11-23 13:02:51,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:51" (3/3) ... [2018-11-23 13:02:51,595 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array_false-unreach-call.i [2018-11-23 13:02:51,606 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:51,616 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:02:51,634 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:02:51,665 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:51,666 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:51,666 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:51,666 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:51,667 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:51,667 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:51,667 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:51,667 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:51,667 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 13:02:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:02:51,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:51,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:51,695 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:51,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:51,702 INFO L82 PathProgramCache]: Analyzing trace with hash 415311520, now seen corresponding path program 1 times [2018-11-23 13:02:51,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:51,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:51,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:51,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:51,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 13:02:51,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-23 13:02:51,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 13:02:51,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #77#return; {33#true} is VALID [2018-11-23 13:02:51,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret12 := main(); {33#true} is VALID [2018-11-23 13:02:51,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} ~M~0 := #t~nondet0;havoc #t~nondet0;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {33#true} is VALID [2018-11-23 13:02:51,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 13:02:51,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} ~i~0 := 0; {34#false} is VALID [2018-11-23 13:02:51,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {34#false} is VALID [2018-11-23 13:02:51,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0; {34#false} is VALID [2018-11-23 13:02:51,912 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {34#false} is VALID [2018-11-23 13:02:51,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} ~i~0 := 0; {34#false} is VALID [2018-11-23 13:02:51,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem11 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {34#false} is VALID [2018-11-23 13:02:51,913 INFO L256 TraceCheckUtils]: 13: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem11 == #t~mem9 - #t~mem10 then 1 else 0)); {34#false} is VALID [2018-11-23 13:02:51,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 13:02:51,914 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-23 13:02:51,914 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 13:02:51,918 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 13:02:51,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:51,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:02:51,926 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:02:51,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:51,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:02:52,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:52,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:02:52,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:02:52,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:02:52,035 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 13:02:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:52,360 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-23 13:02:52,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:02:52,360 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:02:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-23 13:02:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-23 13:02:52,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2018-11-23 13:02:52,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:52,671 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:02:52,671 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:02:52,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:02:52,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:02:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 13:02:52,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:52,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 13:02:52,718 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:02:52,718 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:02:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:52,723 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 13:02:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 13:02:52,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:52,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:52,724 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:02:52,724 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:02:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:52,729 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 13:02:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 13:02:52,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:52,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:52,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:52,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:02:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 13:02:52,735 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2018-11-23 13:02:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:52,735 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 13:02:52,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:02:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 13:02:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:02:52,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:52,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:52,737 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:52,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:52,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1687882214, now seen corresponding path program 1 times [2018-11-23 13:02:52,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:52,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:52,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:52,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:52,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:52,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 13:02:52,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {189#true} is VALID [2018-11-23 13:02:52,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 13:02:52,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #77#return; {189#true} is VALID [2018-11-23 13:02:52,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret12 := main(); {189#true} is VALID [2018-11-23 13:02:52,935 INFO L273 TraceCheckUtils]: 5: Hoare triple {189#true} ~M~0 := #t~nondet0;havoc #t~nondet0;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {191#(= main_~i~0 0)} is VALID [2018-11-23 13:02:52,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {191#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {192#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-23 13:02:52,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {192#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} ~i~0 := 0; {192#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-23 13:02:52,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {192#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {192#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-23 13:02:52,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {192#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} ~i~0 := 0; {192#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-23 13:02:52,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {192#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {192#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-23 13:02:52,954 INFO L273 TraceCheckUtils]: 11: Hoare triple {192#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} ~i~0 := 0; {192#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-23 13:02:52,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {192#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem11 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {190#false} is VALID [2018-11-23 13:02:52,956 INFO L256 TraceCheckUtils]: 13: Hoare triple {190#false} call __VERIFIER_assert((if #t~mem11 == #t~mem9 - #t~mem10 then 1 else 0)); {190#false} is VALID [2018-11-23 13:02:52,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2018-11-23 13:02:52,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {190#false} assume 0 == ~cond; {190#false} is VALID [2018-11-23 13:02:52,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 13:02:52,961 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 13:02:52,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:52,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:02:52,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 13:02:52,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:52,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:02:53,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:53,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:02:53,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:02:53,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:02:53,089 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 4 states. [2018-11-23 13:02:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,848 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2018-11-23 13:02:53,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:02:53,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 13:02:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:02:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 13:02:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:02:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2018-11-23 13:02:53,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 68 transitions. [2018-11-23 13:02:54,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:54,005 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:02:54,006 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:02:54,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:02:54,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-11-23 13:02:54,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:54,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 28 states. [2018-11-23 13:02:54,030 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 28 states. [2018-11-23 13:02:54,030 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 28 states. [2018-11-23 13:02:54,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:54,035 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 13:02:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 13:02:54,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:54,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:54,036 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 35 states. [2018-11-23 13:02:54,036 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 35 states. [2018-11-23 13:02:54,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:54,040 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 13:02:54,040 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 13:02:54,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:54,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:54,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:54,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:02:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 13:02:54,044 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 17 [2018-11-23 13:02:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:54,044 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 13:02:54,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:02:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 13:02:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:02:54,045 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:54,046 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, 1, 1, 1] [2018-11-23 13:02:54,046 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:54,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:54,046 INFO L82 PathProgramCache]: Analyzing trace with hash -825329612, now seen corresponding path program 1 times [2018-11-23 13:02:54,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:54,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:54,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:54,476 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=8, |#NULL.offset|=5, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=8, |old(#NULL.offset)|=5] [?] RET #77#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~M~0 := #t~nondet0;havoc #t~nondet0;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; VAL [main_~i~0=0, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet2; VAL [main_~i~0=0, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=1, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); VAL [main_~i~0=1, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] ~i~0 := 0; VAL [main_~i~0=0, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet4; VAL [main_~i~0=0, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=1, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); VAL [main_~i~0=1, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] ~i~0 := 0; VAL [main_~i~0=0, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem6 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call write~int(#t~mem6 + #t~mem7, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~mem6;havoc #t~mem7; VAL [main_~i~0=0, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); VAL [main_~i~0=1, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] ~i~0 := 0; VAL [main_~i~0=0, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem11 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [main_~i~0=0, main_~M~0=(- 4294967295), |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=3, |main_#t~mem11|=0, |main_#t~mem9|=(- 3), |main_~#A~0.base|=6, |main_~#A~0.offset|=0, |main_~#B~0.base|=9, |main_~#B~0.offset|=0, |main_~#C~0.base|=7, |main_~#C~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem11 == #t~mem9 - #t~mem10 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=8, #NULL.offset=5, old(#NULL.base)=8, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L16] havoc ~i~0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L18-L19] assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296); [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=1, ~M~0=-4294967295] [L18-L19] assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=1, ~M~0=-4294967295] [L21] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L21-L22] assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296); [L22] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L22] call write~int(#t~nondet4, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L22] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L21] #t~post3 := ~i~0; [L21] ~i~0 := 1 + #t~post3; [L21] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=1, ~M~0=-4294967295] [L21-L22] assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=1, ~M~0=-4294967295] [L24] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L24-L25] assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296); [L25] call #t~mem6 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L25] call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L25] call write~int(#t~mem6 + #t~mem7, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L25] havoc #t~mem6; [L25] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L24] #t~post5 := ~i~0; [L24] ~i~0 := 1 + #t~post5; [L24] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=1, ~M~0=-4294967295] [L24-L25] assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=1, ~M~0=-4294967295] [L27] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L27-L28] assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296); [L28] call #t~mem11 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L28] call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L28] call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=3, #t~mem11=0, #t~mem9=-3, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L28] CALL call __VERIFIER_assert((if #t~mem11 == #t~mem9 - #t~mem10 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=8, #NULL.offset=5, old(#NULL.base)=8, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=8, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L16] havoc ~i~0; [L18] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L18-L19] assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296); [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L19] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=1, ~M~0=-4294967295] [L18-L19] assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=1, ~M~0=-4294967295] [L21] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L21-L22] assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296); [L22] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L22] call write~int(#t~nondet4, ~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L22] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L21] #t~post3 := ~i~0; [L21] ~i~0 := 1 + #t~post3; [L21] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=1, ~M~0=-4294967295] [L21-L22] assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=1, ~M~0=-4294967295] [L24] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L24-L25] assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296); [L25] call #t~mem6 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L25] call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L25] call write~int(#t~mem6 + #t~mem7, ~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L25] havoc #t~mem6; [L25] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L24] #t~post5 := ~i~0; [L24] ~i~0 := 1 + #t~post5; [L24] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=1, ~M~0=-4294967295] [L24-L25] assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=1, ~M~0=-4294967295] [L27] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L27-L28] assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296); [L28] call #t~mem11 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L28] call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); [L28] call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=3, #t~mem11=0, #t~mem9=-3, ~#A~0.base=6, ~#A~0.offset=0, ~#B~0.base=9, ~#B~0.offset=0, ~#C~0.base=7, ~#C~0.offset=0, ~i~0=0, ~M~0=-4294967295] [L28] CALL call __VERIFIER_assert((if #t~mem11 == #t~mem9 - #t~mem10 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] FCALL call ~#A~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call ~#B~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call ~#C~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L16] havoc ~i~0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L18-L19] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] FCALL call write~int(#t~nondet2, { base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L18-L19] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L21-L22] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L22] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L22] FCALL call write~int(#t~nondet4, { base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L22] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L21] #t~post3 := ~i~0; [L21] ~i~0 := 1 + #t~post3; [L21] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L21-L22] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L24] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L24-L25] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L25] FCALL call #t~mem6 := read~int({ base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call #t~mem7 := read~int({ base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call write~int(#t~mem6 + #t~mem7, { base: ~#C~0!base, offset: ~#C~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] havoc #t~mem6; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L24] #t~post5 := ~i~0; [L24] ~i~0 := 1 + #t~post5; [L24] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L24-L25] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L27] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L27-L28] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L28] FCALL call #t~mem11 := read~int({ base: ~#C~0!base, offset: ~#C~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call #t~mem9 := read~int({ base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call #t~mem10 := read~int({ base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=3, #t~mem11=0, #t~mem9=-3, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L28] CALL call __VERIFIER_assert((if #t~mem11 == #t~mem9 - #t~mem10 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] FCALL call ~#A~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call ~#B~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call ~#C~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L16] havoc ~i~0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L18-L19] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] FCALL call write~int(#t~nondet2, { base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L18-L19] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L21-L22] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L22] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L22] FCALL call write~int(#t~nondet4, { base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L22] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L21] #t~post3 := ~i~0; [L21] ~i~0 := 1 + #t~post3; [L21] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L21-L22] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L24] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L24-L25] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L25] FCALL call #t~mem6 := read~int({ base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call #t~mem7 := read~int({ base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call write~int(#t~mem6 + #t~mem7, { base: ~#C~0!base, offset: ~#C~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] havoc #t~mem6; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L24] #t~post5 := ~i~0; [L24] ~i~0 := 1 + #t~post5; [L24] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L24-L25] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L27] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L27-L28] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L28] FCALL call #t~mem11 := read~int({ base: ~#C~0!base, offset: ~#C~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call #t~mem9 := read~int({ base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call #t~mem10 := read~int({ base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=3, #t~mem11=0, #t~mem9=-3, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L28] CALL call __VERIFIER_assert((if #t~mem11 == #t~mem9 - #t~mem10 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] FCALL call ~#A~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call ~#B~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call ~#C~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L16] havoc ~i~0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L18-L19] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] FCALL call write~int(#t~nondet2, { base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L18-L19] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L21-L22] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L22] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L22] FCALL call write~int(#t~nondet4, { base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L22] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L21] #t~post3 := ~i~0; [L21] ~i~0 := 1 + #t~post3; [L21] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L21-L22] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L24] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L24-L25] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L25] FCALL call #t~mem6 := read~int({ base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call #t~mem7 := read~int({ base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call write~int(#t~mem6 + #t~mem7, { base: ~#C~0!base, offset: ~#C~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] havoc #t~mem6; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L24] #t~post5 := ~i~0; [L24] ~i~0 := 1 + #t~post5; [L24] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L24-L25] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L27] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L27-L28] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L28] FCALL call #t~mem11 := read~int({ base: ~#C~0!base, offset: ~#C~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call #t~mem9 := read~int({ base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call #t~mem10 := read~int({ base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=3, #t~mem11=0, #t~mem9=-3, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L28] CALL call __VERIFIER_assert((if #t~mem11 == #t~mem9 - #t~mem10 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=8, #NULL!offset=5, old(#NULL!base)=8, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=8, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~M~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] FCALL call ~#A~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call ~#B~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L15] FCALL call ~#C~0 := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296)); [L16] havoc ~i~0; [L18] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L18-L19] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] FCALL call write~int(#t~nondet2, { base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L19] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L18] #t~post1 := ~i~0; [L18] ~i~0 := 1 + #t~post1; [L18] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L18-L19] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L21-L22] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L22] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L22] FCALL call write~int(#t~nondet4, { base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L22] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L21] #t~post3 := ~i~0; [L21] ~i~0 := 1 + #t~post3; [L21] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L21-L22] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L24] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L24-L25] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L25] FCALL call #t~mem6 := read~int({ base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call #t~mem7 := read~int({ base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] FCALL call write~int(#t~mem6 + #t~mem7, { base: ~#C~0!base, offset: ~#C~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L25] havoc #t~mem6; [L25] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L24] #t~post5 := ~i~0; [L24] ~i~0 := 1 + #t~post5; [L24] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L24-L25] COND TRUE !(~i~0 % 4294967296 < ~M~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=1, ~M~0=-4294967295] [L27] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L27-L28] COND FALSE !(!(~i~0 % 4294967296 < ~M~0 % 4294967296)) [L28] FCALL call #t~mem11 := read~int({ base: ~#C~0!base, offset: ~#C~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call #t~mem9 := read~int({ base: ~#A~0!base, offset: ~#A~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L28] FCALL call #t~mem10 := read~int({ base: ~#B~0!base, offset: ~#B~0!offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=3, #t~mem11=0, #t~mem9=-3, ~#A~0!base=6, ~#A~0!offset=0, ~#B~0!base=9, ~#B~0!offset=0, ~#C~0!base=7, ~#C~0!offset=0, ~i~0=0, ~M~0=-4294967295] [L28] CALL call __VERIFIER_assert((if #t~mem11 == #t~mem9 - #t~mem10 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L14] unsigned int M = __VERIFIER_nondet_uint(); [L15] int A[M], B[M], C[M]; [L16] unsigned int i; [L18] i=0 VAL [A={6:0}, B={9:0}, C={7:0}, i=0, M=1] [L18] COND TRUE i