java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/matrix_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:23:16,084 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:23:16,086 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:23:16,098 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:23:16,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:23:16,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:23:16,100 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:23:16,102 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:23:16,104 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:23:16,105 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:23:16,106 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:23:16,106 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:23:16,107 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:23:16,108 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:23:16,109 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:23:16,110 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:23:16,111 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:23:16,113 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:23:16,115 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:23:16,117 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:23:16,118 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:23:16,119 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:23:16,121 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:23:16,122 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:23:16,122 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:23:16,123 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:23:16,124 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:23:16,125 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:23:16,126 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:23:16,127 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:23:16,127 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:23:16,128 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:23:16,128 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:23:16,128 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:23:16,129 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:23:16,130 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:23:16,131 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:23:16,158 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:23:16,158 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:23:16,159 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:23:16,159 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:23:16,162 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:23:16,162 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:23:16,162 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:23:16,164 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:23:16,164 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:23:16,164 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:23:16,164 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:23:16,164 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:23:16,165 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:23:16,165 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:23:16,165 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:23:16,165 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:23:16,165 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:23:16,166 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:23:16,166 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:23:16,166 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:23:16,166 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:23:16,166 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:23:16,167 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:23:16,167 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:23:16,167 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:23:16,167 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:23:16,167 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:23:16,168 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:23:16,169 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:23:16,170 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:23:16,170 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:23:16,170 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:23:16,170 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:23:16,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:23:16,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:23:16,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:23:16,265 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:23:16,265 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:23:16,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 11:23:16,327 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c0efc32/3b1b68d59b5e49edbc84c10ec842a935/FLAGba2a2c2f8 [2018-11-23 11:23:16,805 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:23:16,806 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix_false-unreach-call_true-termination.i [2018-11-23 11:23:16,813 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c0efc32/3b1b68d59b5e49edbc84c10ec842a935/FLAGba2a2c2f8 [2018-11-23 11:23:17,156 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c0efc32/3b1b68d59b5e49edbc84c10ec842a935 [2018-11-23 11:23:17,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:23:17,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:23:17,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:23:17,168 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:23:17,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:23:17,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:23:17" (1/1) ... [2018-11-23 11:23:17,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea32f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17, skipping insertion in model container [2018-11-23 11:23:17,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:23:17" (1/1) ... [2018-11-23 11:23:17,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:23:17,213 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:23:17,455 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:23:17,462 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:23:17,502 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:23:17,533 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:23:17,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17 WrapperNode [2018-11-23 11:23:17,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:23:17,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:23:17,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:23:17,536 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:23:17,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17" (1/1) ... [2018-11-23 11:23:17,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17" (1/1) ... [2018-11-23 11:23:17,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:23:17,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:23:17,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:23:17,569 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:23:17,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17" (1/1) ... [2018-11-23 11:23:17,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17" (1/1) ... [2018-11-23 11:23:17,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17" (1/1) ... [2018-11-23 11:23:17,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17" (1/1) ... [2018-11-23 11:23:17,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17" (1/1) ... [2018-11-23 11:23:17,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17" (1/1) ... [2018-11-23 11:23:17,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17" (1/1) ... [2018-11-23 11:23:17,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:23:17,623 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:23:17,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:23:17,625 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:23:17,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:23:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:23:17,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:23:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:23:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:23:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:23:17,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:23:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:23:17,769 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:23:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:23:17,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:23:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:23:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:23:18,438 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:23:18,438 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:23:18,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:18 BoogieIcfgContainer [2018-11-23 11:23:18,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:23:18,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:23:18,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:23:18,443 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:23:18,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:23:17" (1/3) ... [2018-11-23 11:23:18,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9d97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:23:18, skipping insertion in model container [2018-11-23 11:23:18,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:17" (2/3) ... [2018-11-23 11:23:18,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9d97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:23:18, skipping insertion in model container [2018-11-23 11:23:18,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:18" (3/3) ... [2018-11-23 11:23:18,447 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix_false-unreach-call_true-termination.i [2018-11-23 11:23:18,456 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:23:18,464 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:23:18,482 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:23:18,515 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:23:18,515 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:23:18,516 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:23:18,516 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:23:18,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:23:18,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:23:18,517 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:23:18,518 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:23:18,518 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:23:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 11:23:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:23:18,543 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:18,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:18,547 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:18,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:18,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2125374060, now seen corresponding path program 1 times [2018-11-23 11:23:18,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:18,559 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:18,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:18,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:18,904 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 11:23:18,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {32#true} is VALID [2018-11-23 11:23:18,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 11:23:18,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #78#return; {32#true} is VALID [2018-11-23 11:23:18,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret11 := main(); {32#true} is VALID [2018-11-23 11:23:18,911 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(~bvmul32(~bvmul32(4bv32, ~N_LIN~0), ~N_COL~0));havoc ~maior~0;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {32#true} is VALID [2018-11-23 11:23:18,924 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 11:23:18,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~j~0 := 0bv32; {33#false} is VALID [2018-11-23 11:23:18,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !!~bvult32(~j~0, ~N_COL~0);~k~0 := 0bv32; {33#false} is VALID [2018-11-23 11:23:18,925 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} assume !!~bvult32(~k~0, ~N_LIN~0);call #t~mem10 := read~intINTTYPE4(~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {33#false} is VALID [2018-11-23 11:23:18,926 INFO L256 TraceCheckUtils]: 10: Hoare triple {33#false} call __VERIFIER_assert((if ~bvslt32(#t~mem10, ~maior~0) then 1bv32 else 0bv32)); {33#false} is VALID [2018-11-23 11:23:18,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 11:23:18,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume 0bv32 == ~cond; {33#false} is VALID [2018-11-23 11:23:18,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 11:23:18,930 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 11:23:18,930 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:18,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:18,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:23:18,945 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:23:18,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:18,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:23:19,090 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 11:23:19,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:23:19,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:23:19,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:23:19,104 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 11:23:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:19,320 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2018-11-23 11:23:19,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:23:19,320 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:23:19,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:23:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 11:23:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:23:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 11:23:19,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 11:23:19,692 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 11:23:19,704 INFO L225 Difference]: With dead ends: 52 [2018-11-23 11:23:19,705 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 11:23:19,708 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 11:23:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 11:23:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 11:23:19,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:19,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 11:23:19,753 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:23:19,753 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:23:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:19,758 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 11:23:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 11:23:19,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:19,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:19,760 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 11:23:19,760 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 11:23:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:19,764 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 11:23:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 11:23:19,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:19,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:19,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:19,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:23:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 11:23:19,771 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2018-11-23 11:23:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:19,771 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 11:23:19,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:23:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 11:23:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:23:19,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:19,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:19,773 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:19,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:19,774 INFO L82 PathProgramCache]: Analyzing trace with hash 739661195, now seen corresponding path program 1 times [2018-11-23 11:23:19,774 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:19,774 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:19,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:19,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:19,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2018-11-23 11:23:19,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {225#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {225#true} is VALID [2018-11-23 11:23:19,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2018-11-23 11:23:19,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #78#return; {225#true} is VALID [2018-11-23 11:23:19,933 INFO L256 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret11 := main(); {225#true} is VALID [2018-11-23 11:23:19,933 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(~bvmul32(~bvmul32(4bv32, ~N_LIN~0), ~N_COL~0));havoc ~maior~0;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {245#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:23:19,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {245#(= main_~j~0 (_ bv0 32))} assume !~bvult32(~j~0, ~N_COL~0); {249#(not (bvult (_ bv0 32) main_~N_COL~0))} is VALID [2018-11-23 11:23:19,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {249#(not (bvult (_ bv0 32) main_~N_COL~0))} ~j~0 := 0bv32; {249#(not (bvult (_ bv0 32) main_~N_COL~0))} is VALID [2018-11-23 11:23:19,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {249#(not (bvult (_ bv0 32) main_~N_COL~0))} assume !!~bvult32(~j~0, ~N_COL~0);~k~0 := 0bv32; {226#false} is VALID [2018-11-23 11:23:19,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {226#false} assume !!~bvult32(~k~0, ~N_LIN~0);call #t~mem10 := read~intINTTYPE4(~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {226#false} is VALID [2018-11-23 11:23:19,940 INFO L256 TraceCheckUtils]: 10: Hoare triple {226#false} call __VERIFIER_assert((if ~bvslt32(#t~mem10, ~maior~0) then 1bv32 else 0bv32)); {226#false} is VALID [2018-11-23 11:23:19,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2018-11-23 11:23:19,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {226#false} assume 0bv32 == ~cond; {226#false} is VALID [2018-11-23 11:23:19,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {226#false} assume !false; {226#false} is VALID [2018-11-23 11:23:19,943 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 11:23:19,943 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:19,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:19,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:23:19,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 11:23:19,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:19,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:23:20,043 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 11:23:20,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:23:20,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:23:20,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:23:20,045 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 4 states. [2018-11-23 11:23:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:20,873 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-23 11:23:20,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:23:20,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 11:23:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:23:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 11:23:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:23:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 11:23:20,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2018-11-23 11:23:21,067 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 11:23:21,070 INFO L225 Difference]: With dead ends: 49 [2018-11-23 11:23:21,070 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:23:21,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 11:23:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:23:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2018-11-23 11:23:21,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:21,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 25 states. [2018-11-23 11:23:21,084 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 25 states. [2018-11-23 11:23:21,085 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 25 states. [2018-11-23 11:23:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:21,089 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-11-23 11:23:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 11:23:21,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:21,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:21,090 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 35 states. [2018-11-23 11:23:21,091 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 35 states. [2018-11-23 11:23:21,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:21,094 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-11-23 11:23:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 11:23:21,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:21,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:21,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:21,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:23:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-23 11:23:21,099 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2018-11-23 11:23:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:21,099 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-23 11:23:21,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:23:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 11:23:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:23:21,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:21,100 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 11:23:21,101 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:21,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:21,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1656958391, now seen corresponding path program 1 times [2018-11-23 11:23:21,102 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:21,102 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:21,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:21,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:21,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {447#true} call ULTIMATE.init(); {447#true} is VALID [2018-11-23 11:23:21,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {447#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {447#true} is VALID [2018-11-23 11:23:21,240 INFO L273 TraceCheckUtils]: 2: Hoare triple {447#true} assume true; {447#true} is VALID [2018-11-23 11:23:21,240 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {447#true} {447#true} #78#return; {447#true} is VALID [2018-11-23 11:23:21,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {447#true} call #t~ret11 := main(); {447#true} is VALID [2018-11-23 11:23:21,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {447#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(~bvmul32(~bvmul32(4bv32, ~N_LIN~0), ~N_COL~0));havoc ~maior~0;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; {447#true} is VALID [2018-11-23 11:23:21,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {447#true} assume !!~bvult32(~j~0, ~N_COL~0);~k~0 := 0bv32; {470#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:23:21,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {470#(= main_~k~0 (_ bv0 32))} assume !~bvult32(~k~0, ~N_LIN~0); {474#(not (bvult (_ bv0 32) main_~N_LIN~0))} is VALID [2018-11-23 11:23:21,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#(not (bvult (_ bv0 32) main_~N_LIN~0))} #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {474#(not (bvult (_ bv0 32) main_~N_LIN~0))} is VALID [2018-11-23 11:23:21,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {474#(not (bvult (_ bv0 32) main_~N_LIN~0))} assume !~bvult32(~j~0, ~N_COL~0); {474#(not (bvult (_ bv0 32) main_~N_LIN~0))} is VALID [2018-11-23 11:23:21,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {474#(not (bvult (_ bv0 32) main_~N_LIN~0))} ~j~0 := 0bv32; {474#(not (bvult (_ bv0 32) main_~N_LIN~0))} is VALID [2018-11-23 11:23:21,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {474#(not (bvult (_ bv0 32) main_~N_LIN~0))} assume !!~bvult32(~j~0, ~N_COL~0);~k~0 := 0bv32; {474#(not (bvult (_ bv0 32) main_~N_LIN~0))} is VALID [2018-11-23 11:23:21,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {474#(not (bvult (_ bv0 32) main_~N_LIN~0))} assume !!~bvult32(~k~0, ~N_LIN~0);call #t~mem10 := read~intINTTYPE4(~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {448#false} is VALID [2018-11-23 11:23:21,247 INFO L256 TraceCheckUtils]: 13: Hoare triple {448#false} call __VERIFIER_assert((if ~bvslt32(#t~mem10, ~maior~0) then 1bv32 else 0bv32)); {448#false} is VALID [2018-11-23 11:23:21,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {448#false} ~cond := #in~cond; {448#false} is VALID [2018-11-23 11:23:21,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {448#false} assume 0bv32 == ~cond; {448#false} is VALID [2018-11-23 11:23:21,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {448#false} assume !false; {448#false} is VALID [2018-11-23 11:23:21,251 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 11:23:21,251 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:21,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:21,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:23:21,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 11:23:21,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:21,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:23:21,315 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 11:23:21,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:23:21,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:23:21,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:23:21,317 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 4 states. [2018-11-23 11:23:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:21,995 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2018-11-23 11:23:21,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:23:21,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-23 11:23:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:23:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2018-11-23 11:23:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:23:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2018-11-23 11:23:22,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2018-11-23 11:23:22,216 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 11:23:22,219 INFO L225 Difference]: With dead ends: 57 [2018-11-23 11:23:22,220 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:23:22,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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 11:23:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:23:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-23 11:23:22,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:22,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 27 states. [2018-11-23 11:23:22,234 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 27 states. [2018-11-23 11:23:22,235 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 27 states. [2018-11-23 11:23:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:22,239 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 11:23:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 11:23:22,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:22,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:22,240 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 32 states. [2018-11-23 11:23:22,240 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 32 states. [2018-11-23 11:23:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:22,243 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 11:23:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-11-23 11:23:22,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:22,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:22,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:22,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:23:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 11:23:22,247 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2018-11-23 11:23:22,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:22,247 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 11:23:22,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:23:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 11:23:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:23:22,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:22,249 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 11:23:22,249 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:22,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:22,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1471852900, now seen corresponding path program 1 times [2018-11-23 11:23:22,250 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:22,250 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:22,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:23:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:23:22,535 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] assume true; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |old(#NULL.base)|=(_ bv0 32), |old(#NULL.offset)|=(_ bv0 32)] [?] RET #78#return; VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] CALL call #t~ret11 := main(); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32)] [?] ~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(~bvmul32(~bvmul32(4bv32, ~N_LIN~0), ~N_COL~0));havoc ~maior~0;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0bv32; VAL [main_~j~0=(_ bv0 32), main_~maior~0=(_ bv0 32), main_~N_COL~0=(_ bv1 32), main_~N_LIN~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#matriz~0.base|=(_ bv1 32), |main_~#matriz~0.offset|=(_ bv0 32)] [?] assume !!~bvult32(~j~0, ~N_COL~0);~k~0 := 0bv32; VAL [main_~j~0=(_ bv0 32), main_~k~0=(_ bv0 32), main_~maior~0=(_ bv0 32), main_~N_COL~0=(_ bv1 32), main_~N_LIN~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#matriz~0.base|=(_ bv1 32), |main_~#matriz~0.offset|=(_ bv0 32)] [?] assume !!~bvult32(~k~0, ~N_LIN~0);call write~intINTTYPE4(#t~nondet5, ~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);havoc #t~nondet5;call #t~mem6 := read~intINTTYPE4(~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); VAL [main_~j~0=(_ bv0 32), main_~k~0=(_ bv0 32), main_~maior~0=(_ bv0 32), main_~N_COL~0=(_ bv1 32), main_~N_LIN~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem6|=(_ bv1 32), |main_~#matriz~0.base|=(_ bv1 32), |main_~#matriz~0.offset|=(_ bv0 32)] [?] assume ~bvsgt32(#t~mem6, ~maior~0);havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~maior~0 := #t~mem7;havoc #t~mem7; VAL [main_~j~0=(_ bv0 32), main_~k~0=(_ bv0 32), main_~maior~0=(_ bv1 32), main_~N_COL~0=(_ bv1 32), main_~N_LIN~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#matriz~0.base|=(_ bv1 32), |main_~#matriz~0.offset|=(_ bv0 32)] [?] #t~post4 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; VAL [main_~j~0=(_ bv0 32), main_~k~0=(_ bv1 32), main_~maior~0=(_ bv1 32), main_~N_COL~0=(_ bv1 32), main_~N_LIN~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#matriz~0.base|=(_ bv1 32), |main_~#matriz~0.offset|=(_ bv0 32)] [?] assume !~bvult32(~k~0, ~N_LIN~0); VAL [main_~j~0=(_ bv0 32), main_~k~0=(_ bv1 32), main_~maior~0=(_ bv1 32), main_~N_COL~0=(_ bv1 32), main_~N_LIN~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#matriz~0.base|=(_ bv1 32), |main_~#matriz~0.offset|=(_ bv0 32)] [?] #t~post3 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; VAL [main_~j~0=(_ bv1 32), main_~k~0=(_ bv1 32), main_~maior~0=(_ bv1 32), main_~N_COL~0=(_ bv1 32), main_~N_LIN~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#matriz~0.base|=(_ bv1 32), |main_~#matriz~0.offset|=(_ bv0 32)] [?] assume !~bvult32(~j~0, ~N_COL~0); VAL [main_~j~0=(_ bv1 32), main_~k~0=(_ bv1 32), main_~maior~0=(_ bv1 32), main_~N_COL~0=(_ bv1 32), main_~N_LIN~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#matriz~0.base|=(_ bv1 32), |main_~#matriz~0.offset|=(_ bv0 32)] [?] ~j~0 := 0bv32; VAL [main_~j~0=(_ bv0 32), main_~k~0=(_ bv1 32), main_~maior~0=(_ bv1 32), main_~N_COL~0=(_ bv1 32), main_~N_LIN~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#matriz~0.base|=(_ bv1 32), |main_~#matriz~0.offset|=(_ bv0 32)] [?] assume !!~bvult32(~j~0, ~N_COL~0);~k~0 := 0bv32; VAL [main_~j~0=(_ bv0 32), main_~k~0=(_ bv0 32), main_~maior~0=(_ bv1 32), main_~N_COL~0=(_ bv1 32), main_~N_LIN~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_~#matriz~0.base|=(_ bv1 32), |main_~#matriz~0.offset|=(_ bv0 32)] [?] assume !!~bvult32(~k~0, ~N_LIN~0);call #t~mem10 := read~intINTTYPE4(~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); VAL [main_~j~0=(_ bv0 32), main_~k~0=(_ bv0 32), main_~maior~0=(_ bv1 32), main_~N_COL~0=(_ bv1 32), main_~N_LIN~0=(_ bv1 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |main_#t~mem10|=(_ bv1 32), |main_~#matriz~0.base|=(_ bv1 32), |main_~#matriz~0.offset|=(_ bv0 32)] [?] CALL call __VERIFIER_assert((if ~bvslt32(#t~mem10, ~maior~0) then 1bv32 else 0bv32)); VAL [|#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |#NULL.base|=(_ bv0 32), |#NULL.offset|=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [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(~bvmul32(~bvmul32(4bv32, ~N_LIN~0), ~N_COL~0)); [L17] havoc ~maior~0; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20-L27] assume !!~bvult32(~j~0, ~N_COL~0); [L21] ~k~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21-L27] assume !!~bvult32(~k~0, ~N_LIN~0); [L23] call write~intINTTYPE4(#t~nondet5, ~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); [L23] havoc #t~nondet5; [L25] call #t~mem6 := read~intINTTYPE4(~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem6=1bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L25-L26] assume ~bvsgt32(#t~mem6, ~maior~0); [L25] havoc #t~mem6; [L26] call #t~mem7 := read~intINTTYPE4(~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21] #t~post4 := ~k~0; [L21] ~k~0 := ~bvadd32(1bv32, #t~post4); [L21] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21-L27] assume !~bvult32(~k~0, ~N_LIN~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20] #t~post3 := ~j~0; [L20] ~j~0 := ~bvadd32(1bv32, #t~post3); [L20] havoc #t~post3; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=1bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20-L27] assume !~bvult32(~j~0, ~N_COL~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=1bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L29] ~j~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L29-L31] assume !!~bvult32(~j~0, ~N_COL~0); [L30] ~k~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L30-L31] assume !!~bvult32(~k~0, ~N_LIN~0); [L31] call #t~mem10 := read~intINTTYPE4(~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem10=1bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L31] CALL call __VERIFIER_assert((if ~bvslt32(#t~mem10, ~maior~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] #NULL.base, #NULL.offset := 0bv32, 0bv32; [?] #valid := #valid[0bv32 := 0bv1]; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] ensures true; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, old(#NULL.base)=0bv32, old(#NULL.offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0bv32, #NULL.offset=0bv32] [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(~bvmul32(~bvmul32(4bv32, ~N_LIN~0), ~N_COL~0)); [L17] havoc ~maior~0; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20-L27] assume !!~bvult32(~j~0, ~N_COL~0); [L21] ~k~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21-L27] assume !!~bvult32(~k~0, ~N_LIN~0); [L23] call write~intINTTYPE4(#t~nondet5, ~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); [L23] havoc #t~nondet5; [L25] call #t~mem6 := read~intINTTYPE4(~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem6=1bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L25-L26] assume ~bvsgt32(#t~mem6, ~maior~0); [L25] havoc #t~mem6; [L26] call #t~mem7 := read~intINTTYPE4(~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21] #t~post4 := ~k~0; [L21] ~k~0 := ~bvadd32(1bv32, #t~post4); [L21] havoc #t~post4; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21-L27] assume !~bvult32(~k~0, ~N_LIN~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20] #t~post3 := ~j~0; [L20] ~j~0 := ~bvadd32(1bv32, #t~post3); [L20] havoc #t~post3; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=1bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20-L27] assume !~bvult32(~j~0, ~N_COL~0); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=1bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L29] ~j~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L29-L31] assume !!~bvult32(~j~0, ~N_COL~0); [L30] ~k~0 := 0bv32; VAL [#NULL.base=0bv32, #NULL.offset=0bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L30-L31] assume !!~bvult32(~k~0, ~N_LIN~0); [L31] call #t~mem10 := read~intINTTYPE4(~#matriz~0.base, ~bvadd32(~bvadd32(~#matriz~0.offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); VAL [#NULL.base=0bv32, #NULL.offset=0bv32, #t~mem10=1bv32, ~#matriz~0.base=1bv32, ~#matriz~0.offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L31] CALL call __VERIFIER_assert((if ~bvslt32(#t~mem10, ~maior~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL.base=0bv32, #NULL.offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [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(~bvmul32(~bvmul32(4bv32, ~N_LIN~0), ~N_COL~0)); [L17] havoc ~maior~0; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20-L27] COND FALSE !(!~bvult32(~j~0, ~N_COL~0)) [L21] ~k~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21-L27] COND FALSE !(!~bvult32(~k~0, ~N_LIN~0)) [L23] FCALL call write~intINTTYPE4(#t~nondet5, { base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=1bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L25] COND TRUE ~bvsgt32(#t~mem6, ~maior~0) [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21] #t~post4 := ~k~0; [L21] ~k~0 := ~bvadd32(1bv32, #t~post4); [L21] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21-L27] COND TRUE !~bvult32(~k~0, ~N_LIN~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20] #t~post3 := ~j~0; [L20] ~j~0 := ~bvadd32(1bv32, #t~post3); [L20] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=1bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20-L27] COND TRUE !~bvult32(~j~0, ~N_COL~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=1bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L29] ~j~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L29-L31] COND FALSE !(!~bvult32(~j~0, ~N_COL~0)) [L30] ~k~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L30-L31] COND FALSE !(!~bvult32(~k~0, ~N_LIN~0)) [L31] FCALL call #t~mem10 := read~intINTTYPE4({ base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem10=1bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L31] CALL call __VERIFIER_assert((if ~bvslt32(#t~mem10, ~maior~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [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(~bvmul32(~bvmul32(4bv32, ~N_LIN~0), ~N_COL~0)); [L17] havoc ~maior~0; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20-L27] COND FALSE !(!~bvult32(~j~0, ~N_COL~0)) [L21] ~k~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21-L27] COND FALSE !(!~bvult32(~k~0, ~N_LIN~0)) [L23] FCALL call write~intINTTYPE4(#t~nondet5, { base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=1bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L25] COND TRUE ~bvsgt32(#t~mem6, ~maior~0) [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21] #t~post4 := ~k~0; [L21] ~k~0 := ~bvadd32(1bv32, #t~post4); [L21] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21-L27] COND TRUE !~bvult32(~k~0, ~N_LIN~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20] #t~post3 := ~j~0; [L20] ~j~0 := ~bvadd32(1bv32, #t~post3); [L20] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=1bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20-L27] COND TRUE !~bvult32(~j~0, ~N_COL~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=1bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L29] ~j~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L29-L31] COND FALSE !(!~bvult32(~j~0, ~N_COL~0)) [L30] ~k~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L30-L31] COND FALSE !(!~bvult32(~k~0, ~N_LIN~0)) [L31] FCALL call #t~mem10 := read~intINTTYPE4({ base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem10=1bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L31] CALL call __VERIFIER_assert((if ~bvslt32(#t~mem10, ~maior~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [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(~bvmul32(~bvmul32(4bv32, ~N_LIN~0), ~N_COL~0)); [L17] havoc ~maior~0; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20-L27] COND FALSE !(!~bvult32(~j~0, ~N_COL~0)) [L21] ~k~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21-L27] COND FALSE !(!~bvult32(~k~0, ~N_LIN~0)) [L23] FCALL call write~intINTTYPE4(#t~nondet5, { base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=1bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L25] COND TRUE ~bvsgt32(#t~mem6, ~maior~0) [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21] #t~post4 := ~k~0; [L21] ~k~0 := ~bvadd32(1bv32, #t~post4); [L21] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21-L27] COND TRUE !~bvult32(~k~0, ~N_LIN~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20] #t~post3 := ~j~0; [L20] ~j~0 := ~bvadd32(1bv32, #t~post3); [L20] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=1bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20-L27] COND TRUE !~bvult32(~j~0, ~N_COL~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=1bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L29] ~j~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L29-L31] COND FALSE !(!~bvult32(~j~0, ~N_COL~0)) [L30] ~k~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L30-L31] COND FALSE !(!~bvult32(~k~0, ~N_LIN~0)) [L31] FCALL call #t~mem10 := read~intINTTYPE4({ base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem10=1bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L31] CALL call __VERIFIER_assert((if ~bvslt32(#t~mem10, ~maior~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] #NULL := { base: 0bv32, offset: 0bv32 }; [?] #valid[0bv32] := 0bv1; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, old(#NULL!base)=0bv32, old(#NULL!offset)=0bv32] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0bv32, #NULL!offset=0bv32] [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(~bvmul32(~bvmul32(4bv32, ~N_LIN~0), ~N_COL~0)); [L17] havoc ~maior~0; [L19] ~maior~0 := #t~nondet2; [L19] havoc #t~nondet2; [L20] ~j~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20-L27] COND FALSE !(!~bvult32(~j~0, ~N_COL~0)) [L21] ~k~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21-L27] COND FALSE !(!~bvult32(~k~0, ~N_LIN~0)) [L23] FCALL call write~intINTTYPE4(#t~nondet5, { base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); [L23] havoc #t~nondet5; [L25] FCALL call #t~mem6 := read~intINTTYPE4({ base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem6=1bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=0bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L25] COND TRUE ~bvsgt32(#t~mem6, ~maior~0) [L25] havoc #t~mem6; [L26] FCALL call #t~mem7 := read~intINTTYPE4({ base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); [L26] ~maior~0 := #t~mem7; [L26] havoc #t~mem7; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21] #t~post4 := ~k~0; [L21] ~k~0 := ~bvadd32(1bv32, #t~post4); [L21] havoc #t~post4; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L21-L27] COND TRUE !~bvult32(~k~0, ~N_LIN~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20] #t~post3 := ~j~0; [L20] ~j~0 := ~bvadd32(1bv32, #t~post3); [L20] havoc #t~post3; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=1bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L20-L27] COND TRUE !~bvult32(~j~0, ~N_COL~0) VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=1bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L29] ~j~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=1bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L29-L31] COND FALSE !(!~bvult32(~j~0, ~N_COL~0)) [L30] ~k~0 := 0bv32; VAL [#NULL!base=0bv32, #NULL!offset=0bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L30-L31] COND FALSE !(!~bvult32(~k~0, ~N_LIN~0)) [L31] FCALL call #t~mem10 := read~intINTTYPE4({ base: ~#matriz~0!base, offset: ~bvadd32(~bvadd32(~#matriz~0!offset, ~bvmul32(~j~0, ~bvmul32(4bv32, ~N_LIN~0))), ~bvmul32(4bv32, ~k~0)) }, 4bv32); VAL [#NULL!base=0bv32, #NULL!offset=0bv32, #t~mem10=1bv32, ~#matriz~0!base=1bv32, ~#matriz~0!offset=0bv32, ~j~0=0bv32, ~k~0=0bv32, ~maior~0=1bv32, ~N_COL~0=1bv32, ~N_LIN~0=1bv32] [L31] CALL call __VERIFIER_assert((if ~bvslt32(#t~mem10, ~maior~0) then 1bv32 else 0bv32)); VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, #NULL!base=0bv32, #NULL!offset=0bv32, ~cond=0bv32] [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=0, matriz={1: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=1, matriz={1: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=1, matriz={1: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=1, matriz={1:0}, N_COL=1, N_LIN=1] [L21] COND FALSE !(k