/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/matrix-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:26,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:26,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:26,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:26,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:26,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:26,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:27,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:27,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:27,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:27,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:27,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:27,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:27,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:27,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:27,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:27,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:27,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:27,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:27,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:27,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:27,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:27,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:27,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:27,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:27,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:27,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:27,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:27,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:27,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:27,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:27,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:27,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:27,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:27,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:27,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:27,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:27,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:27,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:27,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:27,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:27,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:27:27,049 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:27,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:27,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:27,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:27,051 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:27,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:27,051 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:27,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:27,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:27,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:27,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:27,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:27,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:27,053 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:27,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:27,053 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:27,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:27,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:27,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:27,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:27,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:27,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:27,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:27,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:27,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:27,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:27,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:27,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:27,056 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:27,056 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:27,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:27,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:27,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:27,352 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:27,353 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:27,353 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix-2.c [2020-07-10 15:27:27,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/792687cf8/76ea833e5ded4660920e99a874fdf827/FLAGc981233e0 [2020-07-10 15:27:27,909 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:27,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-2.c [2020-07-10 15:27:27,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/792687cf8/76ea833e5ded4660920e99a874fdf827/FLAGc981233e0 [2020-07-10 15:27:28,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/792687cf8/76ea833e5ded4660920e99a874fdf827 [2020-07-10 15:27:28,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:28,276 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:28,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:28,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:28,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:28,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:28" (1/1) ... [2020-07-10 15:27:28,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a093839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:28, skipping insertion in model container [2020-07-10 15:27:28,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:28" (1/1) ... [2020-07-10 15:27:28,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:28,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:28,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:28,568 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:28,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:28,640 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:28,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:28 WrapperNode [2020-07-10 15:27:28,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:28,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:28,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:28,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:28,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:28" (1/1) ... [2020-07-10 15:27:28,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:28" (1/1) ... [2020-07-10 15:27:28,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:28" (1/1) ... [2020-07-10 15:27:28,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:28" (1/1) ... [2020-07-10 15:27:28,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:28" (1/1) ... [2020-07-10 15:27:28,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:28" (1/1) ... [2020-07-10 15:27:28,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:28" (1/1) ... [2020-07-10 15:27:28,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:28,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:28,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:28,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:28,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:28" (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 [2020-07-10 15:27:28,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:28,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:28,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:28,878 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-10 15:27:28,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:27:28,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:28,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:27:28,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:27:28,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:27:28,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:27:28,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:28,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:29,341 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:29,341 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 15:27:29,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:29 BoogieIcfgContainer [2020-07-10 15:27:29,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:29,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:29,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:29,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:29,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:28" (1/3) ... [2020-07-10 15:27:29,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adc8697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:29, skipping insertion in model container [2020-07-10 15:27:29,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:28" (2/3) ... [2020-07-10 15:27:29,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adc8697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:29, skipping insertion in model container [2020-07-10 15:27:29,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:29" (3/3) ... [2020-07-10 15:27:29,353 INFO L109 eAbstractionObserver]: Analyzing ICFG matrix-2.c [2020-07-10 15:27:29,364 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:29,371 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:29,385 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:29,407 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:29,408 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:29,408 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:29,408 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:29,411 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:29,411 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:29,412 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:29,412 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-10 15:27:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:27:29,431 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:29,432 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:29,433 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:29,437 INFO L82 PathProgramCache]: Analyzing trace with hash -2125374060, now seen corresponding path program 1 times [2020-07-10 15:27:29,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:29,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920415690] [2020-07-10 15:27:29,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:29,539 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:29,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151361556] [2020-07-10 15:27:29,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-10 15:27:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:29,608 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-10 15:27:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:29,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:29,672 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-10 15:27:29,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {32#true} is VALID [2020-07-10 15:27:29,673 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 15:27:29,673 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #78#return; {32#true} is VALID [2020-07-10 15:27:29,674 INFO L263 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret11 := main(); {32#true} is VALID [2020-07-10 15:27:29,674 INFO L280 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.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {32#true} is VALID [2020-07-10 15:27:29,676 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2020-07-10 15:27:29,676 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#false} ~j~0 := 0; {33#false} is VALID [2020-07-10 15:27:29,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#false} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {33#false} is VALID [2020-07-10 15:27:29,677 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {33#false} is VALID [2020-07-10 15:27:29,678 INFO L263 TraceCheckUtils]: 10: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); {33#false} is VALID [2020-07-10 15:27:29,678 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-10 15:27:29,678 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-10 15:27:29,679 INFO L280 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-10 15:27:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:29,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920415690] [2020-07-10 15:27:29,683 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:29,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151361556] [2020-07-10 15:27:29,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:29,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:27:29,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90215078] [2020-07-10 15:27:29,692 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-10 15:27:29,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:29,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:27:29,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:29,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:27:29,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:29,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:27:29,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:27:29,744 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-07-10 15:27:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:29,820 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2020-07-10 15:27:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:27:29,820 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-10 15:27:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2020-07-10 15:27:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2020-07-10 15:27:29,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2020-07-10 15:27:29,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:29,968 INFO L225 Difference]: With dead ends: 52 [2020-07-10 15:27:29,968 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 15:27:29,972 INFO L675 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 [2020-07-10 15:27:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 15:27:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-10 15:27:30,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:30,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-10 15:27:30,016 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 15:27:30,016 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 15:27:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:30,020 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-10 15:27:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 15:27:30,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:30,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:30,022 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 15:27:30,022 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 15:27:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:30,026 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-10 15:27:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 15:27:30,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:30,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:30,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:30,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 15:27:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-10 15:27:30,033 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2020-07-10 15:27:30,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:30,033 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-10 15:27:30,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:27:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-10 15:27:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:27:30,035 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:30,035 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:30,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-10 15:27:30,250 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:30,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:30,251 INFO L82 PathProgramCache]: Analyzing trace with hash 739661195, now seen corresponding path program 1 times [2020-07-10 15:27:30,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:30,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680150060] [2020-07-10 15:27:30,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:30,271 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:30,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180439606] [2020-07-10 15:27:30,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-10 15:27:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:30,328 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:27:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:30,339 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:30,416 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2020-07-10 15:27:30,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {225#true} is VALID [2020-07-10 15:27:30,417 INFO L280 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-10 15:27:30,417 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #78#return; {225#true} is VALID [2020-07-10 15:27:30,417 INFO L263 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret11 := main(); {225#true} is VALID [2020-07-10 15:27:30,419 INFO L280 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.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {245#(= 0 main_~j~0)} is VALID [2020-07-10 15:27:30,420 INFO L280 TraceCheckUtils]: 6: Hoare triple {245#(= 0 main_~j~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {249#(<= (mod main_~N_COL~0 4294967296) 0)} is VALID [2020-07-10 15:27:30,421 INFO L280 TraceCheckUtils]: 7: Hoare triple {249#(<= (mod main_~N_COL~0 4294967296) 0)} ~j~0 := 0; {249#(<= (mod main_~N_COL~0 4294967296) 0)} is VALID [2020-07-10 15:27:30,422 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#(<= (mod main_~N_COL~0 4294967296) 0)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {226#false} is VALID [2020-07-10 15:27:30,422 INFO L280 TraceCheckUtils]: 9: Hoare triple {226#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {226#false} is VALID [2020-07-10 15:27:30,422 INFO L263 TraceCheckUtils]: 10: Hoare triple {226#false} call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); {226#false} is VALID [2020-07-10 15:27:30,423 INFO L280 TraceCheckUtils]: 11: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2020-07-10 15:27:30,423 INFO L280 TraceCheckUtils]: 12: Hoare triple {226#false} assume 0 == ~cond; {226#false} is VALID [2020-07-10 15:27:30,423 INFO L280 TraceCheckUtils]: 13: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-10 15:27:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:30,425 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680150060] [2020-07-10 15:27:30,425 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:30,425 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180439606] [2020-07-10 15:27:30,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:30,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:27:30,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232353685] [2020-07-10 15:27:30,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-10 15:27:30,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:30,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:27:30,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:30,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:27:30,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:27:30,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:30,450 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 4 states. [2020-07-10 15:27:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:31,326 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2020-07-10 15:27:31,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:27:31,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-10 15:27:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:31,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2020-07-10 15:27:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2020-07-10 15:27:31,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2020-07-10 15:27:31,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:31,437 INFO L225 Difference]: With dead ends: 49 [2020-07-10 15:27:31,438 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:27:31,439 INFO L675 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 [2020-07-10 15:27:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:27:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2020-07-10 15:27:31,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:31,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 25 states. [2020-07-10 15:27:31,452 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 25 states. [2020-07-10 15:27:31,452 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 25 states. [2020-07-10 15:27:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:31,456 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-07-10 15:27:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2020-07-10 15:27:31,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:31,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:31,458 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 35 states. [2020-07-10 15:27:31,458 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 35 states. [2020-07-10 15:27:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:31,462 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-07-10 15:27:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2020-07-10 15:27:31,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:31,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:31,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:31,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:27:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-10 15:27:31,466 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2020-07-10 15:27:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:31,466 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-10 15:27:31,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:27:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-10 15:27:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:27:31,467 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:31,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:31,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:31,682 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:31,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:31,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1656958391, now seen corresponding path program 1 times [2020-07-10 15:27:31,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:31,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398304762] [2020-07-10 15:27:31,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:31,693 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:31,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451209798] [2020-07-10 15:27:31,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-10 15:27:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:31,732 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:27:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:31,748 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:31,793 INFO L263 TraceCheckUtils]: 0: Hoare triple {447#true} call ULTIMATE.init(); {447#true} is VALID [2020-07-10 15:27:31,794 INFO L280 TraceCheckUtils]: 1: Hoare triple {447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {447#true} is VALID [2020-07-10 15:27:31,794 INFO L280 TraceCheckUtils]: 2: Hoare triple {447#true} assume true; {447#true} is VALID [2020-07-10 15:27:31,795 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {447#true} {447#true} #78#return; {447#true} is VALID [2020-07-10 15:27:31,795 INFO L263 TraceCheckUtils]: 4: Hoare triple {447#true} call #t~ret11 := main(); {447#true} is VALID [2020-07-10 15:27:31,795 INFO L280 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.allocOnStack(4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296) * (if ~N_COL~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_COL~0 % 4294967296 % 4294967296 else ~N_COL~0 % 4294967296 % 4294967296 - 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~maior~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {447#true} is VALID [2020-07-10 15:27:31,796 INFO L280 TraceCheckUtils]: 6: Hoare triple {447#true} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {470#(= 0 main_~k~0)} is VALID [2020-07-10 15:27:31,797 INFO L280 TraceCheckUtils]: 7: Hoare triple {470#(= 0 main_~k~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {474#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2020-07-10 15:27:31,798 INFO L280 TraceCheckUtils]: 8: Hoare triple {474#(<= (mod main_~N_LIN~0 4294967296) 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {474#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2020-07-10 15:27:31,798 INFO L280 TraceCheckUtils]: 9: Hoare triple {474#(<= (mod main_~N_LIN~0 4294967296) 0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {474#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2020-07-10 15:27:31,799 INFO L280 TraceCheckUtils]: 10: Hoare triple {474#(<= (mod main_~N_LIN~0 4294967296) 0)} ~j~0 := 0; {474#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2020-07-10 15:27:31,800 INFO L280 TraceCheckUtils]: 11: Hoare triple {474#(<= (mod main_~N_LIN~0 4294967296) 0)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {474#(<= (mod main_~N_LIN~0 4294967296) 0)} is VALID [2020-07-10 15:27:31,802 INFO L280 TraceCheckUtils]: 12: Hoare triple {474#(<= (mod main_~N_LIN~0 4294967296) 0)} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4); {448#false} is VALID [2020-07-10 15:27:31,802 INFO L263 TraceCheckUtils]: 13: Hoare triple {448#false} call __VERIFIER_assert((if #t~mem10 < ~maior~0 then 1 else 0)); {448#false} is VALID [2020-07-10 15:27:31,802 INFO L280 TraceCheckUtils]: 14: Hoare triple {448#false} ~cond := #in~cond; {448#false} is VALID [2020-07-10 15:27:31,803 INFO L280 TraceCheckUtils]: 15: Hoare triple {448#false} assume 0 == ~cond; {448#false} is VALID [2020-07-10 15:27:31,803 INFO L280 TraceCheckUtils]: 16: Hoare triple {448#false} assume !false; {448#false} is VALID [2020-07-10 15:27:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:31,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398304762] [2020-07-10 15:27:31,805 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:31,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451209798] [2020-07-10 15:27:31,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:31,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:27:31,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694419375] [2020-07-10 15:27:31,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-10 15:27:31,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:31,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:27:31,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:31,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:27:31,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:31,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:27:31,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:31,834 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 4 states. [2020-07-10 15:27:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:32,102 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2020-07-10 15:27:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:27:32,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-10 15:27:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2020-07-10 15:27:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2020-07-10 15:27:32,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2020-07-10 15:27:32,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:32,236 INFO L225 Difference]: With dead ends: 57 [2020-07-10 15:27:32,236 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 15:27:32,237 INFO L675 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 [2020-07-10 15:27:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 15:27:32,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2020-07-10 15:27:32,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:32,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 27 states. [2020-07-10 15:27:32,250 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 27 states. [2020-07-10 15:27:32,250 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 27 states. [2020-07-10 15:27:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:32,253 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-10 15:27:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-10 15:27:32,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:32,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:32,255 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 32 states. [2020-07-10 15:27:32,255 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 32 states. [2020-07-10 15:27:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:32,258 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-10 15:27:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-07-10 15:27:32,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:32,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:32,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:32,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:27:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-07-10 15:27:32,262 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2020-07-10 15:27:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:32,262 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-10 15:27:32,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:27:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-10 15:27:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:27:32,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:32,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:32,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:32,479 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:32,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:32,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1471852900, now seen corresponding path program 1 times [2020-07-10 15:27:32,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:32,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724801816] [2020-07-10 15:27:32,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:32,492 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:32,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1794821815] [2020-07-10 15:27:32,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-10 15:27:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:32,599 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:32,599 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:32,813 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:32,852 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:27:32,852 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:32,852 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:32,852 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:32,852 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:32,852 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:32,852 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2020-07-10 15:27:32,853 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:32,854 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:32,854 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:27:32,854 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:27:32,854 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:27:32,854 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:27:32,854 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-10 15:27:32,854 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:27:32,854 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:27:32,854 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:32,854 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-10 15:27:32,854 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:32,854 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:32,855 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:32,855 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2020-07-10 15:27:32,855 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-10 15:27:32,855 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:32,855 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-10 15:27:32,855 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:27:32,855 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:27:32,855 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:27:32,855 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:32,855 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. [2020-07-10 15:27:32,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:32 BoogieIcfgContainer [2020-07-10 15:27:32,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:32,860 INFO L168 Benchmark]: Toolchain (without parser) took 4584.20 ms. Allocated memory was 144.7 MB in the beginning and 245.9 MB in the end (delta: 101.2 MB). Free memory was 101.7 MB in the beginning and 208.2 MB in the end (delta: -106.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:27:32,861 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:32,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.81 ms. Allocated memory is still 144.7 MB. Free memory was 101.5 MB in the beginning and 90.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:32,862 INFO L168 Benchmark]: Boogie Preprocessor took 174.22 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 90.6 MB in the beginning and 180.9 MB in the end (delta: -90.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:32,863 INFO L168 Benchmark]: RCFGBuilder took 529.72 ms. Allocated memory is still 203.4 MB. Free memory was 180.9 MB in the beginning and 155.0 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:32,864 INFO L168 Benchmark]: TraceAbstraction took 3511.11 ms. Allocated memory was 203.4 MB in the beginning and 245.9 MB in the end (delta: 42.5 MB). Free memory was 154.3 MB in the beginning and 208.2 MB in the end (delta: -53.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:27:32,868 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 363.81 ms. Allocated memory is still 144.7 MB. Free memory was 101.5 MB in the beginning and 90.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 174.22 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 90.6 MB in the beginning and 180.9 MB in the end (delta: -90.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 529.72 ms. Allocated memory is still 203.4 MB. Free memory was 180.9 MB in the beginning and 155.0 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3511.11 ms. Allocated memory was 203.4 MB in the beginning and 245.9 MB in the end (delta: 42.5 MB). Free memory was 154.3 MB in the beginning and 208.2 MB in the end (delta: -53.9 MB). There was no memory consumed. 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] int matriz[N_COL][N_LIN], maior; [L19] maior = __VERIFIER_nondet_int() [L20] j=0 VAL [j=0, maior=0, matriz={2: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={2:0}, N_COL=1, N_LIN=1] [L21] COND FALSE !(k