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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loops/matrix_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:17:10,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:17:10,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:17:10,289 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:17:10,289 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:17:10,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:17:10,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:17:10,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:17:10,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:17:10,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:17:10,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:17:10,298 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:17:10,299 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:17:10,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:17:10,301 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:17:10,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:17:10,303 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:17:10,305 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:17:10,307 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:17:10,309 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:17:10,311 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:17:10,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:17:10,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:17:10,315 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:17:10,315 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:17:10,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:17:10,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:17:10,318 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:17:10,319 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:17:10,321 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:17:10,321 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:17:10,322 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:17:10,322 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:17:10,322 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:17:10,326 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:17:10,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:17:10,330 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:17:10,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:17:10,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:17:10,364 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:17:10,364 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:17:10,365 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:17:10,365 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:17:10,365 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:17:10,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:17:10,366 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:17:10,366 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:17:10,366 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:17:10,366 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:17:10,368 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:17:10,368 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:17:10,368 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:17:10,368 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:17:10,369 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:17:10,370 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:17:10,370 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:17:10,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:17:10,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:17:10,371 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:17:10,371 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:17:10,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:17:10,372 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:17:10,372 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:17:10,372 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:17:10,372 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:17:10,373 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:17:10,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:17:10,373 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:17:10,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:17:10,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:17:10,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:17:10,454 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:17:10,454 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:17:10,455 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-14 19:17:10,526 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e98fbcb/b571bb200f6d48a784475686ca88563d/FLAG53a631c6f [2018-11-14 19:17:11,071 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:17:11,074 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix_false-unreach-call_true-termination.i [2018-11-14 19:17:11,087 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e98fbcb/b571bb200f6d48a784475686ca88563d/FLAG53a631c6f [2018-11-14 19:17:11,111 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5e98fbcb/b571bb200f6d48a784475686ca88563d [2018-11-14 19:17:11,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:17:11,126 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:17:11,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:17:11,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:17:11,132 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:17:11,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:17:11" (1/1) ... [2018-11-14 19:17:11,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cd8e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:11, skipping insertion in model container [2018-11-14 19:17:11,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:17:11" (1/1) ... [2018-11-14 19:17:11,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:17:11,179 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:17:11,404 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:17:11,419 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:17:11,455 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:17:11,479 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:17:11,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:11 WrapperNode [2018-11-14 19:17:11,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:17:11,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:17:11,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:17:11,480 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:17:11,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:11" (1/1) ... [2018-11-14 19:17:11,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:11" (1/1) ... [2018-11-14 19:17:11,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:11" (1/1) ... [2018-11-14 19:17:11,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:11" (1/1) ... [2018-11-14 19:17:11,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:11" (1/1) ... [2018-11-14 19:17:11,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:11" (1/1) ... [2018-11-14 19:17:11,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:11" (1/1) ... [2018-11-14 19:17:11,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:17:11,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:17:11,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:17:11,536 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:17:11,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:11" (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-14 19:17:11,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:17:11,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:17:11,668 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:17:11,668 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:17:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:17:11,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:17:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 19:17:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:17:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:17:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:17:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:17:11,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:17:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:17:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:17:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:17:11,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:17:12,512 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:17:12,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:17:12 BoogieIcfgContainer [2018-11-14 19:17:12,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:17:12,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:17:12,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:17:12,518 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:17:12,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:17:11" (1/3) ... [2018-11-14 19:17:12,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d43ecc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:17:12, skipping insertion in model container [2018-11-14 19:17:12,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:17:11" (2/3) ... [2018-11-14 19:17:12,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d43ecc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:17:12, skipping insertion in model container [2018-11-14 19:17:12,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:17:12" (3/3) ... [2018-11-14 19:17:12,522 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix_false-unreach-call_true-termination.i [2018-11-14 19:17:12,532 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:17:12,541 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:17:12,559 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:17:12,592 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:17:12,593 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:17:12,593 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:17:12,593 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:17:12,593 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:17:12,594 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:17:12,594 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:17:12,594 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:17:12,594 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:17:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-14 19:17:12,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 19:17:12,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:12,622 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:12,624 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:12,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash -693261454, now seen corresponding path program 1 times [2018-11-14 19:17:12,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:12,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:12,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:12,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:12,724 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:17:12,724 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:17:12,724 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-14 19:17:12,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:12,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:17:12,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 19:17:12,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36#true} is VALID [2018-11-14 19:17:12,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 19:17:12,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #82#return; {36#true} is VALID [2018-11-14 19:17:12,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2018-11-14 19:17:12,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#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((if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * 4 * (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; {36#true} is VALID [2018-11-14 19:17:12,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 19:17:12,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} ~j~0 := 0; {37#false} is VALID [2018-11-14 19:17:12,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 19:17:12,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {37#false} is VALID [2018-11-14 19:17:12,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 19:17:12,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#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) * ((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, 4); {37#false} is VALID [2018-11-14 19:17:12,907 INFO L256 TraceCheckUtils]: 12: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); {37#false} is VALID [2018-11-14 19:17:12,907 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-14 19:17:12,908 INFO L273 TraceCheckUtils]: 14: Hoare triple {37#false} assume ~cond == 0; {37#false} is VALID [2018-11-14 19:17:12,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 19:17:12,911 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-14 19:17:12,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:17:12,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:17:12,945 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 19:17:12,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:12,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:17:13,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:13,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:17:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:17:13,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:17:13,129 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-14 19:17:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:13,423 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2018-11-14 19:17:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:17:13,423 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 19:17:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:17:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-14 19:17:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:17:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-14 19:17:13,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2018-11-14 19:17:13,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:13,709 INFO L225 Difference]: With dead ends: 60 [2018-11-14 19:17:13,709 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 19:17:13,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-14 19:17:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 19:17:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 19:17:13,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:13,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 19:17:13,875 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 19:17:13,875 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 19:17:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:13,880 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 19:17:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 19:17:13,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:13,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:13,882 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 19:17:13,882 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 19:17:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:13,886 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 19:17:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 19:17:13,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:13,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:13,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:13,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 19:17:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-14 19:17:13,893 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2018-11-14 19:17:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:13,894 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-14 19:17:13,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:17:13,894 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 19:17:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:17:13,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:13,895 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:13,896 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:13,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:13,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1162396557, now seen corresponding path program 1 times [2018-11-14 19:17:13,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:13,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:13,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:13,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:13,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:13,906 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:17:13,907 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:17:13,907 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-14 19:17:13,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:13,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:17:14,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {255#true} is VALID [2018-11-14 19:17:14,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {255#true} is VALID [2018-11-14 19:17:14,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2018-11-14 19:17:14,307 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {255#true} {255#true} #82#return; {255#true} is VALID [2018-11-14 19:17:14,307 INFO L256 TraceCheckUtils]: 4: Hoare triple {255#true} call #t~ret11 := main(); {255#true} is VALID [2018-11-14 19:17:14,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {255#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((if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * 4 * (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; {275#(= main_~j~0 0)} is VALID [2018-11-14 19:17:14,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {275#(= main_~j~0 0)} assume true; {275#(= main_~j~0 0)} is VALID [2018-11-14 19:17:14,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {275#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {282#(<= (mod main_~N_COL~0 4294967296) 0)} is VALID [2018-11-14 19:17:14,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {282#(<= (mod main_~N_COL~0 4294967296) 0)} ~j~0 := 0; {286#(and (<= (mod main_~N_COL~0 4294967296) 0) (= main_~j~0 0))} is VALID [2018-11-14 19:17:14,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {286#(and (<= (mod main_~N_COL~0 4294967296) 0) (= main_~j~0 0))} assume true; {286#(and (<= (mod main_~N_COL~0 4294967296) 0) (= main_~j~0 0))} is VALID [2018-11-14 19:17:14,326 INFO L273 TraceCheckUtils]: 10: Hoare triple {286#(and (<= (mod main_~N_COL~0 4294967296) 0) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {256#false} is VALID [2018-11-14 19:17:14,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {256#false} assume true; {256#false} is VALID [2018-11-14 19:17:14,326 INFO L273 TraceCheckUtils]: 12: Hoare triple {256#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) * ((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, 4); {256#false} is VALID [2018-11-14 19:17:14,327 INFO L256 TraceCheckUtils]: 13: Hoare triple {256#false} call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); {256#false} is VALID [2018-11-14 19:17:14,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {256#false} ~cond := #in~cond; {256#false} is VALID [2018-11-14 19:17:14,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {256#false} assume ~cond == 0; {256#false} is VALID [2018-11-14 19:17:14,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {256#false} assume !false; {256#false} is VALID [2018-11-14 19:17:14,330 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-14 19:17:14,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:17:14,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:17:14,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 19:17:14,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:14,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:17:14,571 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-14 19:17:14,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:17:14,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:17:14,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:17:14,572 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-11-14 19:17:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:15,139 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-14 19:17:15,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:17:15,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 19:17:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:17:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-14 19:17:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:17:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-14 19:17:15,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-14 19:17:15,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:15,293 INFO L225 Difference]: With dead ends: 60 [2018-11-14 19:17:15,294 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 19:17:15,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:17:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 19:17:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-11-14 19:17:15,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:15,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 30 states. [2018-11-14 19:17:15,318 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 30 states. [2018-11-14 19:17:15,319 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 30 states. [2018-11-14 19:17:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:15,325 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-14 19:17:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-14 19:17:15,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:15,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:15,327 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 43 states. [2018-11-14 19:17:15,327 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 43 states. [2018-11-14 19:17:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:15,331 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-14 19:17:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-14 19:17:15,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:15,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:15,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:15,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 19:17:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-14 19:17:15,336 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2018-11-14 19:17:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:15,336 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-14 19:17:15,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:17:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 19:17:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 19:17:15,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:15,338 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:15,338 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:15,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash 243468249, now seen corresponding path program 1 times [2018-11-14 19:17:15,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:15,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:15,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:15,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:15,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:15,347 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:17:15,347 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:17:15,347 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-14 19:17:15,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:17:15,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:17:15,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {517#true} call ULTIMATE.init(); {517#true} is VALID [2018-11-14 19:17:15,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {517#true} is VALID [2018-11-14 19:17:15,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2018-11-14 19:17:15,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #82#return; {517#true} is VALID [2018-11-14 19:17:15,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {517#true} call #t~ret11 := main(); {517#true} is VALID [2018-11-14 19:17:15,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {517#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((if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * 4 * (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; {517#true} is VALID [2018-11-14 19:17:15,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {517#true} assume true; {517#true} is VALID [2018-11-14 19:17:15,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#true} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {543#(= main_~k~0 0)} is VALID [2018-11-14 19:17:15,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {543#(= main_~k~0 0)} assume true; {543#(= main_~k~0 0)} is VALID [2018-11-14 19:17:15,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {543#(= main_~k~0 0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {550#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2018-11-14 19:17:15,537 INFO L273 TraceCheckUtils]: 10: Hoare triple {550#(<= (mod main_~N_LIN~0 4294967296) 0)} #t~post3 := ~j~0;~j~0 := #t~post3 + 1;havoc #t~post3; {550#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2018-11-14 19:17:15,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {550#(<= (mod main_~N_LIN~0 4294967296) 0)} assume true; {550#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2018-11-14 19:17:15,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {550#(<= (mod main_~N_LIN~0 4294967296) 0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {550#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2018-11-14 19:17:15,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {550#(<= (mod main_~N_LIN~0 4294967296) 0)} ~j~0 := 0; {550#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2018-11-14 19:17:15,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {550#(<= (mod main_~N_LIN~0 4294967296) 0)} assume true; {550#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2018-11-14 19:17:15,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {550#(<= (mod main_~N_LIN~0 4294967296) 0)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {569#(and (<= (mod main_~N_LIN~0 4294967296) 0) (= main_~k~0 0))} is VALID [2018-11-14 19:17:15,551 INFO L273 TraceCheckUtils]: 16: Hoare triple {569#(and (<= (mod main_~N_LIN~0 4294967296) 0) (= main_~k~0 0))} assume true; {569#(and (<= (mod main_~N_LIN~0 4294967296) 0) (= main_~k~0 0))} is VALID [2018-11-14 19:17:15,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {569#(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) * ((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, 4); {518#false} is VALID [2018-11-14 19:17:15,552 INFO L256 TraceCheckUtils]: 18: Hoare triple {518#false} call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); {518#false} is VALID [2018-11-14 19:17:15,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {518#false} ~cond := #in~cond; {518#false} is VALID [2018-11-14 19:17:15,553 INFO L273 TraceCheckUtils]: 20: Hoare triple {518#false} assume ~cond == 0; {518#false} is VALID [2018-11-14 19:17:15,553 INFO L273 TraceCheckUtils]: 21: Hoare triple {518#false} assume !false; {518#false} is VALID [2018-11-14 19:17:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:17:15,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:17:15,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:17:15,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 19:17:15,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:17:15,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:17:15,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:15,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:17:15,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:17:15,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:17:15,618 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-14 19:17:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:16,099 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-11-14 19:17:16,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:17:16,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 19:17:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:17:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:17:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2018-11-14 19:17:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:17:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2018-11-14 19:17:16,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 85 transitions. [2018-11-14 19:17:16,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:17:16,234 INFO L225 Difference]: With dead ends: 72 [2018-11-14 19:17:16,235 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 19:17:16,235 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-14 19:17:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 19:17:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-11-14 19:17:16,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:17:16,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 34 states. [2018-11-14 19:17:16,267 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 34 states. [2018-11-14 19:17:16,267 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 34 states. [2018-11-14 19:17:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:16,271 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-14 19:17:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-14 19:17:16,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:16,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:16,273 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 39 states. [2018-11-14 19:17:16,273 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 39 states. [2018-11-14 19:17:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:17:16,276 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-14 19:17:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-14 19:17:16,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:17:16,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:17:16,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:17:16,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:17:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 19:17:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-14 19:17:16,280 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 22 [2018-11-14 19:17:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:17:16,280 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-14 19:17:16,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:17:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 19:17:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 19:17:16,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:17:16,282 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:17:16,282 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:17:16,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:17:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1771241374, now seen corresponding path program 1 times [2018-11-14 19:17:16,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:17:16,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:17:16,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:16,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:16,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:17:16,291 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:17:16,292 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:17:16,292 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-14 19:17:16,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:17:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 19:17:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 19:17:16,405 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 19:17:16,467 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 19:17:16,467 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 19:17:16,467 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 19:17:16,467 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 19:17:16,468 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-14 19:17:16,468 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:17:16,468 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 19:17:16,468 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 19:17:16,468 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2018-11-14 19:17:16,469 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2018-11-14 19:17:16,469 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:17:16,469 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:17:16,469 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:17:16,469 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:17:16,470 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-14 19:17:16,470 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-14 19:17:16,470 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2018-11-14 19:17:16,470 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 19:17:16,470 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 19:17:16,470 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 19:17:16,471 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2018-11-14 19:17:16,471 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2018-11-14 19:17:16,471 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2018-11-14 19:17:16,471 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2018-11-14 19:17:16,471 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 19:17:16,471 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-14 19:17:16,472 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-14 19:17:16,472 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2018-11-14 19:17:16,472 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-14 19:17:16,472 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2018-11-14 19:17:16,472 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2018-11-14 19:17:16,472 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-14 19:17:16,473 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-14 19:17:16,473 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-14 19:17:16,473 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2018-11-14 19:17:16,473 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2018-11-14 19:17:16,473 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:17:16,474 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2018-11-14 19:17:16,474 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-14 19:17:16,474 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2018-11-14 19:17:16,474 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2018-11-14 19:17:16,474 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2018-11-14 19:17:16,475 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:17:16,475 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-14 19:17:16,475 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-14 19:17:16,475 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:17:16,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:17:16 BoogieIcfgContainer [2018-11-14 19:17:16,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:17:16,483 INFO L168 Benchmark]: Toolchain (without parser) took 5355.42 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 694.7 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -492.8 MB). Peak memory consumption was 201.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:17:16,485 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:17:16,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:17:16,490 INFO L168 Benchmark]: Boogie Preprocessor took 54.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:17:16,491 INFO L168 Benchmark]: RCFGBuilder took 977.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 694.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -729.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:17:16,492 INFO L168 Benchmark]: TraceAbstraction took 3964.16 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 225.9 MB). Peak memory consumption was 225.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:17:16,498 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 353.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 977.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 694.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -729.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3964.16 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 225.9 MB). Peak memory consumption was 225.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] unsigned int N_LIN=__VERIFIER_nondet_uint(); [L15] unsigned int N_COL=__VERIFIER_nondet_uint(); [L16] unsigned int j,k; [L17] FCALL int matriz[N_COL][N_LIN], maior; [L19] maior = __VERIFIER_nondet_int() [L20] j=0 VAL [j=0, maior=-2147476742, matriz={6:0}, N_COL=1, N_LIN=1] [L20] COND TRUE jmaior [L26] EXPR, FCALL matriz[j][k] [L26] maior = matriz[j][k] [L21] k++ VAL [j=0, k=1, maior=-2147476741, matriz={6:0}, N_COL=1, N_LIN=1] [L21] COND FALSE !(k