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/matrix_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:02:26,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:26,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:26,123 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:26,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:26,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:26,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:26,128 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:26,130 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:26,131 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:26,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:26,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:26,133 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:26,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:26,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:26,136 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:26,137 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:26,139 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:26,141 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:26,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:26,144 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:26,146 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:26,148 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:26,149 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:26,149 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:26,150 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:26,151 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:26,152 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:26,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:26,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:26,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:26,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:26,155 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:26,155 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:26,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:26,160 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:26,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:26,176 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:26,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:26,181 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:26,181 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:26,182 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:26,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:26,182 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:26,182 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:26,182 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:26,183 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:26,183 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:26,183 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:26,183 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:26,183 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:26,184 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:26,184 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:26,184 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:26,184 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:26,184 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:26,185 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:26,185 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:26,185 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:26,185 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:26,185 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:26,185 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:26,186 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:26,186 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:26,186 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:26,186 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:26,186 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:26,187 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:02:26,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:26,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:26,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:26,265 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:26,266 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:26,266 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix_false-unreach-call_true-termination.i [2018-11-23 13:02:26,336 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa06b224/d39f306ce7774f63811382056620e0d2/FLAGaea49cc5e [2018-11-23 13:02:26,855 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:26,856 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix_false-unreach-call_true-termination.i [2018-11-23 13:02:26,863 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa06b224/d39f306ce7774f63811382056620e0d2/FLAGaea49cc5e [2018-11-23 13:02:27,217 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa06b224/d39f306ce7774f63811382056620e0d2 [2018-11-23 13:02:27,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:27,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:27,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:27,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:27,234 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:27,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:27" (1/1) ... [2018-11-23 13:02:27,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7098ea53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:27, skipping insertion in model container [2018-11-23 13:02:27,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:27" (1/1) ... [2018-11-23 13:02:27,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:27,271 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:27,491 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:27,495 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:27,530 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:27,558 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:27,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:27 WrapperNode [2018-11-23 13:02:27,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:27,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:27,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:27,560 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:27,570 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:27" (1/1) ... [2018-11-23 13:02:27,583 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:27" (1/1) ... [2018-11-23 13:02:27,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:27,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:27,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:27,593 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:27,604 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:27" (1/1) ... [2018-11-23 13:02:27,604 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:27" (1/1) ... [2018-11-23 13:02:27,607 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:27" (1/1) ... [2018-11-23 13:02:27,608 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:27" (1/1) ... [2018-11-23 13:02:27,629 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:27" (1/1) ... [2018-11-23 13:02:27,640 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:27" (1/1) ... [2018-11-23 13:02:27,641 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:27" (1/1) ... [2018-11-23 13:02:27,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:27,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:27,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:27,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:27,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:27" (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:27,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:02:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:27,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:02:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:27,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:27,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:02:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:27,783 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:02:27,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:02:27,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:02:28,527 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:28,527 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 13:02:28,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:28 BoogieIcfgContainer [2018-11-23 13:02:28,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:28,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:28,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:28,533 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:28,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:27" (1/3) ... [2018-11-23 13:02:28,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69108326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:28, skipping insertion in model container [2018-11-23 13:02:28,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:27" (2/3) ... [2018-11-23 13:02:28,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69108326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:28, skipping insertion in model container [2018-11-23 13:02:28,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:28" (3/3) ... [2018-11-23 13:02:28,537 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix_false-unreach-call_true-termination.i [2018-11-23 13:02:28,548 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:28,558 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:02:28,577 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:02:28,610 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:28,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:28,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:28,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:28,612 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:28,612 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:28,612 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:28,612 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:28,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 13:02:28,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:02:28,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:28,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:28,641 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:28,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:28,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2125374060, now seen corresponding path program 1 times [2018-11-23 13:02:28,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:28,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:28,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:28,747 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:02:28,747 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:02:28,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:02:28,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:28,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:29,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 13:02:29,046 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-23 13:02:29,046 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 13:02:29,047 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #78#return; {32#true} is VALID [2018-11-23 13:02:29,047 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret11 := main(); {32#true} is VALID [2018-11-23 13:02:29,047 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} ~N_LIN~0 := #t~nondet0;havoc #t~nondet0;~N_COL~0 := #t~nondet1;havoc #t~nondet1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {32#true} is VALID [2018-11-23 13:02:29,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 13:02:29,049 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~j~0 := 0; {33#false} is VALID [2018-11-23 13:02:29,049 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {33#false} is VALID [2018-11-23 13:02:29,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {33#false} is VALID [2018-11-23 13:02:29,050 INFO L256 TraceCheckUtils]: 10: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); {33#false} is VALID [2018-11-23 13:02:29,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 13:02:29,051 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 13:02:29,051 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 13:02:29,055 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:29,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:29,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:02:29,086 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:02:29,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:29,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:02:29,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:29,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:02:29,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:02:29,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:02:29,171 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 13:02:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:29,315 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2018-11-23 13:02:29,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:02:29,315 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:02:29,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 13:02:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 13:02:29,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 13:02:29,634 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 13:02:29,646 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:02:29,647 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:02:29,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:02:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 13:02:29,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:29,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 13:02:29,697 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:02:29,697 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:02:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:29,702 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 13:02:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 13:02:29,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:29,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:29,703 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:02:29,704 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:02:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:29,708 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 13:02:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 13:02:29,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:29,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:29,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:29,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:02:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 13:02:29,714 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2018-11-23 13:02:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:29,715 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 13:02:29,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:02:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 13:02:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:02:29,716 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:29,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:29,717 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:29,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:29,717 INFO L82 PathProgramCache]: Analyzing trace with hash 739661195, now seen corresponding path program 1 times [2018-11-23 13:02:29,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:29,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:29,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:29,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:29,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:29,727 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:02:29,727 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:02:29,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:02:29,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:29,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:30,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2018-11-23 13:02:30,431 INFO L273 TraceCheckUtils]: 1: Hoare triple {225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {225#true} is VALID [2018-11-23 13:02:30,431 INFO L273 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2018-11-23 13:02:30,431 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #78#return; {225#true} is VALID [2018-11-23 13:02:30,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret11 := main(); {225#true} is VALID [2018-11-23 13:02:30,442 INFO L273 TraceCheckUtils]: 5: Hoare triple {225#true} ~N_LIN~0 := #t~nondet0;havoc #t~nondet0;~N_COL~0 := #t~nondet1;havoc #t~nondet1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {245#(= main_~j~0 0)} is VALID [2018-11-23 13:02:30,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {245#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {249#(<= (mod main_~N_COL~0 4294967296) 0)} is VALID [2018-11-23 13:02:30,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {249#(<= (mod main_~N_COL~0 4294967296) 0)} ~j~0 := 0; {253#(and (<= (mod main_~N_COL~0 4294967296) 0) (= main_~j~0 0))} is VALID [2018-11-23 13:02:30,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {253#(and (<= (mod main_~N_COL~0 4294967296) 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {226#false} is VALID [2018-11-23 13:02:30,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {226#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {226#false} is VALID [2018-11-23 13:02:30,484 INFO L256 TraceCheckUtils]: 10: Hoare triple {226#false} call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); {226#false} is VALID [2018-11-23 13:02:30,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2018-11-23 13:02:30,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {226#false} assume 0 == ~cond; {226#false} is VALID [2018-11-23 13:02:30,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {226#false} assume !false; {226#false} is VALID [2018-11-23 13:02:30,486 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:30,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:30,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:02:30,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:02:30,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:30,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:02:30,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:30,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:02:30,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:02:30,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:30,537 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 5 states. [2018-11-23 13:02:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:30,942 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-23 13:02:30,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:02:30,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:02:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 13:02:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 13:02:30,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2018-11-23 13:02:31,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:31,074 INFO L225 Difference]: With dead ends: 49 [2018-11-23 13:02:31,075 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:02:31,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:02:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2018-11-23 13:02:31,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:31,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 25 states. [2018-11-23 13:02:31,096 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 25 states. [2018-11-23 13:02:31,096 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 25 states. [2018-11-23 13:02:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:31,100 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-11-23 13:02:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 13:02:31,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:31,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:31,101 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 35 states. [2018-11-23 13:02:31,102 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 35 states. [2018-11-23 13:02:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:31,106 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-11-23 13:02:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 13:02:31,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:31,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:31,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:31,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:02:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-23 13:02:31,110 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2018-11-23 13:02:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:31,110 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-23 13:02:31,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:02:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 13:02:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:02:31,112 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:31,112 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:31,112 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:31,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:31,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1656958391, now seen corresponding path program 1 times [2018-11-23 13:02:31,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:31,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:31,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:31,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:31,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:31,122 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:02:31,122 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:02:31,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:02:31,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:31,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:31,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {446#true} call ULTIMATE.init(); {446#true} is VALID [2018-11-23 13:02:31,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {446#true} is VALID [2018-11-23 13:02:31,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {446#true} assume true; {446#true} is VALID [2018-11-23 13:02:31,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {446#true} {446#true} #78#return; {446#true} is VALID [2018-11-23 13:02:31,385 INFO L256 TraceCheckUtils]: 4: Hoare triple {446#true} call #t~ret11 := main(); {446#true} is VALID [2018-11-23 13:02:31,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {446#true} ~N_LIN~0 := #t~nondet0;havoc #t~nondet0;~N_COL~0 := #t~nondet1;havoc #t~nondet1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {446#true} is VALID [2018-11-23 13:02:31,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {446#true} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {469#(= main_~k~0 0)} is VALID [2018-11-23 13:02:31,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {469#(= main_~k~0 0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {473#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2018-11-23 13:02:31,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {473#(<= (mod main_~N_LIN~0 4294967296) 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {473#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2018-11-23 13:02:31,439 INFO L273 TraceCheckUtils]: 9: Hoare triple {473#(<= (mod main_~N_LIN~0 4294967296) 0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {473#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2018-11-23 13:02:31,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {473#(<= (mod main_~N_LIN~0 4294967296) 0)} ~j~0 := 0; {473#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2018-11-23 13:02:31,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {473#(<= (mod main_~N_LIN~0 4294967296) 0)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {486#(and (<= (mod main_~N_LIN~0 4294967296) 0) (= main_~k~0 0))} is VALID [2018-11-23 13:02:31,475 INFO L273 TraceCheckUtils]: 12: Hoare triple {486#(and (<= (mod main_~N_LIN~0 4294967296) 0) (= main_~k~0 0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {447#false} is VALID [2018-11-23 13:02:31,475 INFO L256 TraceCheckUtils]: 13: Hoare triple {447#false} call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); {447#false} is VALID [2018-11-23 13:02:31,476 INFO L273 TraceCheckUtils]: 14: Hoare triple {447#false} ~cond := #in~cond; {447#false} is VALID [2018-11-23 13:02:31,476 INFO L273 TraceCheckUtils]: 15: Hoare triple {447#false} assume 0 == ~cond; {447#false} is VALID [2018-11-23 13:02:31,476 INFO L273 TraceCheckUtils]: 16: Hoare triple {447#false} assume !false; {447#false} is VALID [2018-11-23 13:02:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:31,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:31,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:02:31,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 13:02:31,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:31,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:02:31,548 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:31,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:02:31,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:02:31,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:31,550 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2018-11-23 13:02:31,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:31,846 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2018-11-23 13:02:31,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:02:31,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 13:02:31,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2018-11-23 13:02:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2018-11-23 13:02:31,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2018-11-23 13:02:32,031 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 13:02:32,034 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:02:32,034 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:02:32,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:32,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:02:32,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-23 13:02:32,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:32,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 27 states. [2018-11-23 13:02:32,069 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 27 states. [2018-11-23 13:02:32,069 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 27 states. [2018-11-23 13:02:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:32,073 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 13:02:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 13:02:32,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:32,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:32,075 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 32 states. [2018-11-23 13:02:32,075 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 32 states. [2018-11-23 13:02:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:32,078 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 13:02:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 13:02:32,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:32,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:32,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:32,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:02:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 13:02:32,083 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2018-11-23 13:02:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:32,083 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 13:02:32,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:02:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 13:02:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:02:32,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:32,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:32,085 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:32,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1471852900, now seen corresponding path program 1 times [2018-11-23 13:02:32,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:32,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:32,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:32,096 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:02:32,097 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:02:32,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:02:32,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:32,216 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=2, |#NULL.offset|=3, |old(#NULL.base)|=2, |old(#NULL.offset)|=3] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2, |old(#NULL.offset)|=3] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2, |old(#NULL.offset)|=3] [?] RET #78#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~N_LIN~0 := #t~nondet0;havoc #t~nondet0;~N_COL~0 := #t~nondet1;havoc #t~nondet1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; VAL [main_~j~0=0, main_~maior~0=(- 2147483058), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147483058), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet5;call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147483058), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6|=(- 2147483057), |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume #t~mem6 > ~maior~0;havoc #t~mem6;call #t~mem7 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem7;havoc #t~mem7; VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] #t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~j~0=0, main_~k~0=1, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); VAL [main_~j~0=0, main_~k~0=1, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~j~0=1, main_~k~0=1, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); VAL [main_~j~0=1, main_~k~0=1, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] ~j~0 := 0; VAL [main_~j~0=0, main_~k~0=1, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=(- 2147483057), |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 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=2, #NULL.offset=3, old(#NULL.base)=2, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L21] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] call write~int(#t~nondet5, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] havoc #t~nondet5; [L25] call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=-2147483057, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L25-L26] assume #t~mem6 > ~maior~0; [L25] havoc #t~mem6; [L26] call #t~mem7 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L30] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L31] call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=-2147483057, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] 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=2, #NULL.offset=3, old(#NULL.base)=2, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L21] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] call write~int(#t~nondet5, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] havoc #t~nondet5; [L25] call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=-2147483057, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L25-L26] assume #t~mem6 > ~maior~0; [L25] havoc #t~mem6; [L26] call #t~mem7 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L30] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L31] call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=-2147483057, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] 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=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] 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=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L14] unsigned int N_LIN=__VERIFIER_nondet_uint(); [L15] unsigned int N_COL=__VERIFIER_nondet_uint(); [L16] unsigned int j,k; [L17] int matriz[N_COL][N_LIN], maior; [L19] maior = __VERIFIER_nondet_int() [L20] j=0 VAL [j=0, maior=-2147483058, matriz={6:0}, N_COL=1, N_LIN=1] [L20] COND TRUE jmaior [L26] EXPR matriz[j][k] [L26] maior = matriz[j][k] [L21] k++ VAL [j=0, k=1, maior=-2147483057, matriz={6:0}, N_COL=1, N_LIN=1] [L21] COND FALSE !(k ~maior~0;havoc #t~mem6;call #t~mem7 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem7;havoc #t~mem7; VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] #t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; VAL [main_~j~0=0, main_~k~0=1, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); VAL [main_~j~0=0, main_~k~0=1, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~j~0=1, main_~k~0=1, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); VAL [main_~j~0=1, main_~k~0=1, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] ~j~0 := 0; VAL [main_~j~0=0, main_~k~0=1, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [main_~j~0=0, main_~k~0=0, main_~maior~0=(- 2147483057), main_~N_COL~0=1, main_~N_LIN~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=(- 2147483057), |main_~#matriz~0.base|=6, |main_~#matriz~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 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=2, #NULL.offset=3, old(#NULL.base)=2, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L21] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] call write~int(#t~nondet5, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] havoc #t~nondet5; [L25] call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=-2147483057, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L25-L26] assume #t~mem6 > ~maior~0; [L25] havoc #t~mem6; [L26] call #t~mem7 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L30] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L31] call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=-2147483057, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] 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=2, #NULL.offset=3, old(#NULL.base)=2, old(#NULL.offset)=3] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2, old(#NULL.offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L21] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] call write~int(#t~nondet5, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] havoc #t~nondet5; [L25] call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=-2147483057, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L25-L26] assume #t~mem6 > ~maior~0; [L25] havoc #t~mem6; [L26] call #t~mem7 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); [L30] ~k~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); [L31] call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=-2147483057, ~#matriz~0.base=6, ~#matriz~0.offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] 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=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] 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=2, #NULL!offset=3, old(#NULL!base)=2, old(#NULL!offset)=3] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2, old(#NULL!offset)=3] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L14] ~N_LIN~0 := #t~nondet0; [L14] havoc #t~nondet0; [L15] ~N_COL~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] havoc ~j~0; [L16] havoc ~k~0; [L17] FCALL call ~#matriz~0 := #Ultimate.alloc(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296)); [L17] havoc ~maior~0; [L19] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L21] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] FCALL call write~int(#t~nondet5, { base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483058, ~N_COL~0=1, ~N_LIN~0=1] [L25] COND TRUE #t~mem6 > ~maior~0 [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21] #t~post4 := ~k~0; [L21] ~k~0 := 1 + #t~post4; [L21] havoc #t~post4; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L21-L27] COND TRUE !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20] #t~post3 := ~j~0; [L20] ~j~0 := 1 + #t~post3; [L20] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L20-L27] COND TRUE !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=1, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=1, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L29-L31] COND FALSE !(!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296)) [L30] ~k~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L30-L31] COND FALSE !(!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296)) [L31] FCALL call #t~mem10 := read~int({ base: ~#matriz~0!base, offset: ~#matriz~0!offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=-2147483057, ~#matriz~0!base=6, ~#matriz~0!offset=0, ~j~0=0, ~k~0=0, ~maior~0=-2147483057, ~N_COL~0=1, ~N_LIN~0=1] [L31] CALL call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L14] unsigned int N_LIN=__VERIFIER_nondet_uint(); [L15] unsigned int N_COL=__VERIFIER_nondet_uint(); [L16] unsigned int j,k; [L17] int matriz[N_COL][N_LIN], maior; [L19] maior = __VERIFIER_nondet_int() [L20] j=0 VAL [j=0, maior=-2147483058, matriz={6:0}, N_COL=1, N_LIN=1] [L20] COND TRUE jmaior [L26] EXPR matriz[j][k] [L26] maior = matriz[j][k] [L21] k++ VAL [j=0, k=1, maior=-2147483057, matriz={6:0}, N_COL=1, N_LIN=1] [L21] COND FALSE !(kmaior [L26] EXPR matriz[j][k] [L26] maior = matriz[j][k] [L21] k++ VAL [j=0, k=1, maior=-2147483057, matriz={6:0}, N_COL=1, N_LIN=1] [L21] COND FALSE !(k