/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:24,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:24,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:24,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:24,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:24,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:24,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:24,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:24,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:24,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:24,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:24,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:24,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:24,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:24,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:24,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:24,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:24,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:24,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:24,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:24,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:24,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:24,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:24,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:24,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:24,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:24,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:24,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:24,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:24,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:24,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:24,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:24,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:24,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:24,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:24,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:24,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:24,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:24,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:24,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:24,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:24,936 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:24,956 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:24,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:24,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:24,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:24,959 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:24,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:24,959 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:24,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:24,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:24,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:24,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:24,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:24,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:24,962 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:24,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:24,962 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:24,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:24,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:24,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:24,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:24,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:24,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:24,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:24,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:24,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:24,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:24,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:24,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:24,965 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:24,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:25,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:25,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:25,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:25,258 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:25,258 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:25,259 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix-1.c [2020-07-10 15:27:25,322 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff822063c/195b0a2604284c22af5dabce41595fc5/FLAG4c04ee9f4 [2020-07-10 15:27:25,779 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:25,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2020-07-10 15:27:25,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff822063c/195b0a2604284c22af5dabce41595fc5/FLAG4c04ee9f4 [2020-07-10 15:27:26,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff822063c/195b0a2604284c22af5dabce41595fc5 [2020-07-10 15:27:26,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:26,147 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:26,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:26,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:26,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:26,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:26" (1/1) ... [2020-07-10 15:27:26,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca298d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:26, skipping insertion in model container [2020-07-10 15:27:26,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:26" (1/1) ... [2020-07-10 15:27:26,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:26,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:26,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:26,389 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:26,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:26,445 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:26,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:26 WrapperNode [2020-07-10 15:27:26,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:26,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:26,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:26,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:26,555 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:26" (1/1) ... [2020-07-10 15:27:26,557 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:26" (1/1) ... [2020-07-10 15:27:26,575 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:26" (1/1) ... [2020-07-10 15:27:26,576 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:26" (1/1) ... [2020-07-10 15:27:26,596 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:26" (1/1) ... [2020-07-10 15:27:26,608 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:26" (1/1) ... [2020-07-10 15:27:26,614 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:26" (1/1) ... [2020-07-10 15:27:26,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:26,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:26,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:26,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:26,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:26" (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:26,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:26,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:26,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:26,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:26,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:26,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:26,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:27:26,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:27:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:27:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:27:26,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:27:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:27,124 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:27,125 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:27:27,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:27 BoogieIcfgContainer [2020-07-10 15:27:27,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:27,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:27,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:27,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:27,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:26" (1/3) ... [2020-07-10 15:27:27,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7537bd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:27, skipping insertion in model container [2020-07-10 15:27:27,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:26" (2/3) ... [2020-07-10 15:27:27,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7537bd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:27, skipping insertion in model container [2020-07-10 15:27:27,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:27" (3/3) ... [2020-07-10 15:27:27,138 INFO L109 eAbstractionObserver]: Analyzing ICFG matrix-1.c [2020-07-10 15:27:27,157 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:27,165 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:27,180 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:27,213 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:27,214 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:27,214 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:27,214 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:27,214 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:27,214 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:27,214 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:27,215 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-10 15:27:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:27:27,239 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:27,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:27,241 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:27,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:27,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1330517862, now seen corresponding path program 1 times [2020-07-10 15:27:27,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:27,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565341367] [2020-07-10 15:27:27,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:27,359 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:27,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [196621888] [2020-07-10 15:27:27,360 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:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:27,424 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-10 15:27:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:27,441 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:27,488 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2020-07-10 15:27:27,489 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {27#true} is VALID [2020-07-10 15:27:27,489 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-10 15:27:27,490 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #52#return; {27#true} is VALID [2020-07-10 15:27:27,491 INFO L263 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret7 := main(); {27#true} is VALID [2020-07-10 15:27:27,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} ~N_LIN~0 := 1;~N_COL~0 := 1;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~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {27#true} is VALID [2020-07-10 15:27:27,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-10 15:27:27,493 INFO L280 TraceCheckUtils]: 7: Hoare triple {28#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {28#false} is VALID [2020-07-10 15:27:27,494 INFO L263 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {28#false} is VALID [2020-07-10 15:27:27,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2020-07-10 15:27:27,495 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2020-07-10 15:27:27,495 INFO L280 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-10 15:27:27,498 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:27,499 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565341367] [2020-07-10 15:27:27,499 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:27,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196621888] [2020-07-10 15:27:27,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:27,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:27:27,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975340044] [2020-07-10 15:27:27,508 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-10 15:27:27,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:27,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:27:27,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:27,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:27:27,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:27,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:27:27,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:27:27,558 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-10 15:27:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:27,639 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-07-10 15:27:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:27:27,639 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-10 15:27:27,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2020-07-10 15:27:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:27:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2020-07-10 15:27:27,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 53 transitions. [2020-07-10 15:27:27,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:27,761 INFO L225 Difference]: With dead ends: 42 [2020-07-10 15:27:27,761 INFO L226 Difference]: Without dead ends: 17 [2020-07-10 15:27:27,765 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-10 15:27:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-10 15:27:27,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:27,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-10 15:27:27,808 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-10 15:27:27,808 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-10 15:27:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:27,812 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-10 15:27:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-10 15:27:27,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:27,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:27,813 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-10 15:27:27,814 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-10 15:27:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:27,817 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-10 15:27:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-10 15:27:27,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:27,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:27,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:27,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:27:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-07-10 15:27:27,823 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2020-07-10 15:27:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:27,823 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-10 15:27:27,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:27:27,824 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-10 15:27:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:27:27,825 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:27,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:28,040 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-10 15:27:28,041 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:28,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash 672047389, now seen corresponding path program 1 times [2020-07-10 15:27:28,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:28,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368478999] [2020-07-10 15:27:28,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:28,055 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:28,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095747205] [2020-07-10 15:27:28,056 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:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:28,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:27:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:28,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:28,191 INFO L263 TraceCheckUtils]: 0: Hoare triple {177#true} call ULTIMATE.init(); {177#true} is VALID [2020-07-10 15:27:28,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {177#true} is VALID [2020-07-10 15:27:28,193 INFO L280 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2020-07-10 15:27:28,193 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #52#return; {177#true} is VALID [2020-07-10 15:27:28,194 INFO L263 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret7 := main(); {177#true} is VALID [2020-07-10 15:27:28,201 INFO L280 TraceCheckUtils]: 5: Hoare triple {177#true} ~N_LIN~0 := 1;~N_COL~0 := 1;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~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {197#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-10 15:27:28,204 INFO L280 TraceCheckUtils]: 6: Hoare triple {197#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {178#false} is VALID [2020-07-10 15:27:28,205 INFO L280 TraceCheckUtils]: 7: Hoare triple {178#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {178#false} is VALID [2020-07-10 15:27:28,205 INFO L263 TraceCheckUtils]: 8: Hoare triple {178#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {178#false} is VALID [2020-07-10 15:27:28,205 INFO L280 TraceCheckUtils]: 9: Hoare triple {178#false} ~cond := #in~cond; {178#false} is VALID [2020-07-10 15:27:28,205 INFO L280 TraceCheckUtils]: 10: Hoare triple {178#false} assume 0 == ~cond; {178#false} is VALID [2020-07-10 15:27:28,206 INFO L280 TraceCheckUtils]: 11: Hoare triple {178#false} assume !false; {178#false} is VALID [2020-07-10 15:27:28,207 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:28,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368478999] [2020-07-10 15:27:28,207 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:28,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095747205] [2020-07-10 15:27:28,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:28,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:27:28,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876335078] [2020-07-10 15:27:28,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-10 15:27:28,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:28,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:27:28,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:28,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:27:28,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:28,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:27:28,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:28,250 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2020-07-10 15:27:28,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:28,359 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2020-07-10 15:27:28,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:27:28,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-10 15:27:28,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2020-07-10 15:27:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2020-07-10 15:27:28,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2020-07-10 15:27:28,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:28,422 INFO L225 Difference]: With dead ends: 28 [2020-07-10 15:27:28,422 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 15:27:28,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:28,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 15:27:28,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2020-07-10 15:27:28,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:28,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 18 states. [2020-07-10 15:27:28,436 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 18 states. [2020-07-10 15:27:28,436 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 18 states. [2020-07-10 15:27:28,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:28,443 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-10 15:27:28,443 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-10 15:27:28,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:28,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:28,444 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 22 states. [2020-07-10 15:27:28,444 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 22 states. [2020-07-10 15:27:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:28,449 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-10 15:27:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-10 15:27:28,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:28,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:28,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:28,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:27:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-10 15:27:28,455 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2020-07-10 15:27:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:28,455 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-10 15:27:28,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:27:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-10 15:27:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-10 15:27:28,457 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:28,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:28,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:28,673 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:28,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash -830834987, now seen corresponding path program 1 times [2020-07-10 15:27:28,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:28,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691371946] [2020-07-10 15:27:28,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:28,685 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:28,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823869015] [2020-07-10 15:27:28,685 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:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:28,726 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:27:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:28,734 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:28,832 INFO L263 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2020-07-10 15:27:28,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {326#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {326#true} is VALID [2020-07-10 15:27:28,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2020-07-10 15:27:28,833 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #52#return; {326#true} is VALID [2020-07-10 15:27:28,833 INFO L263 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret7 := main(); {326#true} is VALID [2020-07-10 15:27:28,838 INFO L280 TraceCheckUtils]: 5: Hoare triple {326#true} ~N_LIN~0 := 1;~N_COL~0 := 1;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~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {346#(and (= 1 main_~N_COL~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:28,839 INFO L280 TraceCheckUtils]: 6: Hoare triple {346#(and (= 1 main_~N_COL~0) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {350#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:28,840 INFO L280 TraceCheckUtils]: 7: Hoare triple {350#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {327#false} is VALID [2020-07-10 15:27:28,840 INFO L280 TraceCheckUtils]: 8: Hoare triple {327#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {327#false} is VALID [2020-07-10 15:27:28,841 INFO L280 TraceCheckUtils]: 9: Hoare triple {327#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {327#false} is VALID [2020-07-10 15:27:28,841 INFO L280 TraceCheckUtils]: 10: Hoare triple {327#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {327#false} is VALID [2020-07-10 15:27:28,841 INFO L263 TraceCheckUtils]: 11: Hoare triple {327#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {327#false} is VALID [2020-07-10 15:27:28,841 INFO L280 TraceCheckUtils]: 12: Hoare triple {327#false} ~cond := #in~cond; {327#false} is VALID [2020-07-10 15:27:28,842 INFO L280 TraceCheckUtils]: 13: Hoare triple {327#false} assume 0 == ~cond; {327#false} is VALID [2020-07-10 15:27:28,842 INFO L280 TraceCheckUtils]: 14: Hoare triple {327#false} assume !false; {327#false} is VALID [2020-07-10 15:27:28,843 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:28,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691371946] [2020-07-10 15:27:28,844 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:28,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823869015] [2020-07-10 15:27:28,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:28,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:27:28,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388821102] [2020-07-10 15:27:28,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-10 15:27:28,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:28,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:27:28,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:28,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:27:28,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:28,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:27:28,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:28,870 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 4 states. [2020-07-10 15:27:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:29,002 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-10 15:27:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:27:29,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-10 15:27:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-07-10 15:27:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-07-10 15:27:29,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2020-07-10 15:27:29,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:29,064 INFO L225 Difference]: With dead ends: 32 [2020-07-10 15:27:29,064 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 15:27:29,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:29,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 15:27:29,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-10 15:27:29,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:29,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 19 states. [2020-07-10 15:27:29,083 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 19 states. [2020-07-10 15:27:29,083 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 19 states. [2020-07-10 15:27:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:29,086 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-10 15:27:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-10 15:27:29,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:29,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:29,087 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states. [2020-07-10 15:27:29,087 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states. [2020-07-10 15:27:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:29,089 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-10 15:27:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-10 15:27:29,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:29,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:29,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:29,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:27:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-10 15:27:29,092 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2020-07-10 15:27:29,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:29,092 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-10 15:27:29,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:27:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 15:27:29,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:27:29,093 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:29,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:29,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:29,307 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:29,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1529445450, now seen corresponding path program 1 times [2020-07-10 15:27:29,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:29,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843112849] [2020-07-10 15:27:29,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:29,318 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:29,319 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1752530393] [2020-07-10 15:27:29,319 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:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:29,359 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-10 15:27:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:29,373 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:31,600 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:31,600 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:32,032 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 29 [2020-07-10 15:27:32,034 INFO L624 ElimStorePlain]: treesize reduction 397, result has 8.3 percent of original size [2020-07-10 15:27:32,050 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2020-07-10 15:27:32,050 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:32,061 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:32,061 INFO L512 ElimStorePlain]: Eliminatee v_prenex_1 vanished before elimination [2020-07-10 15:27:32,062 INFO L512 ElimStorePlain]: Eliminatee |v_#memory_int_7| vanished before elimination [2020-07-10 15:27:32,062 INFO L512 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2020-07-10 15:27:32,062 INFO L512 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2020-07-10 15:27:32,062 INFO L512 ElimStorePlain]: Eliminatee v_prenex_5 vanished before elimination [2020-07-10 15:27:32,063 INFO L512 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2020-07-10 15:27:32,063 INFO L544 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:27:32,064 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 16 variables, input treesize:497, output treesize:10 [2020-07-10 15:27:33,024 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:33,025 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_prenex_13, v_prenex_14, v_prenex_9, v_prenex_10, v_prenex_7, v_prenex_8, |v_#memory_int_7|, |v_main_#t~nondet3_3|, v_prenex_5, v_prenex_6, v_prenex_3, v_prenex_4, v_prenex_1, v_prenex_2, v_prenex_11, v_prenex_12]. (let ((.cse8 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse5 (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (.cse7 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse16 (+ (mod main_~j~0 4294967296) (- 4294967296))) (.cse19 (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (.cse18 (mod main_~j~0 4294967296)) (.cse17 (* (mod main_~N_LIN~0 4294967296) 4))) (let ((.cse2 (* .cse18 .cse17)) (.cse11 (* .cse16 .cse19)) (.cse13 (not .cse7)) (.cse9 (not .cse5)) (.cse14 (* (mod main_~k~0 4294967296) 4)) (.cse12 (* .cse18 .cse19)) (.cse0 (= 0 main_~k~0)) (.cse3 (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (.cse10 (not .cse8)) (.cse1 (* (mod main_~k~0 4294967296) 4)) (.cse15 (* .cse16 .cse17)) (.cse4 (= 0 main_~j~0)) (.cse6 (= 1 main_~N_LIN~0))) (or (and .cse0 (= (store v_prenex_13 |main_~#matriz~0.base| (store (select v_prenex_13 |main_~#matriz~0.base|) (+ .cse1 |main_~#matriz~0.offset| .cse2) v_prenex_14)) |#memory_int|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse3 .cse9 .cse10 .cse4 .cse6 (= (store v_prenex_9 |main_~#matriz~0.base| (store (select v_prenex_9 |main_~#matriz~0.base|) (+ .cse1 |main_~#matriz~0.offset| .cse11) v_prenex_10)) |#memory_int|) .cse7) (and .cse0 .cse3 .cse9 (= |#memory_int| (store v_prenex_7 |main_~#matriz~0.base| (store (select v_prenex_7 |main_~#matriz~0.base|) (+ .cse12 .cse1 |main_~#matriz~0.offset|) v_prenex_8))) .cse4 .cse6 .cse8 .cse7) (and .cse0 .cse13 .cse3 (= |#memory_int| (store |v_#memory_int_7| |main_~#matriz~0.base| (store (select |v_#memory_int_7| |main_~#matriz~0.base|) (+ .cse14 |main_~#matriz~0.offset| .cse2 (- 17179869184)) |v_main_#t~nondet3_3|))) .cse4 .cse5 .cse6 .cse8) (and .cse0 .cse13 .cse3 .cse10 (= (store v_prenex_5 |main_~#matriz~0.base| (store (select v_prenex_5 |main_~#matriz~0.base|) (+ .cse14 |main_~#matriz~0.offset| .cse15 (- 17179869184)) v_prenex_6)) |#memory_int|) .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse3 .cse9 (= (store v_prenex_3 |main_~#matriz~0.base| (store (select v_prenex_3 |main_~#matriz~0.base|) (+ .cse14 |main_~#matriz~0.offset| .cse11 (- 17179869184)) v_prenex_4)) |#memory_int|) .cse10 .cse4 .cse6) (and .cse0 .cse13 .cse3 .cse9 (= (store v_prenex_1 |main_~#matriz~0.base| (store (select v_prenex_1 |main_~#matriz~0.base|) (+ .cse14 .cse12 |main_~#matriz~0.offset| (- 17179869184)) v_prenex_2)) |#memory_int|) .cse4 .cse6 .cse8) (and .cse0 .cse3 .cse10 (= (store v_prenex_11 |main_~#matriz~0.base| (store (select v_prenex_11 |main_~#matriz~0.base|) (+ .cse1 |main_~#matriz~0.offset| .cse15) v_prenex_12)) |#memory_int|) .cse5 .cse4 .cse6 .cse7)))) [2020-07-10 15:27:33,025 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0)) [2020-07-10 15:27:33,118 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-10 15:27:33,127 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:33,130 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:33,131 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:27:33,131 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-10 15:27:33,134 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:33,135 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#matriz~0.base|, |main_~#matriz~0.offset|]. (let ((.cse0 (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|))) (and (<= .cse0 main_~maior~0) (<= |main_#t~mem6| .cse0))) [2020-07-10 15:27:33,135 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |main_#t~mem6| main_~maior~0) [2020-07-10 15:27:33,165 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:33,210 INFO L263 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2020-07-10 15:27:33,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {493#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {493#true} is VALID [2020-07-10 15:27:33,210 INFO L280 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2020-07-10 15:27:33,211 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #52#return; {493#true} is VALID [2020-07-10 15:27:33,211 INFO L263 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret7 := main(); {493#true} is VALID [2020-07-10 15:27:33,213 INFO L280 TraceCheckUtils]: 5: Hoare triple {493#true} ~N_LIN~0 := 1;~N_COL~0 := 1;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~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {513#(and (= 1 main_~N_COL~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:33,214 INFO L280 TraceCheckUtils]: 6: Hoare triple {513#(and (= 1 main_~N_COL~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {517#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:33,216 INFO L280 TraceCheckUtils]: 7: Hoare triple {517#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := 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); {517#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:33,218 INFO L280 TraceCheckUtils]: 8: Hoare triple {517#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2020-07-10 15:27:33,219 INFO L280 TraceCheckUtils]: 9: Hoare triple {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2020-07-10 15:27:33,219 INFO L280 TraceCheckUtils]: 10: Hoare triple {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2020-07-10 15:27:33,220 INFO L280 TraceCheckUtils]: 11: Hoare triple {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2020-07-10 15:27:33,221 INFO L280 TraceCheckUtils]: 12: Hoare triple {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2020-07-10 15:27:33,222 INFO L280 TraceCheckUtils]: 13: Hoare triple {524#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {540#(<= |main_#t~mem6| main_~maior~0)} is VALID [2020-07-10 15:27:33,223 INFO L263 TraceCheckUtils]: 14: Hoare triple {540#(<= |main_#t~mem6| main_~maior~0)} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {544#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:27:33,224 INFO L280 TraceCheckUtils]: 15: Hoare triple {544#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {548#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:27:33,225 INFO L280 TraceCheckUtils]: 16: Hoare triple {548#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {494#false} is VALID [2020-07-10 15:27:33,225 INFO L280 TraceCheckUtils]: 17: Hoare triple {494#false} assume !false; {494#false} is VALID [2020-07-10 15:27:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:33,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843112849] [2020-07-10 15:27:33,227 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:33,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752530393] [2020-07-10 15:27:33,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:27:33,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-10 15:27:33,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067277722] [2020-07-10 15:27:33,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-10 15:27:33,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:33,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:27:33,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:33,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:27:33,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:33,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:27:33,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:27:33,263 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 8 states. [2020-07-10 15:27:33,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:33,782 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 15:27:33,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:27:33,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-10 15:27:33,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:27:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-10 15:27:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:27:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-10 15:27:33,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-10 15:27:33,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:33,859 INFO L225 Difference]: With dead ends: 37 [2020-07-10 15:27:33,859 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 15:27:33,860 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:27:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 15:27:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2020-07-10 15:27:33,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:33,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 25 states. [2020-07-10 15:27:33,909 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 25 states. [2020-07-10 15:27:33,909 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 25 states. [2020-07-10 15:27:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:33,912 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-07-10 15:27:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-07-10 15:27:33,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:33,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:33,913 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 31 states. [2020-07-10 15:27:33,913 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 31 states. [2020-07-10 15:27:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:33,915 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-07-10 15:27:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2020-07-10 15:27:33,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:33,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:33,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:33,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:27:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-10 15:27:33,924 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2020-07-10 15:27:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:33,925 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-10 15:27:33,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:27:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-10 15:27:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:27:33,926 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:33,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:34,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:34,133 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:34,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:34,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1922472460, now seen corresponding path program 1 times [2020-07-10 15:27:34,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:34,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043021296] [2020-07-10 15:27:34,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:34,143 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:34,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524269224] [2020-07-10 15:27:34,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:34,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-10 15:27:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:34,191 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:34,261 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-10 15:27:34,261 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:34,267 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:34,267 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:27:34,268 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2020-07-10 15:27:34,270 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:34,271 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_8|, |v_main_#t~nondet3_4|]. (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem4|) (= (store |v_#memory_int_8| |main_~#matriz~0.base| (store (select |v_#memory_int_8| |main_~#matriz~0.base|) |main_~#matriz~0.offset| |v_main_#t~nondet3_4|)) |#memory_int|)) [2020-07-10 15:27:34,271 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem4|) [2020-07-10 15:27:34,340 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-07-10 15:27:34,345 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:34,348 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:34,349 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:27:34,349 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2020-07-10 15:27:34,359 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:34,359 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#matriz~0.base|, |main_~#matriz~0.offset|]. (let ((.cse0 (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|))) (and (<= (+ .cse0 1) main_~maior~0) (<= |main_#t~mem6| .cse0))) [2020-07-10 15:27:34,359 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ |main_#t~mem6| 1) main_~maior~0) [2020-07-10 15:27:34,393 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:34,455 INFO L263 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {718#true} is VALID [2020-07-10 15:27:34,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {718#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {718#true} is VALID [2020-07-10 15:27:34,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {718#true} assume true; {718#true} is VALID [2020-07-10 15:27:34,456 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {718#true} {718#true} #52#return; {718#true} is VALID [2020-07-10 15:27:34,456 INFO L263 TraceCheckUtils]: 4: Hoare triple {718#true} call #t~ret7 := main(); {718#true} is VALID [2020-07-10 15:27:34,457 INFO L280 TraceCheckUtils]: 5: Hoare triple {718#true} ~N_LIN~0 := 1;~N_COL~0 := 1;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~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {738#(and (= 1 main_~N_COL~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:34,460 INFO L280 TraceCheckUtils]: 6: Hoare triple {738#(and (= 1 main_~N_COL~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {742#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:34,468 INFO L280 TraceCheckUtils]: 7: Hoare triple {742#(and (= 0 main_~k~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := 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); {746#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem4|)} is VALID [2020-07-10 15:27:34,470 INFO L280 TraceCheckUtils]: 8: Hoare triple {746#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem4|)} assume !(#t~mem4 >= ~maior~0);havoc #t~mem4; {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2020-07-10 15:27:34,471 INFO L280 TraceCheckUtils]: 9: Hoare triple {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2020-07-10 15:27:34,472 INFO L280 TraceCheckUtils]: 10: Hoare triple {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2020-07-10 15:27:34,472 INFO L280 TraceCheckUtils]: 11: Hoare triple {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2020-07-10 15:27:34,473 INFO L280 TraceCheckUtils]: 12: Hoare triple {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} is VALID [2020-07-10 15:27:34,474 INFO L280 TraceCheckUtils]: 13: Hoare triple {750#(<= (+ (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) 1) main_~maior~0)} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {766#(<= (+ |main_#t~mem6| 1) main_~maior~0)} is VALID [2020-07-10 15:27:34,475 INFO L263 TraceCheckUtils]: 14: Hoare triple {766#(<= (+ |main_#t~mem6| 1) main_~maior~0)} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {770#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:27:34,476 INFO L280 TraceCheckUtils]: 15: Hoare triple {770#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {774#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:27:34,477 INFO L280 TraceCheckUtils]: 16: Hoare triple {774#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {719#false} is VALID [2020-07-10 15:27:34,478 INFO L280 TraceCheckUtils]: 17: Hoare triple {719#false} assume !false; {719#false} is VALID [2020-07-10 15:27:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:34,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043021296] [2020-07-10 15:27:34,479 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:34,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524269224] [2020-07-10 15:27:34,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:27:34,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-10 15:27:34,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731510273] [2020-07-10 15:27:34,482 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-07-10 15:27:34,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:34,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:27:34,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:34,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:27:34,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:34,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:27:34,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:27:34,516 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 9 states. [2020-07-10 15:27:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,177 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-10 15:27:35,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:27:35,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-07-10 15:27:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:27:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2020-07-10 15:27:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:27:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2020-07-10 15:27:35,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2020-07-10 15:27:35,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:35,257 INFO L225 Difference]: With dead ends: 41 [2020-07-10 15:27:35,258 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:27:35,259 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:27:35,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:27:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2020-07-10 15:27:35,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:35,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 28 states. [2020-07-10 15:27:35,287 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 28 states. [2020-07-10 15:27:35,287 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 28 states. [2020-07-10 15:27:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,290 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-10 15:27:35,290 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2020-07-10 15:27:35,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:35,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:35,291 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 35 states. [2020-07-10 15:27:35,291 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 35 states. [2020-07-10 15:27:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,293 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-10 15:27:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2020-07-10 15:27:35,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:35,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:35,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:35,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:27:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-07-10 15:27:35,296 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18 [2020-07-10 15:27:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:35,296 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-07-10 15:27:35,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:27:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-07-10 15:27:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:27:35,297 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:35,297 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:35,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:35,511 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:35,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:35,512 INFO L82 PathProgramCache]: Analyzing trace with hash -422232267, now seen corresponding path program 2 times [2020-07-10 15:27:35,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:35,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099380847] [2020-07-10 15:27:35,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:35,521 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:35,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [215025131] [2020-07-10 15:27:35,523 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:35,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:35,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:35,565 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:27:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:35,582 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:35,638 INFO L263 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2020-07-10 15:27:35,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {966#true} is VALID [2020-07-10 15:27:35,639 INFO L280 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-10 15:27:35,639 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #52#return; {966#true} is VALID [2020-07-10 15:27:35,640 INFO L263 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret7 := main(); {966#true} is VALID [2020-07-10 15:27:35,641 INFO L280 TraceCheckUtils]: 5: Hoare triple {966#true} ~N_LIN~0 := 1;~N_COL~0 := 1;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~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {986#(= 1 main_~N_LIN~0)} is VALID [2020-07-10 15:27:35,641 INFO L280 TraceCheckUtils]: 6: Hoare triple {986#(= 1 main_~N_LIN~0)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {990#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:35,643 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := 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); {990#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:35,644 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {990#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:35,645 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#(and (= 0 main_~k~0) (= 1 main_~N_LIN~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1000#(and (= 1 main_~k~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:35,646 INFO L280 TraceCheckUtils]: 10: Hoare triple {1000#(and (= 1 main_~k~0) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := 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); {967#false} is VALID [2020-07-10 15:27:35,646 INFO L280 TraceCheckUtils]: 11: Hoare triple {967#false} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {967#false} is VALID [2020-07-10 15:27:35,647 INFO L280 TraceCheckUtils]: 12: Hoare triple {967#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {967#false} is VALID [2020-07-10 15:27:35,647 INFO L280 TraceCheckUtils]: 13: Hoare triple {967#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {967#false} is VALID [2020-07-10 15:27:35,647 INFO L280 TraceCheckUtils]: 14: Hoare triple {967#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {967#false} is VALID [2020-07-10 15:27:35,647 INFO L280 TraceCheckUtils]: 15: Hoare triple {967#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {967#false} is VALID [2020-07-10 15:27:35,648 INFO L280 TraceCheckUtils]: 16: Hoare triple {967#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {967#false} is VALID [2020-07-10 15:27:35,648 INFO L263 TraceCheckUtils]: 17: Hoare triple {967#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {967#false} is VALID [2020-07-10 15:27:35,648 INFO L280 TraceCheckUtils]: 18: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2020-07-10 15:27:35,648 INFO L280 TraceCheckUtils]: 19: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2020-07-10 15:27:35,649 INFO L280 TraceCheckUtils]: 20: Hoare triple {967#false} assume !false; {967#false} is VALID [2020-07-10 15:27:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:35,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099380847] [2020-07-10 15:27:35,650 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:35,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215025131] [2020-07-10 15:27:35,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:27:35,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-10 15:27:35,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760768171] [2020-07-10 15:27:35,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:27:35,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:35,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:35,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:35,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:35,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:35,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:35,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:35,682 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 5 states. [2020-07-10 15:27:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,795 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 15:27:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:27:35,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:27:35,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-10 15:27:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-10 15:27:35,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2020-07-10 15:27:35,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:35,855 INFO L225 Difference]: With dead ends: 44 [2020-07-10 15:27:35,855 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 15:27:35,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 15:27:35,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-10 15:27:35,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:35,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-10 15:27:35,887 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:27:35,887 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:27:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,889 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:27:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:27:35,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:35,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:35,890 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:27:35,890 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:27:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:35,892 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:27:35,892 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:27:35,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:35,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:35,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:35,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:27:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-10 15:27:35,894 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2020-07-10 15:27:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:35,895 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-10 15:27:35,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:27:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:27:35,896 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:35,896 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:36,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:36,109 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash 239488911, now seen corresponding path program 3 times [2020-07-10 15:27:36,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:36,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757021336] [2020-07-10 15:27:36,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:36,119 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:36,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [556546998] [2020-07-10 15:27:36,120 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:36,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-10 15:27:36,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:36,183 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-10 15:27:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:36,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:38,342 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:38,343 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:38,967 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 30 [2020-07-10 15:27:38,969 INFO L624 ElimStorePlain]: treesize reduction 416, result has 8.6 percent of original size [2020-07-10 15:27:38,969 INFO L512 ElimStorePlain]: Eliminatee v_prenex_21 vanished before elimination [2020-07-10 15:27:38,973 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2020-07-10 15:27:38,974 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:39,019 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:39,020 INFO L512 ElimStorePlain]: Eliminatee v_prenex_23 vanished before elimination [2020-07-10 15:27:39,020 INFO L512 ElimStorePlain]: Eliminatee |v_#memory_int_9| vanished before elimination [2020-07-10 15:27:39,020 INFO L512 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2020-07-10 15:27:39,020 INFO L512 ElimStorePlain]: Eliminatee v_prenex_27 vanished before elimination [2020-07-10 15:27:39,020 INFO L512 ElimStorePlain]: Eliminatee v_prenex_15 vanished before elimination [2020-07-10 15:27:39,021 INFO L544 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:27:39,021 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 16 variables, input treesize:521, output treesize:13 [2020-07-10 15:27:39,857 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:39,858 WARN L407 uantifierElimination]: Input elimination task: ∃ [v_prenex_17, v_prenex_18, v_prenex_15, v_prenex_16, v_prenex_21, v_prenex_22, |v_#memory_int_9|, |v_main_#t~nondet3_5|, v_prenex_19, v_prenex_20, v_prenex_23, v_prenex_24, v_prenex_27, v_prenex_28, v_prenex_25, v_prenex_26]. (let ((.cse3 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse18 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse2 (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (.cse17 (mod main_~j~0 4294967296)) (.cse14 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse19 (+ (mod main_~j~0 4294967296) (- 4294967296))) (.cse20 (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184)))) (let ((.cse11 (* .cse19 .cse20)) (.cse6 (* (mod main_~k~0 4294967296) 4)) (.cse9 (not .cse14)) (.cse16 (* .cse17 .cse20)) (.cse10 (not .cse2)) (.cse15 (* .cse19 .cse18)) (.cse12 (not .cse3)) (.cse0 (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (.cse1 (= 0 main_~k~0)) (.cse7 (* .cse17 .cse18)) (.cse13 (* (mod main_~k~0 4294967296) 4)) (.cse4 (= 0 |main_~#matriz~0.offset|)) (.cse5 (= 0 main_~j~0)) (.cse8 (= 1 main_~N_LIN~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (store v_prenex_17 |main_~#matriz~0.base| (store (select v_prenex_17 |main_~#matriz~0.base|) (+ .cse6 |main_~#matriz~0.offset| .cse7 (- 17179869184)) v_prenex_18)) |#memory_int|) .cse8 .cse9) (and .cse0 .cse1 .cse4 .cse5 .cse8 .cse10 (= (store v_prenex_15 |main_~#matriz~0.base| (store (select v_prenex_15 |main_~#matriz~0.base|) (+ .cse6 |main_~#matriz~0.offset| .cse11 (- 17179869184)) v_prenex_16)) |#memory_int|) .cse12 .cse9) (and .cse0 .cse1 (= |#memory_int| (store v_prenex_21 |main_~#matriz~0.base| (store (select v_prenex_21 |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| .cse13 .cse11) v_prenex_22))) .cse4 .cse5 .cse8 .cse10 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse12 (= (store |v_#memory_int_9| |main_~#matriz~0.base| (store (select |v_#memory_int_9| |main_~#matriz~0.base|) (+ .cse15 .cse6 |main_~#matriz~0.offset| (- 17179869184)) |v_main_#t~nondet3_5|)) |#memory_int|) .cse9) (and .cse0 .cse1 .cse3 .cse4 .cse5 (= |#memory_int| (store v_prenex_19 |main_~#matriz~0.base| (store (select v_prenex_19 |main_~#matriz~0.base|) (+ .cse6 |main_~#matriz~0.offset| .cse16 (- 17179869184)) v_prenex_20))) .cse8 .cse10 .cse9) (and .cse0 .cse1 .cse3 (= (store v_prenex_23 |main_~#matriz~0.base| (store (select v_prenex_23 |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| .cse16 .cse13) v_prenex_24)) |#memory_int|) .cse4 .cse5 .cse8 .cse10 .cse14) (and .cse0 .cse1 .cse2 (= (store v_prenex_27 |main_~#matriz~0.base| (store (select v_prenex_27 |main_~#matriz~0.base|) (+ .cse15 |main_~#matriz~0.offset| .cse13) v_prenex_28)) |#memory_int|) .cse4 .cse5 .cse8 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 (= |#memory_int| (store v_prenex_25 |main_~#matriz~0.base| (store (select v_prenex_25 |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| .cse7 .cse13) v_prenex_26))) .cse4 .cse5 .cse8 .cse14)))) [2020-07-10 15:27:39,858 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~k~0) (= 0 |main_~#matriz~0.offset|) (= 0 main_~j~0) (= 1 main_~N_LIN~0)) [2020-07-10 15:27:44,001 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:44,002 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:44,003 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:44,006 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:44,009 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:44,010 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:44,012 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:44,281 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:44,281 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:44,445 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:44,446 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:44,623 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:44,623 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:44,804 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:44,804 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:44,998 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:44,998 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:45,221 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:45,221 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:45,383 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:45,383 INFO L544 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:45,526 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:45,526 INFO L544 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:45,677 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:45,678 INFO L544 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:45,852 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:45,852 INFO L544 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:46,120 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:46,121 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 85 [2020-07-10 15:27:46,138 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:46,141 INFO L544 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:46,358 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:46,359 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 79 [2020-07-10 15:27:46,372 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:46,380 INFO L544 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:46,585 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:46,585 INFO L544 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:46,696 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:46,696 INFO L544 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:46,824 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:46,824 INFO L544 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:46,960 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:46,961 INFO L544 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:47,106 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:47,107 INFO L544 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:47,274 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:47,274 INFO L544 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:47,433 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:47,434 INFO L544 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:47,635 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:47,636 INFO L544 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:47,771 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:47,772 INFO L544 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:47,869 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:47,869 INFO L544 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:47,983 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:47,983 INFO L544 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:48,089 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:48,090 INFO L544 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:48,235 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:48,235 INFO L544 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:48,382 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:48,382 INFO L544 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:48,512 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:48,512 INFO L544 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:48,632 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:48,633 INFO L544 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:48,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:48,768 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2020-07-10 15:27:48,770 INFO L544 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:48,949 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:48,949 INFO L544 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:49,035 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:49,036 INFO L544 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:49,120 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:49,121 INFO L544 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:49,207 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:49,208 INFO L544 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:49,316 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:49,316 INFO L544 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:49,406 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:49,406 INFO L544 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:49,498 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:49,499 INFO L544 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:49,594 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:49,595 INFO L544 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:49,687 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:49,688 INFO L544 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:49,796 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:49,796 INFO L544 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:49,895 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:49,895 INFO L544 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:49,998 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:49,998 INFO L544 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:50,102 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:50,102 INFO L544 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:50,282 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:50,283 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 82 [2020-07-10 15:27:50,285 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:50,289 INFO L544 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:50,358 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:50,359 INFO L544 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:50,422 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:50,422 INFO L544 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:50,486 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:50,487 INFO L544 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:50,552 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:50,553 INFO L544 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:50,631 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:50,631 INFO L544 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:50,693 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:50,693 INFO L544 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:50,756 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:50,757 INFO L544 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:50,820 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:50,820 INFO L544 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:50,891 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:50,891 INFO L544 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:50,961 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:50,962 INFO L544 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:51,039 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:51,039 INFO L544 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:51,106 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:51,107 INFO L544 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:51,176 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:51,176 INFO L544 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:51,241 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:51,241 INFO L544 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:51,307 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:51,307 INFO L544 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:51,368 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:51,369 INFO L544 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:51,433 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:51,434 INFO L544 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:51,476 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:51,476 INFO L544 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:51,518 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:51,519 INFO L544 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:51,556 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:51,556 INFO L544 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:51,592 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-10 15:27:51,593 INFO L544 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:52,056 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2020-07-10 15:27:52,062 INFO L624 ElimStorePlain]: treesize reduction 168, result has 67.5 percent of original size [2020-07-10 15:27:52,064 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-07-10 15:27:52,064 INFO L244 ElimStorePlain]: Needed 65 recursive calls to eliminate 2 variables, input treesize:6401, output treesize:255 [2020-07-10 15:27:52,158 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:52,159 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, |v_main_#t~nondet3_6|]. (let ((.cse47 (+ (mod main_~j~0 4294967296) (- 4294967296))) (.cse46 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse48 (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (.cse50 (mod main_~j~0 4294967296)) (.cse51 (mod main_~j~0 4294967296)) (.cse49 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse45 (+ (mod main_~j~0 4294967296) (- 4294967296))) (.cse52 (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184)))) (let ((.cse5 (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (.cse15 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse20 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse13 (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (.cse14 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse36 (* .cse45 .cse52)) (.cse9 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse41 (* .cse51 .cse49)) (.cse40 (* .cse50 .cse52)) (.cse35 (* (mod main_~k~0 4294967296) 4)) (.cse32 (* .cse51 .cse48)) (.cse39 (* (mod main_~k~0 4294967296) 4)) (.cse43 (* .cse50 .cse46)) (.cse38 (* .cse47 .cse49)) (.cse31 (select |#memory_int| |main_~#matriz~0.base|)) (.cse42 (* .cse47 .cse48)) (.cse33 (* (mod main_~k~0 4294967296) 4)) (.cse34 (select |v_#memory_int_10| |main_~#matriz~0.base|)) (.cse44 (* .cse45 .cse46)) (.cse37 (* (mod main_~k~0 4294967296) 4))) (let ((.cse25 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse34 (+ .cse44 .cse37 |main_~#matriz~0.offset|) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse28 (<= |main_#t~mem4| (select .cse31 (+ .cse42 |main_~#matriz~0.offset| .cse33)))) (.cse8 (<= |main_#t~mem4| (select .cse31 (+ .cse38 |main_~#matriz~0.offset| .cse33)))) (.cse24 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse34 (+ .cse37 .cse43 |main_~#matriz~0.offset|) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse18 (<= |main_#t~mem4| (select .cse31 (+ .cse32 |main_~#matriz~0.offset| .cse39 (- 17179869184))))) (.cse11 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse34 (+ .cse44 |main_~#matriz~0.offset| .cse35 (- 17179869184)) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse23 (= |#memory_int| (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse34 (+ |main_~#matriz~0.offset| .cse40 .cse35 (- 17179869184)) |v_main_#t~nondet3_6|)))) (.cse29 (<= |main_#t~mem4| (select .cse31 (+ .cse41 |main_~#matriz~0.offset| .cse39 (- 17179869184))))) (.cse26 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse34 (+ .cse43 |main_~#matriz~0.offset| .cse35 (- 17179869184)) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse30 (<= |main_#t~mem4| (select .cse31 (+ .cse42 |main_~#matriz~0.offset| .cse39 (- 17179869184))))) (.cse12 (<= |main_#t~mem4| (select .cse31 (+ .cse41 |main_~#matriz~0.offset| .cse33)))) (.cse22 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse34 (+ .cse37 |main_~#matriz~0.offset| .cse40) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse21 (<= |main_#t~mem4| (select .cse31 (+ .cse38 |main_~#matriz~0.offset| .cse39 (- 17179869184))))) (.cse16 (not .cse9)) (.cse17 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse34 (+ .cse37 |main_~#matriz~0.offset| .cse36) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse10 (not .cse14)) (.cse0 (not .cse13)) (.cse1 (not .cse20)) (.cse2 (not .cse15)) (.cse19 (not .cse5)) (.cse3 (<= (select .cse34 |main_~#matriz~0.offset|) main_~maior~0)) (.cse4 (= 0 |main_~#matriz~0.offset|)) (.cse6 (= (store |v_#memory_int_10| |main_~#matriz~0.base| (store .cse34 (+ |main_~#matriz~0.offset| .cse35 .cse36 (- 17179869184)) |v_main_#t~nondet3_6|)) |#memory_int|)) (.cse7 (= 1 main_~N_LIN~0)) (.cse27 (<= |main_#t~mem4| (select .cse31 (+ .cse32 |main_~#matriz~0.offset| .cse33))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 .cse5 .cse14 .cse7 .cse9) (and .cse15 .cse0 .cse16 .cse1 .cse17 .cse18 .cse19 .cse3 .cse4 .cse14 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse6 .cse14 .cse7 .cse9) (and .cse15 .cse20 .cse21 .cse0 .cse16 .cse22 .cse3 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse16 .cse1 .cse18 .cse2 .cse19 .cse3 .cse4 .cse6 .cse14 .cse7) (and .cse15 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse20 .cse21 .cse0 .cse16 .cse2 .cse23 .cse3 .cse4 .cse5 .cse7 .cse10) (and .cse15 .cse20 .cse21 .cse16 .cse3 .cse4 .cse13 .cse5 .cse7 .cse24 .cse10) (and .cse21 .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10) (and .cse15 .cse1 .cse3 .cse4 .cse13 .cse5 .cse7 .cse8 .cse9 .cse25 .cse10) (and .cse15 .cse20 .cse3 .cse4 .cse12 .cse13 .cse5 .cse14 .cse7 .cse24 .cse9) (and .cse20 .cse0 .cse2 .cse23 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse20 .cse21 .cse16 .cse2 .cse3 .cse4 .cse13 .cse26 .cse5 .cse7 .cse10) (and .cse16 .cse1 .cse18 .cse2 .cse19 .cse3 .cse4 .cse11 .cse13 .cse14 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse13 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse20 .cse2 .cse3 .cse4 .cse12 .cse13 .cse26 .cse5 .cse14 .cse7 .cse9) (and .cse15 .cse20 .cse19 .cse3 .cse4 .cse13 .cse7 .cse14 .cse27 .cse24 .cse9) (and .cse20 .cse0 .cse2 .cse23 .cse19 .cse3 .cse4 .cse28 .cse7 .cse9 .cse10) (and .cse15 .cse16 .cse1 .cse29 .cse3 .cse4 .cse13 .cse5 .cse7 .cse14 .cse25) (and .cse15 .cse1 .cse19 .cse3 .cse4 .cse28 .cse13 .cse7 .cse9 .cse25 .cse10) (and .cse15 .cse0 .cse1 .cse17 .cse3 .cse4 .cse12 .cse5 .cse14 .cse7 .cse9) (and .cse20 .cse16 .cse18 .cse2 .cse19 .cse3 .cse4 .cse13 .cse26 .cse14 .cse7) (and .cse15 .cse20 .cse0 .cse16 .cse18 .cse22 .cse19 .cse3 .cse4 .cse14 .cse7) (and .cse15 .cse16 .cse1 .cse19 .cse3 .cse4 .cse13 .cse7 .cse30 .cse25 .cse10) (and .cse20 .cse2 .cse19 .cse3 .cse4 .cse13 .cse26 .cse28 .cse7 .cse9 .cse10) (and .cse1 .cse2 .cse19 .cse3 .cse4 .cse11 .cse13 .cse28 .cse7 .cse9 .cse10) (and .cse15 .cse20 .cse19 .cse3 .cse4 .cse28 .cse13 .cse7 .cse24 .cse9 .cse10) (and .cse21 .cse16 .cse1 .cse2 .cse3 .cse4 .cse11 .cse13 .cse5 .cse7 .cse10) (and .cse20 .cse2 .cse3 .cse4 .cse13 .cse26 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse15 .cse21 .cse16 .cse1 .cse3 .cse4 .cse13 .cse5 .cse7 .cse25 .cse10) (and .cse20 .cse0 .cse2 .cse23 .cse3 .cse4 .cse12 .cse5 .cse14 .cse7 .cse9) (and .cse15 .cse20 .cse0 .cse16 .cse29 .cse22 .cse3 .cse4 .cse5 .cse7 .cse14) (and .cse15 .cse20 .cse0 .cse16 .cse22 .cse19 .cse3 .cse4 .cse7 .cse30 .cse10) (and .cse15 .cse1 .cse3 .cse4 .cse12 .cse13 .cse5 .cse14 .cse7 .cse9 .cse25) (and .cse15 .cse16 .cse1 .cse18 .cse19 .cse3 .cse4 .cse13 .cse14 .cse7 .cse25) (and .cse16 .cse1 .cse29 .cse2 .cse3 .cse4 .cse11 .cse13 .cse5 .cse7 .cse14) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse28 .cse6 .cse7 .cse9 .cse10) (and .cse15 .cse0 .cse1 .cse17 .cse19 .cse3 .cse4 .cse28 .cse7 .cse9 .cse10) (and .cse15 .cse1 .cse19 .cse3 .cse4 .cse13 .cse7 .cse14 .cse27 .cse25 .cse9) (and .cse15 .cse20 .cse3 .cse4 .cse13 .cse5 .cse7 .cse8 .cse24 .cse9 .cse10) (and .cse20 .cse0 .cse16 .cse2 .cse23 .cse19 .cse3 .cse4 .cse7 .cse30 .cse10) (and .cse20 .cse16 .cse29 .cse2 .cse3 .cse4 .cse13 .cse26 .cse5 .cse7 .cse14) (and .cse15 .cse0 .cse16 .cse1 .cse17 .cse19 .cse3 .cse4 .cse7 .cse30 .cse10) (and .cse15 .cse20 .cse0 .cse22 .cse19 .cse3 .cse4 .cse28 .cse7 .cse9 .cse10) (and .cse15 .cse20 .cse0 .cse22 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse15 .cse20 .cse16 .cse18 .cse19 .cse3 .cse4 .cse13 .cse14 .cse7 .cse24) (and .cse15 .cse0 .cse16 .cse1 .cse17 .cse29 .cse3 .cse4 .cse5 .cse7 .cse14) (and .cse15 .cse20 .cse16 .cse19 .cse3 .cse4 .cse13 .cse7 .cse24 .cse30 .cse10) (and .cse15 .cse20 .cse16 .cse29 .cse3 .cse4 .cse13 .cse5 .cse7 .cse14 .cse24) (and .cse16 .cse1 .cse2 .cse19 .cse3 .cse4 .cse11 .cse13 .cse7 .cse30 .cse10) (and .cse20 .cse0 .cse16 .cse18 .cse2 .cse23 .cse19 .cse3 .cse4 .cse14 .cse7) (and .cse20 .cse0 .cse16 .cse29 .cse2 .cse23 .cse3 .cse4 .cse5 .cse7 .cse14) (and .cse20 .cse2 .cse19 .cse3 .cse4 .cse13 .cse26 .cse7 .cse14 .cse27 .cse9) (and .cse15 .cse0 .cse1 .cse17 .cse19 .cse3 .cse4 .cse7 .cse14 .cse27 .cse9) (and .cse0 .cse16 .cse1 .cse2 .cse19 .cse3 .cse4 .cse6 .cse7 .cse30 .cse10) (and .cse1 .cse2 .cse19 .cse3 .cse4 .cse11 .cse13 .cse7 .cse14 .cse27 .cse9) (and .cse20 .cse0 .cse2 .cse23 .cse19 .cse3 .cse4 .cse7 .cse14 .cse27 .cse9) (and .cse0 .cse16 .cse1 .cse29 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse14) (and .cse20 .cse16 .cse2 .cse19 .cse3 .cse4 .cse13 .cse26 .cse7 .cse30 .cse10) (and .cse15 .cse20 .cse0 .cse22 .cse3 .cse4 .cse12 .cse5 .cse14 .cse7 .cse9) (and .cse15 .cse20 .cse0 .cse22 .cse19 .cse3 .cse4 .cse7 .cse14 .cse27 .cse9) (and .cse15 .cse21 .cse0 .cse16 .cse1 .cse17 .cse3 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse6 .cse7 .cse14 .cse27 .cse9))))) [2020-07-10 15:27:52,160 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select |#memory_int| |main_~#matriz~0.base|)) (.cse8 (<= (mod main_~j~0 4294967296) 2147483647)) (.cse14 (* (mod main_~N_LIN~0 4294967296) 4)) (.cse15 (* (mod main_~N_LIN~0 4294967296) 4))) (let ((.cse2 (* (mod main_~j~0 4294967296) .cse15)) (.cse6 (* (mod main_~j~0 4294967296) .cse14)) (.cse10 (* (mod main_~k~0 4294967296) 4)) (.cse11 (not (<= (mod main_~k~0 4294967296) 2147483647))) (.cse13 (not .cse8)) (.cse0 (= 0 |main_~#matriz~0.offset|)) (.cse5 (<= (select .cse1 |main_~#matriz~0.offset|) main_~maior~0)) (.cse7 (* (mod main_~k~0 4294967296) 4)) (.cse4 (= 1 main_~N_LIN~0)) (.cse9 (<= (mod main_~k~0 4294967296) 2147483647)) (.cse12 (* (+ (mod main_~j~0 4294967296) (- 4294967296)) .cse15)) (.cse3 (* (mod main_~k~0 4294967296) 4))) (or (and .cse0 (<= |main_#t~mem4| (select .cse1 (+ .cse2 |main_~#matriz~0.offset| .cse3))) .cse4 (or .cse5 (= (+ .cse6 |main_~#matriz~0.offset| .cse7) |main_~#matriz~0.offset|)) .cse8 .cse9) (and (<= |main_#t~mem4| (select .cse1 (+ .cse2 .cse10 |main_~#matriz~0.offset| (- 17179869184)))) .cse11 .cse0 (or .cse5 (= (+ .cse6 |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4) (- 17179869184)) |main_~#matriz~0.offset|)) .cse4 .cse8) (and .cse5 (<= |main_#t~mem4| (select .cse1 (+ .cse10 .cse12 |main_~#matriz~0.offset| (- 17179869184)))) .cse13 .cse11 .cse0 .cse4) (and .cse13 .cse0 (or .cse5 (= (+ (* (+ (mod main_~j~0 4294967296) (- 4294967296)) .cse14) |main_~#matriz~0.offset| .cse7) |main_~#matriz~0.offset|)) .cse4 .cse9 (<= |main_#t~mem4| (select .cse1 (+ .cse12 |main_~#matriz~0.offset| .cse3))))))) [2020-07-10 15:27:52,404 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-10 15:27:54,509 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-10 15:27:54,519 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:54,531 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:54,547 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:54,567 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 5, 2, 2, 2, 2, 1] term [2020-07-10 15:27:54,568 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-10 15:27:54,576 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:54,577 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,577 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,584 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,586 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,586 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,588 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,596 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:54,597 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:54,597 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,599 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,600 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:54,601 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,602 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,619 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:54,620 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,621 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,636 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:54,637 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:54,637 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,642 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,644 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:54,645 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:54,647 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:27:55,308 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 45 [2020-07-10 15:27:55,461 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-10 15:27:55,503 INFO L350 Elim1Store]: treesize reduction 18, result has 55.0 percent of original size [2020-07-10 15:27:55,504 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 31 [2020-07-10 15:27:55,522 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:55,528 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:55,531 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-10 15:27:55,567 INFO L624 ElimStorePlain]: treesize reduction 29, result has 32.6 percent of original size [2020-07-10 15:27:55,572 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:27:55,572 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:66, output treesize:3 [2020-07-10 15:27:55,579 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:55,580 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#matriz~0.base|, main_~k~0, main_~j~0]. (let ((.cse0 (select |#memory_int| |main_~#matriz~0.base|))) (let ((.cse1 (select .cse0 0))) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (select .cse0 (+ (* (mod main_~k~0 4294967296) 4) (* (mod main_~j~0 4294967296) 4))) main_~maior~0) (<= (mod main_~j~0 4294967296) 2147483647) (<= |main_#t~mem6| .cse1) (<= .cse1 (select .cse0 (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4)))) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647)))) [2020-07-10 15:27:55,580 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |main_#t~mem6| main_~maior~0) [2020-07-10 15:27:55,621 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:27:55,682 INFO L263 TraceCheckUtils]: 0: Hoare triple {1186#true} call ULTIMATE.init(); {1186#true} is VALID [2020-07-10 15:27:55,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {1186#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1186#true} is VALID [2020-07-10 15:27:55,683 INFO L280 TraceCheckUtils]: 2: Hoare triple {1186#true} assume true; {1186#true} is VALID [2020-07-10 15:27:55,684 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1186#true} {1186#true} #52#return; {1186#true} is VALID [2020-07-10 15:27:55,684 INFO L263 TraceCheckUtils]: 4: Hoare triple {1186#true} call #t~ret7 := main(); {1186#true} is VALID [2020-07-10 15:27:55,686 INFO L280 TraceCheckUtils]: 5: Hoare triple {1186#true} ~N_LIN~0 := 1;~N_COL~0 := 1;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~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {1206#(and (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_COL~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:55,687 INFO L280 TraceCheckUtils]: 6: Hoare triple {1206#(and (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_COL~0) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1210#(and (= 0 main_~k~0) (= 0 |main_~#matriz~0.offset|) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:55,688 INFO L280 TraceCheckUtils]: 7: Hoare triple {1210#(and (= 0 main_~k~0) (= 0 |main_~#matriz~0.offset|) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := 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); {1210#(and (= 0 main_~k~0) (= 0 |main_~#matriz~0.offset|) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:55,689 INFO L280 TraceCheckUtils]: 8: Hoare triple {1210#(and (= 0 main_~k~0) (= 0 |main_~#matriz~0.offset|) (= 0 main_~j~0) (= 1 main_~N_LIN~0))} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:55,693 INFO L280 TraceCheckUtils]: 9: Hoare triple {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_LIN~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:55,694 INFO L280 TraceCheckUtils]: 10: Hoare triple {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_LIN~0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:55,695 INFO L280 TraceCheckUtils]: 11: Hoare triple {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_LIN~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:55,696 INFO L280 TraceCheckUtils]: 12: Hoare triple {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_LIN~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_LIN~0))} is VALID [2020-07-10 15:27:55,708 INFO L280 TraceCheckUtils]: 13: Hoare triple {1217#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_LIN~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := 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); {1233#(or (and (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (or (= (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)))) 17179869184) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)) (= 0 |main_~#matriz~0.offset|) (< 2147483647 (mod main_~k~0 4294967296)) (= 1 main_~N_LIN~0) (<= (mod main_~j~0 4294967296) 2147483647)) (and (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= (+ (* 4 (* (mod main_~j~0 4294967296) (mod main_~N_LIN~0 4294967296))) (* 4 (mod main_~k~0 4294967296))) (* 17179869184 (mod main_~N_LIN~0 4294967296)))) (= 0 |main_~#matriz~0.offset|) (< 2147483647 (mod main_~j~0 4294967296)) (= 1 main_~N_LIN~0) (<= (mod main_~k~0 4294967296) 2147483647) (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (* (mod main_~N_LIN~0 4294967296) 4)) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4))))) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (* (mod main_~N_LIN~0 4294967296) 4)) |main_~#matriz~0.offset| (- 17179869184)))) (= 0 |main_~#matriz~0.offset|) (< 2147483647 (mod main_~k~0 4294967296)) (< 2147483647 (mod main_~j~0 4294967296)) (= 1 main_~N_LIN~0)) (and (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4)))) (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_LIN~0) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~j~0 4294967296) 2147483647) (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)))) 0))))} is VALID [2020-07-10 15:27:55,730 INFO L280 TraceCheckUtils]: 14: Hoare triple {1233#(or (and (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (- 17179869184)))) (or (= (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)))) 17179869184) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)) (= 0 |main_~#matriz~0.offset|) (< 2147483647 (mod main_~k~0 4294967296)) (= 1 main_~N_LIN~0) (<= (mod main_~j~0 4294967296) 2147483647)) (and (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= (+ (* 4 (* (mod main_~j~0 4294967296) (mod main_~N_LIN~0 4294967296))) (* 4 (mod main_~k~0 4294967296))) (* 17179869184 (mod main_~N_LIN~0 4294967296)))) (= 0 |main_~#matriz~0.offset|) (< 2147483647 (mod main_~j~0 4294967296)) (= 1 main_~N_LIN~0) (<= (mod main_~k~0 4294967296) 2147483647) (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (* (mod main_~N_LIN~0 4294967296) 4)) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4))))) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (* (mod main_~N_LIN~0 4294967296) 4)) |main_~#matriz~0.offset| (- 17179869184)))) (= 0 |main_~#matriz~0.offset|) (< 2147483647 (mod main_~k~0 4294967296)) (< 2147483647 (mod main_~j~0 4294967296)) (= 1 main_~N_LIN~0)) (and (<= |main_#t~mem4| (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (* (mod main_~N_LIN~0 4294967296) 4)) |main_~#matriz~0.offset| (* (mod main_~k~0 4294967296) 4)))) (= 0 |main_~#matriz~0.offset|) (= 1 main_~N_LIN~0) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~j~0 4294967296) 2147483647) (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= (+ (* 4 (mod main_~k~0 4294967296)) (* 4 (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)))) 0))))} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {1237#(and (= 0 |main_~#matriz~0.offset|) (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4))) main_~maior~0) (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4)))) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647))))} is VALID [2020-07-10 15:27:55,732 INFO L280 TraceCheckUtils]: 15: Hoare triple {1237#(and (= 0 |main_~#matriz~0.offset|) (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4))) main_~maior~0) (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4)))) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647))))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1237#(and (= 0 |main_~#matriz~0.offset|) (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4))) main_~maior~0) (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4)))) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647))))} is VALID [2020-07-10 15:27:55,733 INFO L280 TraceCheckUtils]: 16: Hoare triple {1237#(and (= 0 |main_~#matriz~0.offset|) (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4))) main_~maior~0) (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4)))) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647))))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1237#(and (= 0 |main_~#matriz~0.offset|) (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4))) main_~maior~0) (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4)))) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647))))} is VALID [2020-07-10 15:27:55,734 INFO L280 TraceCheckUtils]: 17: Hoare triple {1237#(and (= 0 |main_~#matriz~0.offset|) (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4))) main_~maior~0) (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4)))) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647))))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1237#(and (= 0 |main_~#matriz~0.offset|) (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4))) main_~maior~0) (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4)))) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647))))} is VALID [2020-07-10 15:27:55,735 INFO L280 TraceCheckUtils]: 18: Hoare triple {1237#(and (= 0 |main_~#matriz~0.offset|) (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4))) main_~maior~0) (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4)))) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647))))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1237#(and (= 0 |main_~#matriz~0.offset|) (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4))) main_~maior~0) (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4)))) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647))))} is VALID [2020-07-10 15:27:55,738 INFO L280 TraceCheckUtils]: 19: Hoare triple {1237#(and (= 0 |main_~#matriz~0.offset|) (exists ((main_~j~0 Int) (main_~k~0 Int)) (and (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4))) main_~maior~0) (<= (mod main_~j~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ |main_~#matriz~0.offset| (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4)))) (<= (mod main_~k~0 4294967296) 2147483647) (<= (mod main_~k~0 4294967296) 2147483647))))} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1253#(<= |main_#t~mem6| main_~maior~0)} is VALID [2020-07-10 15:27:55,739 INFO L263 TraceCheckUtils]: 20: Hoare triple {1253#(<= |main_#t~mem6| main_~maior~0)} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:27:55,739 INFO L280 TraceCheckUtils]: 21: Hoare triple {1257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:27:55,740 INFO L280 TraceCheckUtils]: 22: Hoare triple {1261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1187#false} is VALID [2020-07-10 15:27:55,740 INFO L280 TraceCheckUtils]: 23: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2020-07-10 15:27:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:27:55,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757021336] [2020-07-10 15:27:55,745 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:55,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556546998] [2020-07-10 15:27:55,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:27:55,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-10 15:27:55,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091215722] [2020-07-10 15:27:55,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 15:27:55,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:55,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:27:55,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:55,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:27:55,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:55,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:27:55,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:27:55,870 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2020-07-10 15:27:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:57,437 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2020-07-10 15:27:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:27:57,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 15:27:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:27:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2020-07-10 15:27:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:27:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2020-07-10 15:27:57,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 42 transitions. [2020-07-10 15:27:57,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:57,571 INFO L225 Difference]: With dead ends: 41 [2020-07-10 15:27:57,571 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:27:57,571 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:27:57,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:27:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2020-07-10 15:27:57,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:57,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2020-07-10 15:27:57,614 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2020-07-10 15:27:57,614 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2020-07-10 15:27:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:57,616 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-10 15:27:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-10 15:27:57,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:57,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:57,617 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2020-07-10 15:27:57,617 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2020-07-10 15:27:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:57,619 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-10 15:27:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-10 15:27:57,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:57,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:57,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:57,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 15:27:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-10 15:27:57,622 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 24 [2020-07-10 15:27:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:57,622 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-10 15:27:57,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:27:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-10 15:27:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:27:57,623 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:57,623 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:57,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:57,837 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:57,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:57,838 INFO L82 PathProgramCache]: Analyzing trace with hash -153538099, now seen corresponding path program 1 times [2020-07-10 15:27:57,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:57,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376004626] [2020-07-10 15:27:57,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:57,851 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:57,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [914084705] [2020-07-10 15:27:57,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:57,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:27:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:57,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:57,946 INFO L263 TraceCheckUtils]: 0: Hoare triple {1457#true} call ULTIMATE.init(); {1457#true} is VALID [2020-07-10 15:27:57,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {1457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1457#true} is VALID [2020-07-10 15:27:57,947 INFO L280 TraceCheckUtils]: 2: Hoare triple {1457#true} assume true; {1457#true} is VALID [2020-07-10 15:27:57,948 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1457#true} {1457#true} #52#return; {1457#true} is VALID [2020-07-10 15:27:57,948 INFO L263 TraceCheckUtils]: 4: Hoare triple {1457#true} call #t~ret7 := main(); {1457#true} is VALID [2020-07-10 15:27:57,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {1457#true} ~N_LIN~0 := 1;~N_COL~0 := 1;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~nondet0 && #t~nondet0 <= 2147483647;~maior~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-10 15:27:57,965 INFO L280 TraceCheckUtils]: 6: Hoare triple {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-10 15:27:57,968 INFO L280 TraceCheckUtils]: 7: Hoare triple {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := 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); {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-10 15:27:57,975 INFO L280 TraceCheckUtils]: 8: Hoare triple {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} assume #t~mem4 >= ~maior~0;havoc #t~mem4;call #t~mem5 := read~int(~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);~maior~0 := #t~mem5;havoc #t~mem5; {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-10 15:27:57,976 INFO L280 TraceCheckUtils]: 9: Hoare triple {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-10 15:27:57,977 INFO L280 TraceCheckUtils]: 10: Hoare triple {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} is VALID [2020-07-10 15:27:57,977 INFO L280 TraceCheckUtils]: 11: Hoare triple {1477#(and (= 1 main_~N_COL~0) (= 0 main_~j~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1496#(and (= 1 main_~N_COL~0) (= 1 main_~j~0))} is VALID [2020-07-10 15:27:57,978 INFO L280 TraceCheckUtils]: 12: Hoare triple {1496#(and (= 1 main_~N_COL~0) (= 1 main_~j~0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1458#false} is VALID [2020-07-10 15:27:57,978 INFO L280 TraceCheckUtils]: 13: Hoare triple {1458#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#matriz~0.base, ~#matriz~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) * (4 * (if ~N_LIN~0 % 4294967296 % 4294967296 <= 2147483647 then ~N_LIN~0 % 4294967296 % 4294967296 else ~N_LIN~0 % 4294967296 % 4294967296 - 4294967296)) + 4 * (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet3;call #t~mem4 := 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); {1458#false} is VALID [2020-07-10 15:27:57,979 INFO L280 TraceCheckUtils]: 14: Hoare triple {1458#false} assume !(#t~mem4 >= ~maior~0);havoc #t~mem4; {1458#false} is VALID [2020-07-10 15:27:57,979 INFO L280 TraceCheckUtils]: 15: Hoare triple {1458#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1458#false} is VALID [2020-07-10 15:27:57,979 INFO L280 TraceCheckUtils]: 16: Hoare triple {1458#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1458#false} is VALID [2020-07-10 15:27:57,979 INFO L280 TraceCheckUtils]: 17: Hoare triple {1458#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1458#false} is VALID [2020-07-10 15:27:57,980 INFO L280 TraceCheckUtils]: 18: Hoare triple {1458#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1458#false} is VALID [2020-07-10 15:27:57,980 INFO L280 TraceCheckUtils]: 19: Hoare triple {1458#false} call #t~mem6 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1458#false} is VALID [2020-07-10 15:27:57,980 INFO L263 TraceCheckUtils]: 20: Hoare triple {1458#false} call __VERIFIER_assert((if #t~mem6 <= ~maior~0 then 1 else 0)); {1458#false} is VALID [2020-07-10 15:27:57,980 INFO L280 TraceCheckUtils]: 21: Hoare triple {1458#false} ~cond := #in~cond; {1458#false} is VALID [2020-07-10 15:27:57,980 INFO L280 TraceCheckUtils]: 22: Hoare triple {1458#false} assume 0 == ~cond; {1458#false} is VALID [2020-07-10 15:27:57,981 INFO L280 TraceCheckUtils]: 23: Hoare triple {1458#false} assume !false; {1458#false} is VALID [2020-07-10 15:27:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:27:57,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376004626] [2020-07-10 15:27:57,983 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:57,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914084705] [2020-07-10 15:27:57,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:27:57,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-10 15:27:57,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694846045] [2020-07-10 15:27:57,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-10 15:27:57,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:57,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:27:58,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:58,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:27:58,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:58,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:27:58,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:58,046 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2020-07-10 15:27:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:58,134 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-10 15:27:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:27:58,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-10 15:27:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-10 15:27:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-10 15:27:58,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2020-07-10 15:27:58,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:58,199 INFO L225 Difference]: With dead ends: 35 [2020-07-10 15:27:58,199 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:27:58,199 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:27:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:27:58,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:58,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:58,200 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:58,200 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:58,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:58,200 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:27:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:58,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:58,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:58,201 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:58,201 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:27:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:58,202 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:27:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:58,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:58,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:58,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:58,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:27:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:27:58,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-07-10 15:27:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:58,203 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:27:58,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:27:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:27:58,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:58,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-10 15:27:58,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:27:58,664 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:27:58,664 INFO L271 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:27:58,665 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:27:58,665 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:27:58,665 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:27:58,665 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:27:58,665 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:27:58,665 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 31) no Hoare annotation was computed. [2020-07-10 15:27:58,665 INFO L268 CegarLoopResult]: For program point L19-2(lines 19 26) no Hoare annotation was computed. [2020-07-10 15:27:58,665 INFO L264 CegarLoopResult]: At program point L19-3(lines 19 26) the Hoare annotation is: (let ((.cse0 (= 1 main_~N_COL~0)) (.cse1 (= 1 main_~N_LIN~0))) (or (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) .cse0 (= 1 main_~k~0) (= 1 main_~j~0) .cse1) (and (= 0 |main_~#matriz~0.offset|) .cse0 (= 0 main_~j~0) .cse1))) [2020-07-10 15:27:58,665 INFO L268 CegarLoopResult]: For program point L19-4(lines 19 26) no Hoare annotation was computed. [2020-07-10 15:27:58,665 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 31) no Hoare annotation was computed. [2020-07-10 15:27:58,665 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 31) the Hoare annotation is: true [2020-07-10 15:27:58,666 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (<= |main_#t~mem6| main_~maior~0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= 1 main_~N_COL~0) (= 1 main_~N_LIN~0)) [2020-07-10 15:27:58,666 INFO L268 CegarLoopResult]: For program point L28-1(line 28) no Hoare annotation was computed. [2020-07-10 15:27:58,666 INFO L268 CegarLoopResult]: For program point L24(lines 24 25) no Hoare annotation was computed. [2020-07-10 15:27:58,666 INFO L268 CegarLoopResult]: For program point L20-2(lines 20 26) no Hoare annotation was computed. [2020-07-10 15:27:58,666 INFO L264 CegarLoopResult]: At program point L20-3(lines 20 26) the Hoare annotation is: (let ((.cse0 (= 0 |main_~#matriz~0.offset|)) (.cse1 (= 1 main_~N_COL~0)) (.cse2 (= 0 main_~j~0)) (.cse3 (= 1 main_~N_LIN~0))) (or (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) .cse0 .cse1 .cse2 (= 1 main_~k~0) .cse3) (and (= 0 main_~k~0) .cse0 .cse1 .cse2 .cse3))) [2020-07-10 15:27:58,666 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-10 15:27:58,666 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-10 15:27:58,666 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 15:27:58,666 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:27:58,666 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-10 15:27:58,666 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-10 15:27:58,670 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:58,672 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:58,672 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:58,672 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:58,672 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2020-07-10 15:27:58,672 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2020-07-10 15:27:58,675 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:58,675 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:27:58,675 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:58,675 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:58,675 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2020-07-10 15:27:58,676 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-10 15:27:58,676 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-10 15:27:58,676 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:27:58,676 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:58,676 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:27:58,676 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:27:58,676 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-10 15:27:58,676 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-10 15:27:58,676 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:27:58,676 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:27:58,676 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:58,677 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-10 15:27:58,677 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-10 15:27:58,677 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:58,677 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:58,677 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:27:58,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:27:58,689 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:27:58,695 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:27:58,695 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:27:58,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:58 BoogieIcfgContainer [2020-07-10 15:27:58,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:58,699 INFO L168 Benchmark]: Toolchain (without parser) took 32552.17 ms. Allocated memory was 139.5 MB in the beginning and 360.7 MB in the end (delta: 221.2 MB). Free memory was 104.6 MB in the beginning and 305.9 MB in the end (delta: -201.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:58,699 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:58,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.17 ms. Allocated memory is still 139.5 MB. Free memory was 104.4 MB in the beginning and 93.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:58,701 INFO L168 Benchmark]: Boogie Preprocessor took 173.88 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 93.3 MB in the beginning and 181.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:58,701 INFO L168 Benchmark]: RCFGBuilder took 506.99 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 159.0 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:58,705 INFO L168 Benchmark]: TraceAbstraction took 31567.33 ms. Allocated memory was 203.9 MB in the beginning and 360.7 MB in the end (delta: 156.8 MB). Free memory was 158.3 MB in the beginning and 305.9 MB in the end (delta: -147.6 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:58,708 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.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 298.17 ms. Allocated memory is still 139.5 MB. Free memory was 104.4 MB in the beginning and 93.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 173.88 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 93.3 MB in the beginning and 181.5 MB in the end (delta: -88.2 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 506.99 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 159.0 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31567.33 ms. Allocated memory was 203.9 MB in the beginning and 360.7 MB in the end (delta: 156.8 MB). Free memory was 158.3 MB in the beginning and 305.9 MB in the end (delta: -147.6 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant [2020-07-10 15:27:58,720 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:27:58,721 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((unknown-#memory_int-unknown[matriz][matriz] <= maior && 0 == matriz) && 1 == N_COL) && 0 == j) && 1 == k) && 1 == N_LIN) || ((((0 == k && 0 == matriz) && 1 == N_COL) && 0 == j) && 1 == N_LIN) - InvariantResult [Line: 19]: Loop Invariant [2020-07-10 15:27:58,722 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:27:58,723 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && 1 == N_COL) && 1 == k) && 1 == j) && 1 == N_LIN) || (((0 == matriz && 1 == N_COL) && 0 == j) && 1 == N_LIN) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 31.1s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 63 SDslu, 263 SDs, 0 SdLazy, 321 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 24 NumberOfFragments, 96 HoareAnnotationTreeSize, 15 FomulaSimplifications, 272 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 144 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 136 ConstructedInterpolants, 5 QuantifiedInterpolants, 22129 SizeOfPredicates, 40 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 18/35 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...