/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -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.2.2-dev-fb4f59a-m [2022-04-27 10:17:09,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:17:09,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:17:09,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:17:09,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:17:09,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:17:09,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:17:09,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:17:09,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:17:09,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:17:09,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:17:09,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:17:09,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:17:09,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:17:09,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:17:09,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:17:09,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:17:09,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:17:09,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:17:09,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:17:09,562 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:17:09,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:17:09,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:17:09,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:17:09,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:17:09,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:17:09,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:17:09,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:17:09,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:17:09,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:17:09,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:17:09,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:17:09,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:17:09,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:17:09,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:17:09,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:17:09,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:17:09,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:17:09,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:17:09,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:17:09,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:17:09,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:17:09,581 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 [2022-04-27 10:17:09,594 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:17:09,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:17:09,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:17:09,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:17:09,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:17:09,595 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:17:09,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:17:09,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:17:09,595 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:17:09,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:17:09,596 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:17:09,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:17:09,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:17:09,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:17:09,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:17:09,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:17:09,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:17:09,596 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:17:09,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:17:09,597 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:17:09,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:17:09,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:17:09,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:17:09,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:17:09,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:17:09,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:17:09,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:17:09,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:17:09,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:17:09,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:17:09,598 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:17:09,598 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:17:09,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:17:09,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:17:09,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:17:09,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:17:09,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:17:09,804 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:17:09,805 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:17:09,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix-1.c [2022-04-27 10:17:09,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a7c7ec7/ca26d4521ffe40cabd2d055eb016b203/FLAGfaad49193 [2022-04-27 10:17:10,201 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:17:10,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2022-04-27 10:17:10,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a7c7ec7/ca26d4521ffe40cabd2d055eb016b203/FLAGfaad49193 [2022-04-27 10:17:10,219 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a7c7ec7/ca26d4521ffe40cabd2d055eb016b203 [2022-04-27 10:17:10,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:17:10,222 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:17:10,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:17:10,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:17:10,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:17:10,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:17:10" (1/1) ... [2022-04-27 10:17:10,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1314e81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:10, skipping insertion in model container [2022-04-27 10:17:10,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:17:10" (1/1) ... [2022-04-27 10:17:10,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:17:10,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:17:10,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c[320,333] [2022-04-27 10:17:10,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:17:10,521 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:17:10,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c[320,333] [2022-04-27 10:17:10,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:17:10,560 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:17:10,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:10 WrapperNode [2022-04-27 10:17:10,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:17:10,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:17:10,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:17:10,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:17:10,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:10" (1/1) ... [2022-04-27 10:17:10,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:10" (1/1) ... [2022-04-27 10:17:10,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:10" (1/1) ... [2022-04-27 10:17:10,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:10" (1/1) ... [2022-04-27 10:17:10,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:10" (1/1) ... [2022-04-27 10:17:10,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:10" (1/1) ... [2022-04-27 10:17:10,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:10" (1/1) ... [2022-04-27 10:17:10,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:17:10,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:17:10,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:17:10,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:17:10,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:10" (1/1) ... [2022-04-27 10:17:10,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:17:10,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:10,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:17:10,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:17:10,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:17:10,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:17:10,688 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:17:10,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:17:10,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:17:10,689 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:17:10,689 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:17:10,689 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:17:10,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:17:10,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:17:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:17:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:17:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:17:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:17:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:17:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:17:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:17:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:17:10,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:17:10,731 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:17:10,732 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:17:10,885 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:17:10,890 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:17:10,890 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:17:10,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:17:10 BoogieIcfgContainer [2022-04-27 10:17:10,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:17:10,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:17:10,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:17:10,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:17:10,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:17:10" (1/3) ... [2022-04-27 10:17:10,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7f4128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:17:10, skipping insertion in model container [2022-04-27 10:17:10,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:10" (2/3) ... [2022-04-27 10:17:10,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7f4128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:17:10, skipping insertion in model container [2022-04-27 10:17:10,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:17:10" (3/3) ... [2022-04-27 10:17:10,899 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-1.c [2022-04-27 10:17:10,907 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:17:10,908 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:17:10,949 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:17:10,953 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@72cfdf5f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5a880aa2 [2022-04-27 10:17:10,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:17:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:17:10,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:10,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:10,963 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:10,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1729786458, now seen corresponding path program 1 times [2022-04-27 10:17:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:10,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401722184] [2022-04-27 10:17:10,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:10,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:11,031 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 10:17:11,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953609044] [2022-04-27 10:17:11,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:11,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:11,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:11,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:11,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:17:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:11,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 10:17:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:11,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:11,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2022-04-27 10:17:11,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-27 10:17:11,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 10:17:11,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #56#return; {27#true} is VALID [2022-04-27 10:17:11,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret11 := main(); {27#true} is VALID [2022-04-27 10:17:11,160 INFO L290 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~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {47#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 10:17:11,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {28#false} is VALID [2022-04-27 10:17:11,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {28#false} is VALID [2022-04-27 10:17:11,160 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {28#false} is VALID [2022-04-27 10:17:11,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-27 10:17:11,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-27 10:17:11,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-27 10:17:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:11,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:17:11,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:11,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401722184] [2022-04-27 10:17:11,162 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 10:17:11,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953609044] [2022-04-27 10:17:11,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953609044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:11,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:11,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:17:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598114823] [2022-04-27 10:17:11,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:11,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:17:11,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:11,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:11,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:17:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:11,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:17:11,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:17:11,196 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:11,270 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-27 10:17:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:17:11,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:17:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-27 10:17:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-27 10:17:11,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-27 10:17:11,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:11,355 INFO L225 Difference]: With dead ends: 47 [2022-04-27 10:17:11,356 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:17:11,358 INFO L412 NwaCegarLoop]: 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 [2022-04-27 10:17:11,360 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:11,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:17:11,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:17:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-04-27 10:17:11,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:11,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,382 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,382 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:11,384 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-27 10:17:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-27 10:17:11,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:11,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:11,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 10:17:11,386 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 10:17:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:11,388 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-27 10:17:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-27 10:17:11,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:11,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:11,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:11,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 10:17:11,399 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-27 10:17:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:11,399 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 10:17:11,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 10:17:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:17:11,401 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:11,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:11,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 10:17:11,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 10:17:11,616 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:11,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:11,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1358301917, now seen corresponding path program 1 times [2022-04-27 10:17:11,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:11,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5987516] [2022-04-27 10:17:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:11,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:11,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 10:17:11,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2125609303] [2022-04-27 10:17:11,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:11,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:11,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:11,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:11,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:17:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:11,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 10:17:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:11,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:11,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {197#true} is VALID [2022-04-27 10:17:11,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {197#true} is VALID [2022-04-27 10:17:11,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} assume true; {197#true} is VALID [2022-04-27 10:17:11,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} #56#return; {197#true} is VALID [2022-04-27 10:17:11,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {197#true} call #t~ret11 := main(); {197#true} is VALID [2022-04-27 10:17:11,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#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~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {217#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 10:17:11,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {221#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 10:17:11,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {221#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {198#false} is VALID [2022-04-27 10:17:11,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {198#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {198#false} is VALID [2022-04-27 10:17:11,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {198#false} is VALID [2022-04-27 10:17:11,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {198#false} is VALID [2022-04-27 10:17:11,813 INFO L272 TraceCheckUtils]: 11: Hoare triple {198#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {198#false} is VALID [2022-04-27 10:17:11,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {198#false} ~cond := #in~cond; {198#false} is VALID [2022-04-27 10:17:11,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {198#false} assume 0 == ~cond; {198#false} is VALID [2022-04-27 10:17:11,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {198#false} assume !false; {198#false} is VALID [2022-04-27 10:17:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:11,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:17:11,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:11,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5987516] [2022-04-27 10:17:11,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 10:17:11,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125609303] [2022-04-27 10:17:11,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125609303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:11,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:11,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:17:11,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344525226] [2022-04-27 10:17:11,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:11,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:17:11,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:11,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:11,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:17:11,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:11,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:17:11,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:17:11,833 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:11,916 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-27 10:17:11,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:17:11,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:17:11,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-27 10:17:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-27 10:17:11,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-27 10:17:11,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:11,951 INFO L225 Difference]: With dead ends: 36 [2022-04-27 10:17:11,951 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 10:17:11,951 INFO L412 NwaCegarLoop]: 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 [2022-04-27 10:17:11,952 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:11,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:17:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 10:17:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-04-27 10:17:11,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:11,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,955 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,955 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:11,956 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-27 10:17:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-27 10:17:11,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:11,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:11,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-27 10:17:11,957 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-27 10:17:11,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:11,958 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-27 10:17:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-27 10:17:11,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:11,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:11,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:11,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-27 10:17:11,959 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-27 10:17:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:11,960 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-27 10:17:11,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 10:17:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:17:11,960 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:11,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:11,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:17:12,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-27 10:17:12,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:12,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:12,200 INFO L85 PathProgramCache]: Analyzing trace with hash -770745069, now seen corresponding path program 1 times [2022-04-27 10:17:12,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:12,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785229473] [2022-04-27 10:17:12,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:12,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:12,213 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 10:17:12,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1367707221] [2022-04-27 10:17:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:12,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:12,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:12,215 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:12,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:17:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:12,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 10:17:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:12,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:14,023 INFO L390 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 [2022-04-27 10:17:14,148 INFO L390 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 [2022-04-27 10:17:14,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {377#true} is VALID [2022-04-27 10:17:14,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {377#true} is VALID [2022-04-27 10:17:14,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-27 10:17:14,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #56#return; {377#true} is VALID [2022-04-27 10:17:14,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret11 := main(); {377#true} is VALID [2022-04-27 10:17:14,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#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~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {397#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 10:17:14,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {397#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {401#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 10:17:14,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {401#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#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~nondet7;call #t~mem8 := 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); {401#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 10:17:14,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {401#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := 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~mem9;havoc #t~mem9; {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 10:17:14,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 10:17:14,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 10:17:14,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 10:17:14,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 10:17:14,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {424#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 10:17:14,209 INFO L272 TraceCheckUtils]: 14: Hoare triple {424#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {428#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:14,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {428#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {432#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:14,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {432#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {378#false} is VALID [2022-04-27 10:17:14,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-04-27 10:17:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:14,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:15,765 INFO L390 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 26 treesize of output 24 [2022-04-27 10:17:15,777 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:15,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 23 [2022-04-27 10:17:15,792 INFO L390 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 28 treesize of output 26 [2022-04-27 10:17:15,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:15,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 26 treesize of output 25 [2022-04-27 10:17:15,825 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 10:17:15,840 INFO L390 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 29 treesize of output 27 [2022-04-27 10:17:15,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:15,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 27 treesize of output 26 [2022-04-27 10:17:15,958 INFO L390 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 24 treesize of output 22 [2022-04-27 10:17:15,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:15,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 22 treesize of output 21 [2022-04-27 10:17:16,076 INFO L390 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 26 treesize of output 24 [2022-04-27 10:17:16,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:16,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 23 [2022-04-27 10:17:16,382 INFO L390 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 27 treesize of output 25 [2022-04-27 10:17:16,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:16,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-27 10:17:16,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:16,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-04-27 10:17:17,246 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-27 10:17:17,308 INFO L356 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-04-27 10:17:17,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 3 [2022-04-27 10:17:17,324 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-04-27 10:17:17,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 3 [2022-04-27 10:17:17,354 INFO L356 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-04-27 10:17:17,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 3 [2022-04-27 10:17:17,420 INFO L356 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-04-27 10:17:17,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-04-27 10:17:17,464 INFO L356 Elim1Store]: treesize reduction 6, result has 73.9 percent of original size [2022-04-27 10:17:17,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2022-04-27 10:17:21,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-04-27 10:17:21,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {432#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {378#false} is VALID [2022-04-27 10:17:21,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {428#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {432#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:21,688 INFO L272 TraceCheckUtils]: 14: Hoare triple {424#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {428#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:21,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {424#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 10:17:21,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 10:17:21,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 10:17:21,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 10:17:21,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 10:17:21,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(and (or (<= (mod main_~j~0 4294967296) 2147483647) (and (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (and (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (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) (- 17179869184))) |main_~#matriz~0.offset|)))) (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (+ (mod main_~j~0 4294967296) (- 4294967296))) |main_~#matriz~0.offset|)))))) (or (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (+ (mod main_~j~0 4294967296) (- 4294967296))) |main_~#matriz~0.offset|)))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) |main_~#matriz~0.offset|))))) (<= (mod main_~k~0 4294967296) 2147483647)))) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (or (<= (mod main_~k~0 4294967296) 2147483647) (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod main_~j~0 4294967296)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (- 17179869184) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))))) (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (and (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (* (mod main_~N_LIN~0 4294967296) 4) (mod main_~j~0 4294967296)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (not (<= (mod main_~N_LIN~0 4294967296) 2147483647))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))))))))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := 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~mem9;havoc #t~mem9; {408#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 10:17:21,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {470#(or (not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (and (or (<= (mod main_~j~0 4294967296) 2147483647) (and (not (<= (mod main_~k~0 4294967296) 2147483647)) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))))) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296))) (<= (mod main_~k~0 4294967296) 2147483647)))))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#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~nondet7;call #t~mem8 := 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); {466#(and (or (<= (mod main_~j~0 4294967296) 2147483647) (and (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (and (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (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) (- 17179869184))) |main_~#matriz~0.offset|)))) (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (+ (mod main_~j~0 4294967296) (- 4294967296))) |main_~#matriz~0.offset|)))))) (or (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (+ (mod main_~j~0 4294967296) (- 4294967296))) |main_~#matriz~0.offset|)))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (mod main_~k~0 4294967296) 4) (* (+ (mod main_~j~0 4294967296) (- 4294967296)) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) |main_~#matriz~0.offset|))))) (<= (mod main_~k~0 4294967296) 2147483647)))) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (or (<= (mod main_~k~0 4294967296) 2147483647) (and (or (not (<= (mod main_~N_LIN~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (- 17179869184) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod main_~j~0 4294967296)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (- 17179869184) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))))) (or (not (<= (mod main_~k~0 4294967296) 2147483647)) (and (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (* (mod main_~N_LIN~0 4294967296) 4) (mod main_~j~0 4294967296)) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (not (<= (mod main_~N_LIN~0 4294967296) 2147483647))) (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) (+ (* (mod main_~N_LIN~0 4294967296) 4) (- 17179869184))) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)))))))))} is VALID [2022-04-27 10:17:21,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {474#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) (* 17179869184 (mod main_~j~0 4294967296))) (not (< 0 (mod main_~N_LIN~0 4294967296))) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {470#(or (not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (and (or (<= (mod main_~j~0 4294967296) 2147483647) (and (not (<= (mod main_~k~0 4294967296) 2147483647)) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))))) (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (and (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296))) (<= (mod main_~k~0 4294967296) 2147483647)))))} is VALID [2022-04-27 10:17:21,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#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~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {474#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) (* 17179869184 (mod main_~j~0 4294967296))) (not (< 0 (mod main_~N_LIN~0 4294967296))) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} is VALID [2022-04-27 10:17:21,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret11 := main(); {377#true} is VALID [2022-04-27 10:17:21,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #56#return; {377#true} is VALID [2022-04-27 10:17:21,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-27 10:17:21,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {377#true} is VALID [2022-04-27 10:17:21,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {377#true} is VALID [2022-04-27 10:17:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:21,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:21,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785229473] [2022-04-27 10:17:21,719 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 10:17:21,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367707221] [2022-04-27 10:17:21,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367707221] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:21,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:17:21,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-04-27 10:17:21,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956682690] [2022-04-27 10:17:21,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:21,720 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:17:21,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:21,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:21,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:21,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 10:17:21,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:21,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 10:17:21,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:17:21,791 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:37,677 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-04-27 10:17:37,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 10:17:37,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:17:37,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2022-04-27 10:17:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2022-04-27 10:17:37,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 68 transitions. [2022-04-27 10:17:38,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:38,179 INFO L225 Difference]: With dead ends: 53 [2022-04-27 10:17:38,179 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 10:17:38,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-04-27 10:17:38,180 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:38,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 75 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 10:17:38,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 10:17:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-04-27 10:17:38,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:38,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:38,204 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:38,205 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:38,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:38,206 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 10:17:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-27 10:17:38,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:38,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:38,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-27 10:17:38,207 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-27 10:17:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:38,209 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 10:17:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-27 10:17:38,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:38,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:38,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:38,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-27 10:17:38,210 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 18 [2022-04-27 10:17:38,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:38,211 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-27 10:17:38,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-27 10:17:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:17:38,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:38,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:38,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 10:17:38,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:38,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:38,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1163772079, now seen corresponding path program 1 times [2022-04-27 10:17:38,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:38,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441497584] [2022-04-27 10:17:38,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:38,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:38,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 10:17:38,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359490243] [2022-04-27 10:17:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:38,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:38,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:38,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:38,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 10:17:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:38,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 10:17:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:38,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:38,809 INFO L390 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 0 case distinctions, treesize of input 50 treesize of output 45 [2022-04-27 10:17:38,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2022-04-27 10:17:38,949 INFO L390 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 [2022-04-27 10:17:39,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {743#true} is VALID [2022-04-27 10:17:39,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {743#true} is VALID [2022-04-27 10:17:39,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-27 10:17:39,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #56#return; {743#true} is VALID [2022-04-27 10:17:39,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret11 := main(); {743#true} is VALID [2022-04-27 10:17:39,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#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~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {763#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 10:17:39,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {763#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {767#(and (= main_~k~0 0) (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 10:17:39,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {767#(and (= main_~k~0 0) (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#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~nondet7;call #t~mem8 := 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); {771#(and (= main_~N_COL~0 1) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) |main_#t~mem8|))} is VALID [2022-04-27 10:17:39,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {771#(and (= main_~N_COL~0 1) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) |main_#t~mem8|))} assume !(#t~mem8 >= ~maior~0);havoc #t~mem8; {775#(and (= main_~N_COL~0 1) (= main_~j~0 0) (< (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0))} is VALID [2022-04-27 10:17:39,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#(and (= main_~N_COL~0 1) (= main_~j~0 0) (< (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {775#(and (= main_~N_COL~0 1) (= main_~j~0 0) (< (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0))} is VALID [2022-04-27 10:17:39,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {775#(and (= main_~N_COL~0 1) (= main_~j~0 0) (< (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {775#(and (= main_~N_COL~0 1) (= main_~j~0 0) (< (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0))} is VALID [2022-04-27 10:17:39,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {775#(and (= main_~N_COL~0 1) (= main_~j~0 0) (< (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {785#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1) (< (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod (+ main_~j~0 4294967295) 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0))} is VALID [2022-04-27 10:17:39,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {785#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1) (< (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod (+ main_~j~0 4294967295) 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {789#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 10:17:39,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {789#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {793#(< |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 10:17:39,051 INFO L272 TraceCheckUtils]: 14: Hoare triple {793#(< |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:39,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {801#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:39,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {744#false} is VALID [2022-04-27 10:17:39,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-27 10:17:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:39,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:39,862 INFO L390 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 28 treesize of output 26 [2022-04-27 10:17:39,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:39,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 26 treesize of output 25 [2022-04-27 10:17:39,999 INFO L390 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 26 treesize of output 24 [2022-04-27 10:17:40,156 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:40,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 23 [2022-04-27 10:17:40,209 INFO L390 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 27 treesize of output 25 [2022-04-27 10:17:40,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:40,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-27 10:17:40,239 INFO L390 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 29 treesize of output 27 [2022-04-27 10:17:40,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:40,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 27 treesize of output 26 [2022-04-27 10:17:40,285 INFO L390 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 25 treesize of output 23 [2022-04-27 10:17:40,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:40,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-04-27 10:17:40,339 INFO L390 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 27 treesize of output 25 [2022-04-27 10:17:40,356 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:40,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-27 10:17:40,373 INFO L390 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 26 treesize of output 24 [2022-04-27 10:17:40,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:40,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 23 [2022-04-27 10:17:40,523 INFO L390 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 24 treesize of output 22 [2022-04-27 10:17:40,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 10:17:40,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 22 treesize of output 21 [2022-04-27 10:17:51,546 WARN L232 SmtUtils]: Spent 10.95s on a formula simplification. DAG size of input: 181 DAG size of output: 117 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-04-27 10:17:51,567 INFO L356 Elim1Store]: treesize reduction 1065, result has 24.4 percent of original size [2022-04-27 10:17:51,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 294 treesize of output 479 [2022-04-27 10:23:19,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {744#false} assume !false; {744#false} is VALID [2022-04-27 10:23:19,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {744#false} is VALID [2022-04-27 10:23:19,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {801#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:23:19,954 INFO L272 TraceCheckUtils]: 14: Hoare triple {817#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:23:19,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {821#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {817#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 10:23:19,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {825#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {821#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 10:23:19,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {829#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {825#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:19,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {829#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {829#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:19,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {829#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {829#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:19,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {839#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1)) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !(#t~mem8 >= ~maior~0);havoc #t~mem8; {829#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:19,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {843#(or (and (or (<= (mod main_~j~0 4294967296) 2147483647) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (<= (mod main_~k~0 4294967296) 2147483647)) (or (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~N_LIN~0 4294967296))) (and (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (<= (mod main_~k~0 4294967296) 2147483647)) (or (< 2147483647 (mod main_~k~0 4294967296)) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296)))) (or (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (= 17179869184 (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (<= (mod main_~k~0 4294967296) 2147483647))))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#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~nondet7;call #t~mem8 := 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); {839#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1)) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:19,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {847#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) (* 17179869184 (mod main_~j~0 4294967296))) (= (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {843#(or (and (or (<= (mod main_~j~0 4294967296) 2147483647) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (<= (mod main_~k~0 4294967296) 2147483647)) (or (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~N_LIN~0 4294967296))) (and (or (<= (mod main_~N_LIN~0 4294967296) 2147483647) (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (<= (mod main_~k~0 4294967296) 2147483647)) (or (< 2147483647 (mod main_~k~0 4294967296)) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (* 17179869184 (mod main_~j~0 4294967296)))) (or (= (+ (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* 17179869184 (mod main_~j~0 4294967296))) (+ (* (mod main_~k~0 4294967296) 4) 73786976277658337280 (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (= 17179869184 (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4))) (<= (mod main_~k~0 4294967296) 2147483647))))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:19,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {743#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~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {847#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) (* 17179869184 (mod main_~j~0 4294967296))) (= (* 17179869184 (mod main_~N_LIN~0 4294967296)) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:19,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {743#true} call #t~ret11 := main(); {743#true} is VALID [2022-04-27 10:23:19,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {743#true} {743#true} #56#return; {743#true} is VALID [2022-04-27 10:23:19,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {743#true} assume true; {743#true} is VALID [2022-04-27 10:23:19,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {743#true} is VALID [2022-04-27 10:23:19,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {743#true} is VALID [2022-04-27 10:23:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:23:19,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:23:19,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441497584] [2022-04-27 10:23:19,982 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 10:23:19,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359490243] [2022-04-27 10:23:19,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359490243] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:23:19,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:23:19,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-27 10:23:19,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834171530] [2022-04-27 10:23:19,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 10:23:19,983 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:23:19,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:23:19,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:20,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:20,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 10:23:20,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:23:20,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 10:23:20,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:23:20,026 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:31,652 WARN L232 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:23:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:38,066 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2022-04-27 10:23:38,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 10:23:38,067 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:23:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:23:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 81 transitions. [2022-04-27 10:23:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 81 transitions. [2022-04-27 10:23:38,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 81 transitions. [2022-04-27 10:23:38,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:38,542 INFO L225 Difference]: With dead ends: 77 [2022-04-27 10:23:38,542 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 10:23:38,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 10:23:38,544 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 10:23:38,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 84 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 10:23:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 10:23:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35. [2022-04-27 10:23:38,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:23:38,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:38,567 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:38,567 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:38,572 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 10:23:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 10:23:38,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:23:38,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:23:38,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-27 10:23:38,573 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-27 10:23:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:38,574 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 10:23:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 10:23:38,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:23:38,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:23:38,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:23:38,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:23:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:38,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-04-27 10:23:38,575 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 18 [2022-04-27 10:23:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:23:38,576 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-04-27 10:23:38,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-27 10:23:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 10:23:38,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:23:38,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:23:38,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 10:23:38,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:23:38,782 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:23:38,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:23:38,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1028760387, now seen corresponding path program 2 times [2022-04-27 10:23:38,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:23:38,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320894398] [2022-04-27 10:23:38,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:23:38,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:23:38,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 10:23:38,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [553100787] [2022-04-27 10:23:38,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:23:38,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:23:38,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:23:38,824 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:23:38,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 10:23:38,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:23:38,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:23:38,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:23:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:23:38,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:23:38,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {1168#true} call ULTIMATE.init(); {1168#true} is VALID [2022-04-27 10:23:38,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {1168#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1168#true} is VALID [2022-04-27 10:23:38,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {1168#true} assume true; {1168#true} is VALID [2022-04-27 10:23:38,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1168#true} {1168#true} #56#return; {1168#true} is VALID [2022-04-27 10:23:38,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {1168#true} call #t~ret11 := main(); {1168#true} is VALID [2022-04-27 10:23:38,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {1168#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~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1188#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 10:23:38,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1188#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 10:23:38,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#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~nondet7;call #t~mem8 := 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); {1188#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 10:23:38,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := 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~mem9;havoc #t~mem9; {1188#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 10:23:38,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#(and (= main_~N_COL~0 1) (= main_~j~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1188#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 10:23:38,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {1188#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1188#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 10:23:38,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#(and (= main_~N_COL~0 1) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1207#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1))} is VALID [2022-04-27 10:23:38,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {1207#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1169#false} is VALID [2022-04-27 10:23:38,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {1169#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1169#false} is VALID [2022-04-27 10:23:38,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {1169#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1169#false} is VALID [2022-04-27 10:23:38,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {1169#false} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1169#false} is VALID [2022-04-27 10:23:38,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#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~nondet7;call #t~mem8 := 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); {1169#false} is VALID [2022-04-27 10:23:38,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {1169#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := 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~mem9;havoc #t~mem9; {1169#false} is VALID [2022-04-27 10:23:38,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {1169#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1169#false} is VALID [2022-04-27 10:23:38,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {1169#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1169#false} is VALID [2022-04-27 10:23:38,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {1169#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1169#false} is VALID [2022-04-27 10:23:38,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {1169#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1169#false} is VALID [2022-04-27 10:23:38,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {1169#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1169#false} is VALID [2022-04-27 10:23:38,985 INFO L272 TraceCheckUtils]: 23: Hoare triple {1169#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1169#false} is VALID [2022-04-27 10:23:38,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {1169#false} ~cond := #in~cond; {1169#false} is VALID [2022-04-27 10:23:38,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {1169#false} assume 0 == ~cond; {1169#false} is VALID [2022-04-27 10:23:38,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2022-04-27 10:23:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 10:23:38,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:23:39,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2022-04-27 10:23:39,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {1169#false} assume 0 == ~cond; {1169#false} is VALID [2022-04-27 10:23:39,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {1169#false} ~cond := #in~cond; {1169#false} is VALID [2022-04-27 10:23:39,077 INFO L272 TraceCheckUtils]: 23: Hoare triple {1169#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1169#false} is VALID [2022-04-27 10:23:39,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {1169#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1169#false} is VALID [2022-04-27 10:23:39,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {1169#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1169#false} is VALID [2022-04-27 10:23:39,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {1169#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1169#false} is VALID [2022-04-27 10:23:39,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {1169#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1169#false} is VALID [2022-04-27 10:23:39,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {1169#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1169#false} is VALID [2022-04-27 10:23:39,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {1169#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := 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~mem9;havoc #t~mem9; {1169#false} is VALID [2022-04-27 10:23:39,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#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~nondet7;call #t~mem8 := 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); {1169#false} is VALID [2022-04-27 10:23:39,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {1169#false} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1169#false} is VALID [2022-04-27 10:23:39,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {1169#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1169#false} is VALID [2022-04-27 10:23:39,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {1169#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1169#false} is VALID [2022-04-27 10:23:39,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {1295#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1169#false} is VALID [2022-04-27 10:23:39,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {1299#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1295#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:39,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {1299#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1299#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:39,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {1299#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1299#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:39,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {1299#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := 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~mem9;havoc #t~mem9; {1299#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:39,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {1299#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#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~nondet7;call #t~mem8 := 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); {1299#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:39,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {1299#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1299#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:39,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {1168#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~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1299#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 10:23:39,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {1168#true} call #t~ret11 := main(); {1168#true} is VALID [2022-04-27 10:23:39,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1168#true} {1168#true} #56#return; {1168#true} is VALID [2022-04-27 10:23:39,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {1168#true} assume true; {1168#true} is VALID [2022-04-27 10:23:39,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {1168#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1168#true} is VALID [2022-04-27 10:23:39,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {1168#true} call ULTIMATE.init(); {1168#true} is VALID [2022-04-27 10:23:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 10:23:39,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:23:39,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320894398] [2022-04-27 10:23:39,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 10:23:39,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553100787] [2022-04-27 10:23:39,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553100787] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:23:39,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:23:39,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-27 10:23:39,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466069853] [2022-04-27 10:23:39,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 10:23:39,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 10:23:39,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:23:39,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:39,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:39,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:23:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:23:39,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:23:39,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:23:39,111 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:39,154 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 10:23:39,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:23:39,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 10:23:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:23:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-27 10:23:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-27 10:23:39,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-27 10:23:39,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:39,176 INFO L225 Difference]: With dead ends: 35 [2022-04-27 10:23:39,176 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:23:39,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:23:39,177 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:23:39,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:23:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:23:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:23:39,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:23:39,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:23:39,179 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:23:39,179 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:23:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:39,179 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:23:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:23:39,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:23:39,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:23:39,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:23:39,179 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:23:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:23:39,179 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:23:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:23:39,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:23:39,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:23:39,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:23:39,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:23:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:23:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:23:39,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-04-27 10:23:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:23:39,180 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:23:39,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:23:39,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:23:39,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:23:39,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 10:23:39,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:23:39,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:23:39,862 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 10:23:39,862 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 10:23:39,862 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 10:23:39,862 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 33) no Hoare annotation was computed. [2022-04-27 10:23:39,862 INFO L899 garLoopResultBuilder]: For program point L21-2(lines 21 28) no Hoare annotation was computed. [2022-04-27 10:23:39,862 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 28) the Hoare annotation is: (let ((.cse0 (= main_~N_COL~0 1))) (or (and .cse0 (= main_~j~0 0) (= main_~N_LIN~0 1)) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= main_~j~0 1) .cse0))) [2022-04-27 10:23:39,862 INFO L899 garLoopResultBuilder]: For program point L21-4(lines 21 28) no Hoare annotation was computed. [2022-04-27 10:23:39,862 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 13 33) no Hoare annotation was computed. [2022-04-27 10:23:39,862 INFO L895 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (let ((.cse0 (mod main_~N_LIN~0 4294967296)) (.cse1 (mod main_~j~0 4294967296))) (or (= (* (* .cse0 .cse1) 4) (* 17179869184 .cse1)) (not (< 0 .cse0)) (not (< .cse1 (mod main_~N_COL~0 4294967296))))) (<= |main_#t~mem10| main_~maior~0)) [2022-04-27 10:23:39,862 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 33) the Hoare annotation is: true [2022-04-27 10:23:39,862 INFO L899 garLoopResultBuilder]: For program point L30-1(line 30) no Hoare annotation was computed. [2022-04-27 10:23:39,863 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 27) no Hoare annotation was computed. [2022-04-27 10:23:39,863 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 22 28) no Hoare annotation was computed. [2022-04-27 10:23:39,863 INFO L895 garLoopResultBuilder]: At program point L22-3(lines 22 28) the Hoare annotation is: (let ((.cse0 (= main_~N_COL~0 1)) (.cse1 (= main_~j~0 0)) (.cse2 (= main_~N_LIN~0 1))) (or (and (= main_~k~0 0) .cse0 .cse1 .cse2) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) .cse0 .cse1 .cse2))) [2022-04-27 10:23:39,863 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:23:39,863 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:23:39,863 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:23:39,863 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:23:39,863 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:23:39,863 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:23:39,863 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:23:39,863 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 10:23:39,863 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 10:23:39,863 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 10:23:39,863 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:23:39,863 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 10:23:39,863 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 10:23:39,865 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-27 10:23:39,866 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:23:39,868 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:23:39,868 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:23:39,882 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:23:39,882 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:23:39,882 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:23:39,882 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:23:39,882 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-27 10:23:39,882 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:23:39,884 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:23:39,884 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. [2022-04-27 10:23:39,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:23:39 BoogieIcfgContainer [2022-04-27 10:23:39,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:23:39,893 INFO L158 Benchmark]: Toolchain (without parser) took 389670.24ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 152.5MB in the beginning and 183.9MB in the end (delta: -31.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:23:39,893 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 203.4MB. Free memory is still 168.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:23:39,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.19ms. Allocated memory is still 203.4MB. Free memory was 152.2MB in the beginning and 178.5MB in the end (delta: -26.3MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-04-27 10:23:39,893 INFO L158 Benchmark]: Boogie Preprocessor took 55.48ms. Allocated memory is still 203.4MB. Free memory was 178.5MB in the beginning and 177.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:23:39,893 INFO L158 Benchmark]: RCFGBuilder took 276.50ms. Allocated memory is still 203.4MB. Free memory was 177.0MB in the beginning and 163.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 10:23:39,894 INFO L158 Benchmark]: TraceAbstraction took 388997.69ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 163.4MB in the beginning and 183.9MB in the end (delta: -20.5MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. [2022-04-27 10:23:39,894 INFO L339 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.15ms. Allocated memory is still 203.4MB. Free memory is still 168.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 329.19ms. Allocated memory is still 203.4MB. Free memory was 152.2MB in the beginning and 178.5MB in the end (delta: -26.3MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.48ms. Allocated memory is still 203.4MB. Free memory was 178.5MB in the beginning and 177.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 276.50ms. Allocated memory is still 203.4MB. Free memory was 177.0MB in the beginning and 163.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 388997.69ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 163.4MB in the beginning and 183.9MB in the end (delta: -20.5MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 388.9s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 35.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 263 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 63 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 34.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=3, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 39 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 22 NumberOfFragments, 102 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 312 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 351.3s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 1268 SizeOfPredicates, 31 NumberOfNonLiveVariables, 475 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 41/51 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((k == 0 && N_COL == 1) && j == 0) && N_LIN == 1) || (((unknown-#memory_int-unknown[matriz][matriz] <= maior && N_COL == 1) && j == 0) && N_LIN == 1) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((N_COL == 1 && j == 0) && N_LIN == 1) || ((unknown-#memory_int-unknown[matriz][matriz] <= maior && j == 1) && N_COL == 1) RESULT: Ultimate proved your program to be correct! [2022-04-27 10:23:40,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...