/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/matrix-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:05:46,384 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:05:46,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:05:46,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:05:46,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:05:46,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:05:46,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:05:46,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:05:46,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:05:46,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:05:46,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:05:46,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:05:46,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:05:46,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:05:46,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:05:46,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:05:46,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:05:46,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:05:46,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:05:46,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:05:46,440 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:05:46,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:05:46,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:05:46,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:05:46,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:05:46,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:05:46,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:05:46,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:05:46,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:05:46,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:05:46,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:05:46,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:05:46,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:05:46,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:05:46,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:05:46,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:05:46,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:05:46,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:05:46,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:05:46,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:05:46,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:05:46,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:05:46,455 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:05:46,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:05:46,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:05:46,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:05:46,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:05:46,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:05:46,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:05:46,475 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:05:46,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:05:46,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:05:46,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:05:46,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:05:46,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:05:46,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:05:46,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:05:46,476 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:05:46,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:05:46,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:05:46,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:05:46,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:05:46,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:05:46,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:05:46,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:05:46,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:05:46,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:05:46,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:05:46,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:05:46,477 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:05:46,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:05:46,478 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:05:46,478 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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 21:05:46,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:05:46,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:05:46,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:05:46,684 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:05:46,685 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:05:46,685 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 21:05:46,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc776ca45/6d7b70400d9e4952b21c47cd5aa4d073/FLAG918fe98d0 [2022-04-27 21:05:47,134 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:05:47,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2022-04-27 21:05:47,139 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc776ca45/6d7b70400d9e4952b21c47cd5aa4d073/FLAG918fe98d0 [2022-04-27 21:05:47,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc776ca45/6d7b70400d9e4952b21c47cd5aa4d073 [2022-04-27 21:05:47,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:05:47,156 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:05:47,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:05:47,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:05:47,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:05:47,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b7ee55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47, skipping insertion in model container [2022-04-27 21:05:47,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:05:47,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:05:47,296 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 21:05:47,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:05:47,311 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:05:47,327 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 21:05:47,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:05:47,344 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:05:47,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47 WrapperNode [2022-04-27 21:05:47,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:05:47,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:05:47,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:05:47,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:05:47,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:05:47,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:05:47,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:05:47,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:05:47,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:05:47,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:47,407 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 21:05:47,413 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 21:05:47,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:05:47,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:05:47,432 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:05:47,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:05:47,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:05:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:05:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:05:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:05:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:05:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:05:47,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:05:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:05:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 21:05:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:05:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:05:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:05:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:05:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:05:47,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:05:47,474 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:05:47,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:05:47,591 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:05:47,596 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:05:47,596 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 21:05:47,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:05:47 BoogieIcfgContainer [2022-04-27 21:05:47,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:05:47,598 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:05:47,598 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:05:47,604 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:05:47,606 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:05:47" (1/1) ... [2022-04-27 21:05:47,608 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:05:47,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:05:47 BasicIcfg [2022-04-27 21:05:47,635 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:05:47,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:05:47,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:05:47,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:05:47,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:05:47" (1/4) ... [2022-04-27 21:05:47,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5302f929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:05:47, skipping insertion in model container [2022-04-27 21:05:47,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:05:47" (2/4) ... [2022-04-27 21:05:47,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5302f929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:05:47, skipping insertion in model container [2022-04-27 21:05:47,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:05:47" (3/4) ... [2022-04-27 21:05:47,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5302f929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:05:47, skipping insertion in model container [2022-04-27 21:05:47,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:05:47" (4/4) ... [2022-04-27 21:05:47,640 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-1.cqvasr [2022-04-27 21:05:47,650 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:05:47,650 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:05:47,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:05:47,719 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=FINITE_AUTOMATA, 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@6088fa20, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7732cdb2 [2022-04-27 21:05:47,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:05:47,734 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 21:05:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:05:47,739 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:47,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:47,740 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1279400997, now seen corresponding path program 1 times [2022-04-27 21:05:47,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:47,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559361830] [2022-04-27 21:05:47,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:47,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:47,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:05:47,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790950658] [2022-04-27 21:05:47,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:47,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:47,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:47,861 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 21:05:47,863 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 21:05:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:47,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 21:05:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:47,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:05:47,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:05:47,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {27#true} is VALID [2022-04-27 21:05:47,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:05:47,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:05:47,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:05:47,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {27#true} is VALID [2022-04-27 21:05:47,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [65] L21-3-->L21-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 21:05:47,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {28#false} is VALID [2022-04-27 21:05:47,985 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {28#false} is VALID [2022-04-27 21:05:47,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {28#false} is VALID [2022-04-27 21:05:47,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 21:05:47,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 21:05:47,987 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 21:05:47,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:05:47,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:47,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559361830] [2022-04-27 21:05:47,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:05:47,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790950658] [2022-04-27 21:05:47,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790950658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:47,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:05:47,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 21:05:47,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188936997] [2022-04-27 21:05:47,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:47,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 21:05:47,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:47,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 21:05:48,016 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 21:05:48,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 21:05:48,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:48,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 21:05:48,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 21:05:48,053 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 21:05:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:48,090 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-27 21:05:48,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 21:05:48,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 21:05:48,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 21:05:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2022-04-27 21:05:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 21:05:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2022-04-27 21:05:48,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 53 transitions. [2022-04-27 21:05:48,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:48,156 INFO L225 Difference]: With dead ends: 42 [2022-04-27 21:05:48,156 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 21:05:48,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 21:05:48,162 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:48,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:05:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 21:05:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 21:05:48,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:48,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 21:05:48,182 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 21:05:48,182 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 21:05:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:48,184 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 21:05:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 21:05:48,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:48,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:48,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 17 states. [2022-04-27 21:05:48,185 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 17 states. [2022-04-27 21:05:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:48,188 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 21:05:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 21:05:48,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:48,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:48,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:48,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 21:05:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 21:05:48,196 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-27 21:05:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:48,197 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 21:05:48,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 21:05:48,197 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 21:05:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:05:48,198 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:48,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:48,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:05:48,415 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 21:05:48,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:48,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1308030148, now seen corresponding path program 1 times [2022-04-27 21:05:48,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:48,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758435518] [2022-04-27 21:05:48,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:48,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:48,426 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:05:48,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [741876840] [2022-04-27 21:05:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:48,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:48,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:48,444 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 21:05:48,489 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 21:05:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:48,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 21:05:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:48,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:05:48,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {177#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#true} is VALID [2022-04-27 21:05:48,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {177#true} is VALID [2022-04-27 21:05:48,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#true} is VALID [2022-04-27 21:05:48,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#true} is VALID [2022-04-27 21:05:48,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {177#true} is VALID [2022-04-27 21:05:48,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {197#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 21:05:48,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {178#false} is VALID [2022-04-27 21:05:48,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#false} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {178#false} is VALID [2022-04-27 21:05:48,544 INFO L272 TraceCheckUtils]: 8: Hoare triple {178#false} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {178#false} is VALID [2022-04-27 21:05:48,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {178#false} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {178#false} is VALID [2022-04-27 21:05:48,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {178#false} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {178#false} is VALID [2022-04-27 21:05:48,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {178#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#false} is VALID [2022-04-27 21:05:48,545 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 21:05:48,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:05:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:48,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758435518] [2022-04-27 21:05:48,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:05:48,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741876840] [2022-04-27 21:05:48,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741876840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:48,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:05:48,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:05:48,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751752643] [2022-04-27 21:05:48,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:48,547 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 21:05:48,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:48,547 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 21:05:48,555 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 21:05:48,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:05:48,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:48,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:05:48,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:05:48,556 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. 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 21:05:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:48,585 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 21:05:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:05:48,586 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 21:05:48,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:48,593 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 21:05:48,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 21:05:48,595 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 21:05:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 21:05:48,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-27 21:05:48,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:05:48,622 INFO L225 Difference]: With dead ends: 28 [2022-04-27 21:05:48,622 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 21:05:48,622 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 21:05:48,624 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 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 21:05:48,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:05:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 21:05:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-04-27 21:05:48,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:48,631 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 21:05:48,632 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 21:05:48,632 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 21:05:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:48,634 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-27 21:05:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-27 21:05:48,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:48,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:48,635 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 21:05:48,635 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 21:05:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:48,637 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-27 21:05:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-27 21:05:48,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:48,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:48,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:48,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:48,638 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 21:05:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 21:05:48,639 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-27 21:05:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:48,640 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 21:05:48,642 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 21:05:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 21:05:48,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:05:48,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:48,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:05:48,664 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 21:05:48,858 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 21:05:48,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:48,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1527308084, now seen corresponding path program 1 times [2022-04-27 21:05:48,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:48,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024855666] [2022-04-27 21:05:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:48,886 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:05:48,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1786936491] [2022-04-27 21:05:48,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:48,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:48,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:48,900 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 21:05:48,901 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 21:05:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:48,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 21:05:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:48,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:05:49,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {326#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {326#true} is VALID [2022-04-27 21:05:49,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {326#true} is VALID [2022-04-27 21:05:49,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {326#true} is VALID [2022-04-27 21:05:49,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {326#true} is VALID [2022-04-27 21:05:49,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {326#true} is VALID [2022-04-27 21:05:49,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {346#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:05:49,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {346#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {350#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:05:49,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {327#false} is VALID [2022-04-27 21:05:49,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#false} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {327#false} is VALID [2022-04-27 21:05:49,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#false} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {327#false} is VALID [2022-04-27 21:05:49,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {327#false} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {327#false} is VALID [2022-04-27 21:05:49,040 INFO L272 TraceCheckUtils]: 11: Hoare triple {327#false} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {327#false} is VALID [2022-04-27 21:05:49,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#false} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {327#false} is VALID [2022-04-27 21:05:49,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#false} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {327#false} is VALID [2022-04-27 21:05:49,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {327#false} is VALID [2022-04-27 21:05:49,041 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 21:05:49,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:05:49,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:49,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024855666] [2022-04-27 21:05:49,041 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:05:49,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786936491] [2022-04-27 21:05:49,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786936491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:05:49,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:05:49,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:05:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158999262] [2022-04-27 21:05:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:05:49,042 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 21:05:49,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:49,042 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 21:05:49,053 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 21:05:49,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:05:49,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:05:49,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:05:49,054 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 21:05:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:49,112 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-27 21:05:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:05:49,112 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 21:05:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:49,113 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 21:05:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-27 21:05:49,114 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 21:05:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-27 21:05:49,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-27 21:05:49,145 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 21:05:49,146 INFO L225 Difference]: With dead ends: 36 [2022-04-27 21:05:49,146 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 21:05:49,147 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 21:05:49,147 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 21:05:49,148 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 21:05:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 21:05:49,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-04-27 21:05:49,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:49,150 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 21:05:49,150 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 21:05:49,150 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 21:05:49,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:49,151 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-27 21:05:49,151 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-27 21:05:49,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:49,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:49,152 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 21:05:49,152 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 21:05:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:49,153 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-27 21:05:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-27 21:05:49,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:49,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:49,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:49,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:49,154 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 21:05:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-27 21:05:49,154 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-27 21:05:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:49,155 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-27 21:05:49,155 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 21:05:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 21:05:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:05:49,155 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:49,155 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 21:05:49,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 21:05:49,372 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 21:05:49,372 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:49,372 INFO L85 PathProgramCache]: Analyzing trace with hash 990414767, now seen corresponding path program 1 times [2022-04-27 21:05:49,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:49,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965607533] [2022-04-27 21:05:49,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:49,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:49,385 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:05:49,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [95458139] [2022-04-27 21:05:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:49,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:49,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:49,387 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 21:05:49,388 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 21:05:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:49,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 21:05:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:49,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:05:49,502 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 21:05:49,584 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 21:05:49,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {506#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-04-27 21:05:49,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {506#true} is VALID [2022-04-27 21:05:49,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-04-27 21:05:49,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#true} {506#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-04-27 21:05:49,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-04-27 21:05:49,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {526#(= main_~j~0 0)} is VALID [2022-04-27 21:05:49,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {526#(= main_~j~0 0)} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {530#(and (= main_~k~0 0) (= main_~j~0 0))} is VALID [2022-04-27 21:05:49,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#(and (= main_~k~0 0) (= main_~j~0 0))} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {530#(and (= main_~k~0 0) (= main_~j~0 0))} is VALID [2022-04-27 21:05:49,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {530#(and (= main_~k~0 0) (= main_~j~0 0))} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (mod v_main_~k~0_5 4294967296) 4) (* (mod v_main_~j~0_6 4294967296) (* (mod v_main_~N_LIN~0_4 4294967296) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:49,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:49,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:49,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:49,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:49,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {553#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 21:05:49,663 INFO L272 TraceCheckUtils]: 14: Hoare triple {553#(<= |main_#t~mem10| main_~maior~0)} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {557#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:05:49,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {557#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {561#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:05:49,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {561#(<= 1 __VERIFIER_assert_~cond)} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {507#false} is VALID [2022-04-27 21:05:49,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {507#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#false} is VALID [2022-04-27 21:05:49,664 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 21:05:49,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:05:49,815 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 21:05:49,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 42 [2022-04-27 21:05:55,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {507#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {507#false} is VALID [2022-04-27 21:05:55,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {561#(<= 1 __VERIFIER_assert_~cond)} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {507#false} is VALID [2022-04-27 21:05:55,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {557#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {561#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:05:55,047 INFO L272 TraceCheckUtils]: 14: Hoare triple {553#(<= |main_#t~mem10| main_~maior~0)} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {557#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:05:55,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {553#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 21:05:55,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:55,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:55,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:55,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:55,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {595#(<= (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|)))} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (mod v_main_~k~0_5 4294967296) 4) (* (mod v_main_~j~0_6 4294967296) (* (mod v_main_~N_LIN~0_4 4294967296) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {537#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:55,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {599#(forall ((aux_mod_main_~N_LIN~0_30 Int)) (or (>= aux_mod_main_~N_LIN~0_30 4294967296) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* aux_mod_main_~N_LIN~0_30 (mod main_~j~0 4294967296)) 4)) 0) (> 0 aux_mod_main_~N_LIN~0_30)))} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {595#(<= (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|)))} is VALID [2022-04-27 21:05:55,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#(forall ((aux_mod_main_~N_LIN~0_30 Int)) (or (= (* (* aux_mod_main_~N_LIN~0_30 (mod main_~j~0 4294967296)) 4) 0) (>= aux_mod_main_~N_LIN~0_30 4294967296) (> 0 aux_mod_main_~N_LIN~0_30)))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {599#(forall ((aux_mod_main_~N_LIN~0_30 Int)) (or (>= aux_mod_main_~N_LIN~0_30 4294967296) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* aux_mod_main_~N_LIN~0_30 (mod main_~j~0 4294967296)) 4)) 0) (> 0 aux_mod_main_~N_LIN~0_30)))} is VALID [2022-04-27 21:05:55,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {603#(forall ((aux_mod_main_~N_LIN~0_30 Int)) (or (= (* (* aux_mod_main_~N_LIN~0_30 (mod main_~j~0 4294967296)) 4) 0) (>= aux_mod_main_~N_LIN~0_30 4294967296) (> 0 aux_mod_main_~N_LIN~0_30)))} is VALID [2022-04-27 21:05:55,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-04-27 21:05:55,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#true} {506#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-04-27 21:05:55,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-04-27 21:05:55,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {506#true} is VALID [2022-04-27 21:05:55,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {506#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {506#true} is VALID [2022-04-27 21:05:55,056 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 21:05:55,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:05:55,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965607533] [2022-04-27 21:05:55,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:05:55,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95458139] [2022-04-27 21:05:55,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95458139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:05:55,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 21:05:55,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2022-04-27 21:05:55,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280112031] [2022-04-27 21:05:55,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 21:05:55,057 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 21:05:55,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:05:55,058 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 21:05:55,081 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 21:05:55,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 21:05:55,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:05:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 21:05:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:05:55,082 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 21:05:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:55,992 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 21:05:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 21:05:55,992 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 21:05:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:05:55,992 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 21:05:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-27 21:05:55,994 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 21:05:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-27 21:05:55,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-27 21:05:56,048 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 21:05:56,049 INFO L225 Difference]: With dead ends: 37 [2022-04-27 21:05:56,049 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 21:05:56,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-04-27 21:05:56,050 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 21:05:56,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 91 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 22 Unchecked, 0.3s Time] [2022-04-27 21:05:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 21:05:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-04-27 21:05:56,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:05:56,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 21:05:56,054 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 21:05:56,054 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 21:05:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:56,055 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-27 21:05:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-27 21:05:56,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:56,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:56,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 31 states. [2022-04-27 21:05:56,056 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 31 states. [2022-04-27 21:05:56,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:05:56,057 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-27 21:05:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-27 21:05:56,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:05:56,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:05:56,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:05:56,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:05:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 21:05:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-27 21:05:56,059 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2022-04-27 21:05:56,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:05:56,059 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-27 21:05:56,059 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 21:05:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 21:05:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:05:56,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:05:56,060 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 21:05:56,089 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 21:05:56,260 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 21:05:56,260 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:05:56,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:05:56,261 INFO L85 PathProgramCache]: Analyzing trace with hash 793901262, now seen corresponding path program 1 times [2022-04-27 21:05:56,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:05:56,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723340968] [2022-04-27 21:05:56,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:56,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:05:56,272 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:05:56,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [234346732] [2022-04-27 21:05:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:05:56,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:05:56,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:05:56,273 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 21:05:56,274 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 21:05:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:56,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 21:05:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:05:56,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:05:56,371 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 11 treesize of output 7 [2022-04-27 21:05:56,447 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 21:05:56,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 21:05:56,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {783#true} is VALID [2022-04-27 21:05:56,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 21:05:56,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 21:05:56,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 21:05:56,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {803#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 21:05:56,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {803#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {807#(and (= main_~k~0 0) (= main_~j~0 0))} is VALID [2022-04-27 21:05:56,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {807#(and (= main_~k~0 0) (= main_~j~0 0))} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {811#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|)} is VALID [2022-04-27 21:05:56,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {811#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|)} [75] L26-->L22-2: Formula: (not (<= v_main_~maior~0_6 |v_main_#t~mem8_5|)) InVars {main_~maior~0=v_main_~maior~0_6, main_#t~mem8=|v_main_#t~mem8_5|} OutVars{main_~maior~0=v_main_~maior~0_6} AuxVars[] AssignedVars[main_#t~mem8] {815#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:56,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {815#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {815#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:56,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {815#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {815#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:56,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {815#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {815#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:56,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {815#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {815#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:05:56,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {815#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {831#(< |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 21:05:56,527 INFO L272 TraceCheckUtils]: 14: Hoare triple {831#(< |main_#t~mem10| main_~maior~0)} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {835#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:05:56,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {835#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {839#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:05:56,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {839#(<= 1 __VERIFIER_assert_~cond)} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {784#false} is VALID [2022-04-27 21:05:56,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {784#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#false} is VALID [2022-04-27 21:05:56,528 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 21:05:56,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:05:56,732 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 21:05:56,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 46 treesize of output 44 [2022-04-27 21:06:02,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {784#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {784#false} is VALID [2022-04-27 21:06:02,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {839#(<= 1 __VERIFIER_assert_~cond)} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {784#false} is VALID [2022-04-27 21:06:02,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {835#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {839#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:06:02,802 INFO L272 TraceCheckUtils]: 14: Hoare triple {855#(<= |main_#t~mem10| main_~maior~0)} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {835#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:06:02,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {859#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {855#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 21:06:02,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {859#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {859#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:02,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {859#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {859#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:02,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {859#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {859#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:02,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {859#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {859#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:02,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {875#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1))} [75] L26-->L22-2: Formula: (not (<= v_main_~maior~0_6 |v_main_#t~mem8_5|)) InVars {main_~maior~0=v_main_~maior~0_6, main_#t~mem8=|v_main_#t~mem8_5|} OutVars{main_~maior~0=v_main_~maior~0_6} AuxVars[] AssignedVars[main_#t~mem8] {859#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:02,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {879#(forall ((aux_mod_main_~N_LIN~0_30 Int)) (or (>= aux_mod_main_~N_LIN~0_30 4294967296) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* aux_mod_main_~N_LIN~0_30 (mod main_~j~0 4294967296)) 4)) 0) (> 0 aux_mod_main_~N_LIN~0_30)))} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {875#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1))} is VALID [2022-04-27 21:06:02,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {883#(or (forall ((aux_mod_main_~N_LIN~0_30 Int)) (or (= (* (* aux_mod_main_~N_LIN~0_30 (mod main_~j~0 4294967296)) 4) 0) (>= aux_mod_main_~N_LIN~0_30 4294967296) (> 0 aux_mod_main_~N_LIN~0_30))) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {879#(forall ((aux_mod_main_~N_LIN~0_30 Int)) (or (>= aux_mod_main_~N_LIN~0_30 4294967296) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* aux_mod_main_~N_LIN~0_30 (mod main_~j~0 4294967296)) 4)) 0) (> 0 aux_mod_main_~N_LIN~0_30)))} is VALID [2022-04-27 21:06:02,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {883#(or (forall ((aux_mod_main_~N_LIN~0_30 Int)) (or (= (* (* aux_mod_main_~N_LIN~0_30 (mod main_~j~0 4294967296)) 4) 0) (>= aux_mod_main_~N_LIN~0_30 4294967296) (> 0 aux_mod_main_~N_LIN~0_30))) (not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296))))} is VALID [2022-04-27 21:06:02,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 21:06:02,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 21:06:02,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 21:06:02,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {783#true} is VALID [2022-04-27 21:06:02,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {783#true} is VALID [2022-04-27 21:06:02,810 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 21:06:02,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:06:02,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723340968] [2022-04-27 21:06:02,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:06:02,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234346732] [2022-04-27 21:06:02,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234346732] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:06:02,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 21:06:02,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-27 21:06:02,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294252140] [2022-04-27 21:06:02,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 21:06:02,811 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 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 21:06:02,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:06:02,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 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 21:06:02,834 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 21:06:02,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 21:06:02,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:06:02,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 21:06:02,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:06:02,835 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 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 21:06:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:03,709 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 21:06:03,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 21:06:03,710 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 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 21:06:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:06:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 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 21:06:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-27 21:06:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 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 21:06:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-04-27 21:06:03,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2022-04-27 21:06:03,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:06:03,742 INFO L225 Difference]: With dead ends: 34 [2022-04-27 21:06:03,742 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 21:06:03,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-27 21:06:03,744 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:06:03,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 149 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-04-27 21:06:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 21:06:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-04-27 21:06:03,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:06:03,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 21:06:03,751 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 21:06:03,751 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 21:06:03,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:03,752 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-27 21:06:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-27 21:06:03,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:03,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:03,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 28 states. [2022-04-27 21:06:03,752 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 28 states. [2022-04-27 21:06:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:03,753 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-27 21:06:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-27 21:06:03,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:03,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:03,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:06:03,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:06:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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 21:06:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-27 21:06:03,754 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2022-04-27 21:06:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:06:03,754 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-27 21:06:03,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 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 21:06:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 21:06:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 21:06:03,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:06:03,755 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:06:03,777 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 21:06:03,974 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 21:06:03,974 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:06:03,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:06:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 859818324, now seen corresponding path program 2 times [2022-04-27 21:06:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:06:03,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241097856] [2022-04-27 21:06:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:06:03,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:06:03,989 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:06:03,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101588516] [2022-04-27 21:06:03,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:06:03,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:06:03,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:06:04,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:06:04,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 21:06:04,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:06:04,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:06:04,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 21:06:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:06:04,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:06:04,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {1054#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#true} is VALID [2022-04-27 21:06:04,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {1054#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1054#true} is VALID [2022-04-27 21:06:04,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {1054#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#true} is VALID [2022-04-27 21:06:04,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1054#true} {1054#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#true} is VALID [2022-04-27 21:06:04,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {1054#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#true} is VALID [2022-04-27 21:06:04,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {1054#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {1074#(= main_~N_LIN~0 1)} is VALID [2022-04-27 21:06:04,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {1074#(= main_~N_LIN~0 1)} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1078#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:04,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {1078#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1078#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:04,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {1078#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (mod v_main_~k~0_5 4294967296) 4) (* (mod v_main_~j~0_6 4294967296) (* (mod v_main_~N_LIN~0_4 4294967296) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {1078#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:04,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {1078#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1088#(and (= main_~k~0 1) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:04,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {1088#(and (= main_~k~0 1) (= main_~N_LIN~0 1))} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1055#false} is VALID [2022-04-27 21:06:04,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {1055#false} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (mod v_main_~k~0_5 4294967296) 4) (* (mod v_main_~j~0_6 4294967296) (* (mod v_main_~N_LIN~0_4 4294967296) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {1055#false} is VALID [2022-04-27 21:06:04,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {1055#false} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1055#false} is VALID [2022-04-27 21:06:04,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {1055#false} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1055#false} is VALID [2022-04-27 21:06:04,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {1055#false} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1055#false} is VALID [2022-04-27 21:06:04,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {1055#false} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1055#false} is VALID [2022-04-27 21:06:04,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {1055#false} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {1055#false} is VALID [2022-04-27 21:06:04,164 INFO L272 TraceCheckUtils]: 17: Hoare triple {1055#false} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {1055#false} is VALID [2022-04-27 21:06:04,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {1055#false} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1055#false} is VALID [2022-04-27 21:06:04,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {1055#false} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1055#false} is VALID [2022-04-27 21:06:04,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {1055#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1055#false} is VALID [2022-04-27 21:06:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:06:04,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:06:04,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {1055#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1055#false} is VALID [2022-04-27 21:06:04,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {1055#false} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1055#false} is VALID [2022-04-27 21:06:04,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {1055#false} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1055#false} is VALID [2022-04-27 21:06:04,294 INFO L272 TraceCheckUtils]: 17: Hoare triple {1055#false} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {1055#false} is VALID [2022-04-27 21:06:04,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {1055#false} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {1055#false} is VALID [2022-04-27 21:06:04,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {1055#false} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1055#false} is VALID [2022-04-27 21:06:04,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {1055#false} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1055#false} is VALID [2022-04-27 21:06:04,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {1055#false} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1055#false} is VALID [2022-04-27 21:06:04,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {1055#false} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1055#false} is VALID [2022-04-27 21:06:04,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {1055#false} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (mod v_main_~k~0_5 4294967296) 4) (* (mod v_main_~j~0_6 4294967296) (* (mod v_main_~N_LIN~0_4 4294967296) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {1055#false} is VALID [2022-04-27 21:06:04,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {1152#(not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)))} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1055#false} is VALID [2022-04-27 21:06:04,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {1156#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1152#(not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 21:06:04,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {1156#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (mod v_main_~k~0_5 4294967296) 4) (* (mod v_main_~j~0_6 4294967296) (* (mod v_main_~N_LIN~0_4 4294967296) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {1156#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 21:06:04,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {1156#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1156#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 21:06:04,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {1166#(not (< 1 (mod main_~N_LIN~0 4294967296)))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1156#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 21:06:04,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {1054#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {1166#(not (< 1 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-27 21:06:04,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {1054#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#true} is VALID [2022-04-27 21:06:04,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1054#true} {1054#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#true} is VALID [2022-04-27 21:06:04,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {1054#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#true} is VALID [2022-04-27 21:06:04,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {1054#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1054#true} is VALID [2022-04-27 21:06:04,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {1054#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#true} is VALID [2022-04-27 21:06:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:06:04,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:06:04,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241097856] [2022-04-27 21:06:04,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:06:04,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101588516] [2022-04-27 21:06:04,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101588516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:06:04,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 21:06:04,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 21:06:04,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857565891] [2022-04-27 21:06:04,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 21:06:04,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 21 [2022-04-27 21:06:04,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:06:04,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 21:06:04,322 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 21:06:04,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:06:04,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:06:04,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:06:04,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:06:04,323 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 21:06:04,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:04,387 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-27 21:06:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 21:06:04,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 21 [2022-04-27 21:06:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:06:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 21:06:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 21:06:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 21:06:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-27 21:06:04,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-27 21:06:04,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:06:04,414 INFO L225 Difference]: With dead ends: 40 [2022-04-27 21:06:04,414 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 21:06:04,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:06:04,415 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:06:04,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 48 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:06:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 21:06:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-27 21:06:04,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:06:04,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 21:06:04,422 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 21:06:04,422 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 21:06:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:04,422 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-27 21:06:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-27 21:06:04,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:04,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:04,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 26 states. [2022-04-27 21:06:04,423 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 26 states. [2022-04-27 21:06:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:04,424 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-27 21:06:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-27 21:06:04,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:04,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:04,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:06:04,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:06:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 21:06:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-27 21:06:04,425 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-04-27 21:06:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:06:04,425 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-27 21:06:04,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 21:06:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-27 21:06:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 21:06:04,426 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:06:04,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:06:04,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 21:06:04,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:06:04,639 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:06:04,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:06:04,640 INFO L85 PathProgramCache]: Analyzing trace with hash 880606810, now seen corresponding path program 3 times [2022-04-27 21:06:04,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:06:04,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014036326] [2022-04-27 21:06:04,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:06:04,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:06:04,654 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:06:04,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1800946240] [2022-04-27 21:06:04,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 21:06:04,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:06:04,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:06:04,669 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:06:04,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 21:06:04,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 21:06:04,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:06:04,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 21:06:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:06:04,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:06:04,802 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 21:06:06,077 INFO L356 Elim1Store]: treesize reduction 60, result has 47.4 percent of original size [2022-04-27 21:06:06,077 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 1 case distinctions, treesize of input 49 treesize of output 80 [2022-04-27 21:06:27,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 21:06:27,749 INFO L356 Elim1Store]: treesize reduction 28, result has 44.0 percent of original size [2022-04-27 21:06:27,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 31 [2022-04-27 21:06:27,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {1337#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1337#true} is VALID [2022-04-27 21:06:27,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {1337#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1337#true} is VALID [2022-04-27 21:06:27,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {1337#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1337#true} is VALID [2022-04-27 21:06:27,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1337#true} {1337#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1337#true} is VALID [2022-04-27 21:06:27,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {1337#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1337#true} is VALID [2022-04-27 21:06:27,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {1337#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {1357#(and (= main_~N_COL~0 1) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:27,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {1357#(and (= main_~N_COL~0 1) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1361#(and (< (mod main_~j~0 4294967296) 1) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:27,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {1361#(and (< (mod main_~j~0 4294967296) 1) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1365#(and (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (< (mod main_~j~0 4294967296) 1) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:27,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {1365#(and (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (< (mod main_~j~0 4294967296) 1) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (mod v_main_~k~0_5 4294967296) 4) (* (mod v_main_~j~0_6 4294967296) (* (mod v_main_~N_LIN~0_4 4294967296) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {1369#(and (exists ((aux_mod_main_~j~0_26 Int) (aux_mod_main_~k~0_26 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod aux_mod_main_~j~0_26 4294967296)) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 (mod main_~N_LIN~0 4294967296)) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:27,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {1369#(and (exists ((aux_mod_main_~j~0_26 Int) (aux_mod_main_~k~0_26 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod aux_mod_main_~j~0_26 4294967296)) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 (mod main_~N_LIN~0 4294967296)) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1369#(and (exists ((aux_mod_main_~j~0_26 Int) (aux_mod_main_~k~0_26 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod aux_mod_main_~j~0_26 4294967296)) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 (mod main_~N_LIN~0 4294967296)) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:27,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {1369#(and (exists ((aux_mod_main_~j~0_26 Int) (aux_mod_main_~k~0_26 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod aux_mod_main_~j~0_26 4294967296)) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 (mod main_~N_LIN~0 4294967296)) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1369#(and (exists ((aux_mod_main_~j~0_26 Int) (aux_mod_main_~k~0_26 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod aux_mod_main_~j~0_26 4294967296)) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 (mod main_~N_LIN~0 4294967296)) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:27,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {1369#(and (exists ((aux_mod_main_~j~0_26 Int) (aux_mod_main_~k~0_26 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod aux_mod_main_~j~0_26 4294967296)) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 (mod main_~N_LIN~0 4294967296)) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1369#(and (exists ((aux_mod_main_~j~0_26 Int) (aux_mod_main_~k~0_26 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod aux_mod_main_~j~0_26 4294967296)) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 (mod main_~N_LIN~0 4294967296)) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:27,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {1369#(and (exists ((aux_mod_main_~j~0_26 Int) (aux_mod_main_~k~0_26 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod aux_mod_main_~j~0_26 4294967296)) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 (mod main_~N_LIN~0 4294967296)) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1369#(and (exists ((aux_mod_main_~j~0_26 Int) (aux_mod_main_~k~0_26 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod aux_mod_main_~j~0_26 4294967296)) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 (mod main_~N_LIN~0 4294967296)) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:27,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {1369#(and (exists ((aux_mod_main_~j~0_26 Int) (aux_mod_main_~k~0_26 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod aux_mod_main_~j~0_26 4294967296)) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 (mod main_~N_LIN~0 4294967296)) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1385#(and (<= |main_#t~mem8| (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|))) (exists ((aux_mod_main_~j~0_26 Int) (aux_mod_main_~k~0_26 Int)) (and (<= 0 aux_mod_main_~j~0_26) (< aux_mod_main_~k~0_26 (mod main_~N_LIN~0 4294967296)) (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod aux_mod_main_~j~0_26 4294967296)) |main_~#matriz~0.offset|)) main_~maior~0) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod aux_mod_main_~j~0_26 4294967296)) 4)))) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} is VALID [2022-04-27 21:06:28,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {1385#(and (<= |main_#t~mem8| (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|))) (exists ((aux_mod_main_~j~0_26 Int) (aux_mod_main_~k~0_26 Int)) (and (<= 0 aux_mod_main_~j~0_26) (< aux_mod_main_~k~0_26 (mod main_~N_LIN~0 4294967296)) (or (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) 4) (mod aux_mod_main_~j~0_26 4294967296)) |main_~#matriz~0.offset|)) main_~maior~0) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) (+ (* (mod aux_mod_main_~k~0_26 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod aux_mod_main_~j~0_26 4294967296)) 4)))) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))) (= 0 |main_~#matriz~0.offset|) (= main_~N_LIN~0 1))} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (mod v_main_~k~0_5 4294967296) 4) (* (mod v_main_~j~0_6 4294967296) (* (mod v_main_~N_LIN~0_4 4294967296) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {1389#(and (= 0 |main_~#matriz~0.offset|) (exists ((aux_mod_main_~j~0_26 Int) (main_~j~0 Int) (aux_mod_main_~k~0_26 Int) (main_~k~0 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~j~0_26 4294967296) 4) (* (mod aux_mod_main_~k~0_26 4294967296) 4) |main_~#matriz~0.offset|)) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 1) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))))} is VALID [2022-04-27 21:06:28,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {1389#(and (= 0 |main_~#matriz~0.offset|) (exists ((aux_mod_main_~j~0_26 Int) (main_~j~0 Int) (aux_mod_main_~k~0_26 Int) (main_~k~0 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~j~0_26 4294967296) 4) (* (mod aux_mod_main_~k~0_26 4294967296) 4) |main_~#matriz~0.offset|)) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 1) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))))} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1389#(and (= 0 |main_~#matriz~0.offset|) (exists ((aux_mod_main_~j~0_26 Int) (main_~j~0 Int) (aux_mod_main_~k~0_26 Int) (main_~k~0 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~j~0_26 4294967296) 4) (* (mod aux_mod_main_~k~0_26 4294967296) 4) |main_~#matriz~0.offset|)) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 1) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))))} is VALID [2022-04-27 21:06:28,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {1389#(and (= 0 |main_~#matriz~0.offset|) (exists ((aux_mod_main_~j~0_26 Int) (main_~j~0 Int) (aux_mod_main_~k~0_26 Int) (main_~k~0 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~j~0_26 4294967296) 4) (* (mod aux_mod_main_~k~0_26 4294967296) 4) |main_~#matriz~0.offset|)) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 1) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))))} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1389#(and (= 0 |main_~#matriz~0.offset|) (exists ((aux_mod_main_~j~0_26 Int) (main_~j~0 Int) (aux_mod_main_~k~0_26 Int) (main_~k~0 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~j~0_26 4294967296) 4) (* (mod aux_mod_main_~k~0_26 4294967296) 4) |main_~#matriz~0.offset|)) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 1) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))))} is VALID [2022-04-27 21:06:28,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {1389#(and (= 0 |main_~#matriz~0.offset|) (exists ((aux_mod_main_~j~0_26 Int) (main_~j~0 Int) (aux_mod_main_~k~0_26 Int) (main_~k~0 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~j~0_26 4294967296) 4) (* (mod aux_mod_main_~k~0_26 4294967296) 4) |main_~#matriz~0.offset|)) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 1) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))))} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1389#(and (= 0 |main_~#matriz~0.offset|) (exists ((aux_mod_main_~j~0_26 Int) (main_~j~0 Int) (aux_mod_main_~k~0_26 Int) (main_~k~0 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~j~0_26 4294967296) 4) (* (mod aux_mod_main_~k~0_26 4294967296) 4) |main_~#matriz~0.offset|)) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 1) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))))} is VALID [2022-04-27 21:06:28,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {1389#(and (= 0 |main_~#matriz~0.offset|) (exists ((aux_mod_main_~j~0_26 Int) (main_~j~0 Int) (aux_mod_main_~k~0_26 Int) (main_~k~0 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~j~0_26 4294967296) 4) (* (mod aux_mod_main_~k~0_26 4294967296) 4) |main_~#matriz~0.offset|)) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 1) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))))} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1389#(and (= 0 |main_~#matriz~0.offset|) (exists ((aux_mod_main_~j~0_26 Int) (main_~j~0 Int) (aux_mod_main_~k~0_26 Int) (main_~k~0 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~j~0_26 4294967296) 4) (* (mod aux_mod_main_~k~0_26 4294967296) 4) |main_~#matriz~0.offset|)) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 1) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))))} is VALID [2022-04-27 21:06:28,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {1389#(and (= 0 |main_~#matriz~0.offset|) (exists ((aux_mod_main_~j~0_26 Int) (main_~j~0 Int) (aux_mod_main_~k~0_26 Int) (main_~k~0 Int)) (and (<= 0 aux_mod_main_~j~0_26) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod aux_mod_main_~j~0_26 4294967296) 4) (* (mod aux_mod_main_~k~0_26 4294967296) 4) |main_~#matriz~0.offset|)) (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|))) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~j~0 4294967296) 4) (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (< aux_mod_main_~k~0_26 1) (< aux_mod_main_~j~0_26 1) (<= 0 aux_mod_main_~k~0_26))))} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {1405#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 21:06:28,010 INFO L272 TraceCheckUtils]: 20: Hoare triple {1405#(<= |main_#t~mem10| main_~maior~0)} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:06:28,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1413#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:06:28,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {1413#(<= 1 __VERIFIER_assert_~cond)} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1338#false} is VALID [2022-04-27 21:06:28,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {1338#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1338#false} is VALID [2022-04-27 21:06:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 21:06:28,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:06:29,385 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 21:06:29,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 42 [2022-04-27 21:06:31,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {1338#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1338#false} is VALID [2022-04-27 21:06:31,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {1413#(<= 1 __VERIFIER_assert_~cond)} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1338#false} is VALID [2022-04-27 21:06:31,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1413#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:06:31,771 INFO L272 TraceCheckUtils]: 20: Hoare triple {1405#(<= |main_#t~mem10| main_~maior~0)} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:06:31,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {1405#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-27 21:06:31,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:31,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:31,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:31,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:31,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {1448#(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 (<= main_~maior~0 |main_#t~mem8|)))} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (mod v_main_~k~0_5 4294967296) 4) (* (mod v_main_~j~0_6 4294967296) (* (mod v_main_~N_LIN~0_4 4294967296) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:31,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1448#(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 (<= main_~maior~0 |main_#t~mem8|)))} is VALID [2022-04-27 21:06:31,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:31,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:31,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:31,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:31,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {1467#(<= (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|)))} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (mod v_main_~k~0_5 4294967296) 4) (* (mod v_main_~j~0_6 4294967296) (* (mod v_main_~N_LIN~0_4 4294967296) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {1432#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-27 21:06:31,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#(<= (div (+ (* (- 1) (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) (* (- 1) (mod main_~N_LIN~0 4294967296)) 1) (- 4294967296)) 0)} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1467#(<= (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|)))} is VALID [2022-04-27 21:06:31,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {1475#(forall ((aux_div_aux_mod_main_~j~0_26_37 Int) (aux_mod_aux_mod_main_~j~0_26_37 Int)) (or (<= (mod main_~N_COL~0 4294967296) aux_mod_aux_mod_main_~j~0_26_37) (<= (div (+ (* (- 1) (mod main_~N_LIN~0 4294967296) aux_mod_aux_mod_main_~j~0_26_37) (* aux_div_aux_mod_main_~j~0_26_37 (mod main_~N_LIN~0 4294967296) (- 4294967296)) (* (- 1) (mod main_~N_LIN~0 4294967296)) 1) (- 4294967296)) 0) (<= 4294967296 (+ aux_mod_aux_mod_main_~j~0_26_37 (* aux_div_aux_mod_main_~j~0_26_37 4294967296))) (< aux_mod_aux_mod_main_~j~0_26_37 0)))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1471#(<= (div (+ (* (- 1) (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) (* (- 1) (mod main_~N_LIN~0 4294967296)) 1) (- 4294967296)) 0)} is VALID [2022-04-27 21:06:31,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {1337#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {1475#(forall ((aux_div_aux_mod_main_~j~0_26_37 Int) (aux_mod_aux_mod_main_~j~0_26_37 Int)) (or (<= (mod main_~N_COL~0 4294967296) aux_mod_aux_mod_main_~j~0_26_37) (<= (div (+ (* (- 1) (mod main_~N_LIN~0 4294967296) aux_mod_aux_mod_main_~j~0_26_37) (* aux_div_aux_mod_main_~j~0_26_37 (mod main_~N_LIN~0 4294967296) (- 4294967296)) (* (- 1) (mod main_~N_LIN~0 4294967296)) 1) (- 4294967296)) 0) (<= 4294967296 (+ aux_mod_aux_mod_main_~j~0_26_37 (* aux_div_aux_mod_main_~j~0_26_37 4294967296))) (< aux_mod_aux_mod_main_~j~0_26_37 0)))} is VALID [2022-04-27 21:06:31,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {1337#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1337#true} is VALID [2022-04-27 21:06:31,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1337#true} {1337#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1337#true} is VALID [2022-04-27 21:06:31,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {1337#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1337#true} is VALID [2022-04-27 21:06:31,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {1337#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1337#true} is VALID [2022-04-27 21:06:31,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {1337#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1337#true} is VALID [2022-04-27 21:06:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 21:06:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:06:31,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014036326] [2022-04-27 21:06:31,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:06:31,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800946240] [2022-04-27 21:06:31,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800946240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:06:31,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 21:06:31,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2022-04-27 21:06:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479716725] [2022-04-27 21:06:31,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 21:06:31,808 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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 24 [2022-04-27 21:06:31,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:06:31,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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 21:06:32,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:06:32,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 21:06:32,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:06:32,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 21:06:32,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-27 21:06:32,031 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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 21:06:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:33,831 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-27 21:06:33,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 21:06:33,831 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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 24 [2022-04-27 21:06:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:06:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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 21:06:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-04-27 21:06:33,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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 21:06:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-04-27 21:06:33,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 51 transitions. [2022-04-27 21:06:33,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:06:33,976 INFO L225 Difference]: With dead ends: 49 [2022-04-27 21:06:33,976 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 21:06:33,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-04-27 21:06:33,977 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 21:06:33,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 108 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 64 Unchecked, 0.6s Time] [2022-04-27 21:06:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 21:06:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-04-27 21:06:34,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:06:34,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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 21:06:34,004 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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 21:06:34,004 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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 21:06:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:34,005 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 21:06:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 21:06:34,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:34,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:34,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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 42 states. [2022-04-27 21:06:34,007 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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 42 states. [2022-04-27 21:06:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:34,008 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 21:06:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 21:06:34,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:34,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:34,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:06:34,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:06:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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 21:06:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 21:06:34,012 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 24 [2022-04-27 21:06:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:06:34,014 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 21:06:34,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 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 21:06:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 21:06:34,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 21:06:34,014 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:06:34,015 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:06:34,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 21:06:34,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:06:34,236 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:06:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:06:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash 684093305, now seen corresponding path program 1 times [2022-04-27 21:06:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:06:34,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133871130] [2022-04-27 21:06:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:06:34,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:06:34,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:06:34,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [669106807] [2022-04-27 21:06:34,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:06:34,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:06:34,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:06:34,253 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:06:34,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 21:06:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:06:34,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 21:06:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:06:34,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:06:34,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {1708#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1708#true} is VALID [2022-04-27 21:06:34,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {1708#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1708#true} is VALID [2022-04-27 21:06:34,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {1708#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1708#true} is VALID [2022-04-27 21:06:34,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1708#true} {1708#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1708#true} is VALID [2022-04-27 21:06:34,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {1708#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1708#true} is VALID [2022-04-27 21:06:34,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {1708#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {1728#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 21:06:34,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {1728#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1728#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 21:06:34,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {1728#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1728#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 21:06:34,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {1728#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (mod v_main_~k~0_5 4294967296) 4) (* (mod v_main_~j~0_6 4294967296) (* (mod v_main_~N_LIN~0_4 4294967296) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {1728#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 21:06:34,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {1728#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1728#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 21:06:34,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {1728#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1728#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-27 21:06:34,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {1728#(and (= main_~N_COL~0 1) (= main_~j~0 0))} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1747#(and (= main_~j~0 1) (= main_~N_COL~0 1))} is VALID [2022-04-27 21:06:34,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {1747#(and (= main_~j~0 1) (= main_~N_COL~0 1))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1709#false} is VALID [2022-04-27 21:06:34,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {1709#false} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1709#false} is VALID [2022-04-27 21:06:34,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {1709#false} [75] L26-->L22-2: Formula: (not (<= v_main_~maior~0_6 |v_main_#t~mem8_5|)) InVars {main_~maior~0=v_main_~maior~0_6, main_#t~mem8=|v_main_#t~mem8_5|} OutVars{main_~maior~0=v_main_~maior~0_6} AuxVars[] AssignedVars[main_#t~mem8] {1709#false} is VALID [2022-04-27 21:06:34,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {1709#false} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1709#false} is VALID [2022-04-27 21:06:34,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {1709#false} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1709#false} is VALID [2022-04-27 21:06:34,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {1709#false} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1709#false} is VALID [2022-04-27 21:06:34,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {1709#false} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1709#false} is VALID [2022-04-27 21:06:34,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {1709#false} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {1709#false} is VALID [2022-04-27 21:06:34,404 INFO L272 TraceCheckUtils]: 20: Hoare triple {1709#false} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {1709#false} is VALID [2022-04-27 21:06:34,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {1709#false} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1709#false} is VALID [2022-04-27 21:06:34,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {1709#false} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1709#false} is VALID [2022-04-27 21:06:34,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {1709#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1709#false} is VALID [2022-04-27 21:06:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:06:34,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:06:34,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {1709#false} [82] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1709#false} is VALID [2022-04-27 21:06:34,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {1709#false} [80] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1709#false} is VALID [2022-04-27 21:06:34,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {1709#false} [77] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1709#false} is VALID [2022-04-27 21:06:34,491 INFO L272 TraceCheckUtils]: 20: Hoare triple {1709#false} [72] L30-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem10_4| v_main_~maior~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~maior~0=v_main_~maior~0_7, main_#t~mem10=|v_main_#t~mem10_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem10, main_~maior~0] {1709#false} is VALID [2022-04-27 21:06:34,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {1709#false} [68] L21-4-->L30: Formula: (= (select (select |v_#memory_int_1| |v_main_~#matriz~0.base_1|) |v_main_~#matriz~0.offset_1|) |v_main_#t~mem10_1|) InVars {main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|} OutVars{main_~#matriz~0.offset=|v_main_~#matriz~0.offset_1|, #memory_int=|v_#memory_int_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_1|, main_#t~mem10=|v_main_#t~mem10_1|} AuxVars[] AssignedVars[main_#t~mem10] {1709#false} is VALID [2022-04-27 21:06:34,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {1709#false} [66] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_3 4294967296) (mod v_main_~N_COL~0_2 4294967296))) InVars {main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} OutVars{main_~N_COL~0=v_main_~N_COL~0_2, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1709#false} is VALID [2022-04-27 21:06:34,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {1709#false} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1709#false} is VALID [2022-04-27 21:06:34,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {1709#false} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1709#false} is VALID [2022-04-27 21:06:34,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {1709#false} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1709#false} is VALID [2022-04-27 21:06:34,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {1709#false} [75] L26-->L22-2: Formula: (not (<= v_main_~maior~0_6 |v_main_#t~mem8_5|)) InVars {main_~maior~0=v_main_~maior~0_6, main_#t~mem8=|v_main_#t~mem8_5|} OutVars{main_~maior~0=v_main_~maior~0_6} AuxVars[] AssignedVars[main_#t~mem8] {1709#false} is VALID [2022-04-27 21:06:34,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {1709#false} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1709#false} is VALID [2022-04-27 21:06:34,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {1817#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1709#false} is VALID [2022-04-27 21:06:34,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {1821#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [73] L21-2-->L21-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1817#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 21:06:34,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {1821#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [70] L22-3-->L21-2: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~N_LIN~0_2 4294967296))) InVars {main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} OutVars{main_~N_LIN~0=v_main_~N_LIN~0_2, main_~k~0=v_main_~k~0_3} AuxVars[] AssignedVars[] {1821#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 21:06:34,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {1821#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [78] L22-2-->L22-3: Formula: (= v_main_~k~0_6 (+ v_main_~k~0_7 1)) InVars {main_~k~0=v_main_~k~0_7} OutVars{main_~k~0=v_main_~k~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~k~0, main_#t~post6] {1821#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 21:06:34,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {1821#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [74] L26-->L22-2: Formula: (and (<= v_main_~maior~0_5 |v_main_#t~mem8_3|) (= (select (select |v_#memory_int_4| |v_main_~#matriz~0.base_6|) (+ (* (mod v_main_~k~0_5 4294967296) 4) (* (mod v_main_~j~0_6 4294967296) (* (mod v_main_~N_LIN~0_4 4294967296) 4)) |v_main_~#matriz~0.offset_6|)) v_main_~maior~0_4)) InVars {main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_~maior~0=v_main_~maior~0_5, main_#t~mem8=|v_main_#t~mem8_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_6|, main_~N_LIN~0=v_main_~N_LIN~0_4, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_6, main_~maior~0=v_main_~maior~0_4, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_6|, #memory_int=|v_#memory_int_4|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_~maior~0, main_#t~mem8, main_#t~mem9] {1821#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 21:06:34,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {1821#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [71] L22-3-->L26: Formula: (let ((.cse1 (mod v_main_~N_LIN~0_3 4294967296)) (.cse0 (mod v_main_~k~0_4 4294967296))) (let ((.cse2 (+ (* (* .cse1 4) (mod v_main_~j~0_5 4294967296)) |v_main_~#matriz~0.offset_5| (* .cse0 4)))) (and (< .cse0 .cse1) (= (store |v_#memory_int_3| |v_main_~#matriz~0.base_5| (store (select |v_#memory_int_3| |v_main_~#matriz~0.base_5|) .cse2 |v_main_#t~nondet7_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= |v_main_#t~mem8_1| (select (select |v_#memory_int_2| |v_main_~#matriz~0.base_5|) .cse2))))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_3|} OutVars{main_~#matriz~0.base=|v_main_~#matriz~0.base_5|, main_~N_LIN~0=v_main_~N_LIN~0_3, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_5, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_5|, #memory_int=|v_#memory_int_2|, main_#t~mem8=|v_main_#t~mem8_1|} AuxVars[] AssignedVars[main_#t~nondet7, #memory_int, main_#t~mem8] {1821#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 21:06:34,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {1821#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} [67] L21-3-->L22-3: Formula: (and (< (mod v_main_~j~0_4 4294967296) (mod v_main_~N_COL~0_3 4294967296)) (= v_main_~k~0_2 0)) InVars {main_~N_COL~0=v_main_~N_COL~0_3, main_~j~0=v_main_~j~0_4} OutVars{main_~N_COL~0=v_main_~N_COL~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1821#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 21:06:34,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {1708#true} [63] mainENTRY-->L21-3: Formula: (and (< |v_#StackHeapBarrier_1| |v_main_~#matriz~0.base_2|) (= |v_main_~#matriz~0.offset_2| 0) (= v_main_~j~0_1 0) (= |v_main_#t~nondet4_2| v_main_~maior~0_1) (= v_main_~N_COL~0_1 1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= (select |v_#valid_2| |v_main_~#matriz~0.base_2|) 0) (not (= |v_main_~#matriz~0.base_2| 0)) (= (store |v_#valid_2| |v_main_~#matriz~0.base_2| 1) |v_#valid_1|) (= v_main_~N_LIN~0_1 1) (= |v_#length_1| (store |v_#length_2| |v_main_~#matriz~0.base_2| (* (mod v_main_~N_COL~0_1 4294967296) (* (mod v_main_~N_LIN~0_1 4294967296) 4))))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#matriz~0.base=|v_main_~#matriz~0.base_2|, main_~N_LIN~0=v_main_~N_LIN~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, #valid=|v_#valid_1|, main_~maior~0=v_main_~maior~0_1, main_~#matriz~0.offset=|v_main_~#matriz~0.offset_2|, #length=|v_#length_1|, main_~N_COL~0=v_main_~N_COL~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~#matriz~0.base, main_~N_LIN~0, main_~k~0, main_~j~0, #valid, main_~maior~0, main_~#matriz~0.offset, #length, main_~N_COL~0] {1821#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-27 21:06:34,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {1708#true} [60] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1708#true} is VALID [2022-04-27 21:06:34,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1708#true} {1708#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1708#true} is VALID [2022-04-27 21:06:34,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {1708#true} [64] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1708#true} is VALID [2022-04-27 21:06:34,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {1708#true} [61] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= (select |v_#length_3| 2) 11) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1708#true} is VALID [2022-04-27 21:06:34,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {1708#true} [59] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1708#true} is VALID [2022-04-27 21:06:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 21:06:34,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:06:34,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133871130] [2022-04-27 21:06:34,508 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:06:34,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669106807] [2022-04-27 21:06:34,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669106807] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:06:34,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 21:06:34,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-27 21:06:34,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949666429] [2022-04-27 21:06:34,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 21:06:34,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 24 [2022-04-27 21:06:34,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:06:34,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 21:06:34,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:06:34,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:06:34,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:06:34,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:06:34,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:06:34,541 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 21:06:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:34,593 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-27 21:06:34,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:06:34,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 24 [2022-04-27 21:06:34,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:06:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 21:06:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-27 21:06:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 21:06:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-27 21:06:34,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-27 21:06:34,613 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 21:06:34,613 INFO L225 Difference]: With dead ends: 35 [2022-04-27 21:06:34,613 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:06:34,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 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 21:06:34,614 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 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 21:06:34,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:06:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:06:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:06:34,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:06:34,615 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 21:06:34,615 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 21:06:34,615 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 21:06:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:34,615 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:06:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:06:34,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:34,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:34,615 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 21:06:34,616 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 21:06:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:06:34,616 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:06:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:06:34,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:34,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:06:34,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:06:34,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:06:34,616 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 21:06:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:06:34,616 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-27 21:06:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:06:34,616 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:06:34,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 21:06:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:06:34,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:06:34,618 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:06:34,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 21:06:34,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-27 21:06:34,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:06:34,973 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:06:34,974 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:06:34,974 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:06:34,974 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:06:34,974 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:06:34,974 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:06:34,974 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:06:34,974 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 33) the Hoare annotation is: true [2022-04-27 21:06:34,974 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 28) the Hoare annotation is: (let ((.cse0 (= main_~N_COL~0 1)) (.cse1 (= main_~N_LIN~0 1))) (or (and .cse0 (= main_~j~0 0) (= 0 |main_~#matriz~0.offset|) .cse1) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= main_~j~0 1) .cse0 (= main_~k~0 1) .cse1))) [2022-04-27 21:06:34,974 INFO L899 garLoopResultBuilder]: For program point L21-4(lines 21 28) no Hoare annotation was computed. [2022-04-27 21:06:34,974 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 (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) .cse0 .cse1 (= main_~k~0 1) .cse2) (and (= main_~k~0 0) .cse0 .cse1 (= 0 |main_~#matriz~0.offset|) .cse2))) [2022-04-27 21:06:34,974 INFO L895 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (let ((.cse0 (<= |main_#t~mem10| main_~maior~0))) (or (and (= main_~k~0 1) .cse0 (= main_~N_LIN~0 1)) (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) .cse0))) [2022-04-27 21:06:34,974 INFO L899 garLoopResultBuilder]: For program point L21-2(lines 21 28) no Hoare annotation was computed. [2022-04-27 21:06:34,974 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 27) no Hoare annotation was computed. [2022-04-27 21:06:34,974 INFO L899 garLoopResultBuilder]: For program point L30-1(line 30) no Hoare annotation was computed. [2022-04-27 21:06:34,974 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 22 28) no Hoare annotation was computed. [2022-04-27 21:06:34,974 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 13 33) no Hoare annotation was computed. [2022-04-27 21:06:34,974 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 33) no Hoare annotation was computed. [2022-04-27 21:06:34,974 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 21:06:34,975 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 21:06:34,975 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 21:06:34,975 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 21:06:34,975 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 21:06:34,975 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 21:06:34,977 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-04-27 21:06:34,979 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:06:34,981 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:06:34,984 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:06:34,984 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:06:34,984 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-27 21:06:34,984 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:06:34,986 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:06:34,986 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 21:06:35,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:06:35 BasicIcfg [2022-04-27 21:06:35,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:06:35,006 INFO L158 Benchmark]: Toolchain (without parser) took 47849.66ms. Allocated memory was 164.6MB in the beginning and 204.5MB in the end (delta: 39.8MB). Free memory was 108.7MB in the beginning and 112.1MB in the end (delta: -3.5MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-04-27 21:06:35,006 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 164.6MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:06:35,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.30ms. Allocated memory was 164.6MB in the beginning and 204.5MB in the end (delta: 39.8MB). Free memory was 108.5MB in the beginning and 176.4MB in the end (delta: -67.9MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-04-27 21:06:35,007 INFO L158 Benchmark]: Boogie Preprocessor took 32.03ms. Allocated memory is still 204.5MB. Free memory was 176.4MB in the beginning and 174.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:06:35,007 INFO L158 Benchmark]: RCFGBuilder took 219.60ms. Allocated memory is still 204.5MB. Free memory was 174.9MB in the beginning and 162.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 21:06:35,007 INFO L158 Benchmark]: IcfgTransformer took 36.76ms. Allocated memory is still 204.5MB. Free memory was 162.8MB in the beginning and 161.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:06:35,007 INFO L158 Benchmark]: TraceAbstraction took 47367.32ms. Allocated memory is still 204.5MB. Free memory was 160.7MB in the beginning and 112.1MB in the end (delta: 48.5MB). Peak memory consumption was 48.4MB. Max. memory is 8.0GB. [2022-04-27 21:06:35,011 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.09ms. Allocated memory is still 164.6MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.30ms. Allocated memory was 164.6MB in the beginning and 204.5MB in the end (delta: 39.8MB). Free memory was 108.5MB in the beginning and 176.4MB in the end (delta: -67.9MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.03ms. Allocated memory is still 204.5MB. Free memory was 176.4MB in the beginning and 174.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 219.60ms. Allocated memory is still 204.5MB. Free memory was 174.9MB in the beginning and 162.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 36.76ms. Allocated memory is still 204.5MB. Free memory was 162.8MB in the beginning and 161.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 47367.32ms. Allocated memory is still 204.5MB. Free memory was 160.7MB in the beginning and 112.1MB in the end (delta: 48.5MB). Peak memory consumption was 48.4MB. 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 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 522 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 119 IncrementalHoareTripleChecker+Unchecked, 399 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 123 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 189 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, InterpolantAutomatonStates: 51, 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, 8 MinimizatonAttempts, 33 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 24 NumberOfFragments, 98 HoareAnnotationTreeSize, 15 FomulaSimplifications, 72 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 332 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 39.9s InterpolantComputationTime, 144 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 236 ConstructedInterpolants, 16 QuantifiedInterpolants, 1599 SizeOfPredicates, 51 NumberOfNonLiveVariables, 766 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 40/69 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: ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && N_COL == 1) && j == 0) && k == 1) && N_LIN == 1) || ((((k == 0 && N_COL == 1) && j == 0) && 0 == matriz) && N_LIN == 1) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((N_COL == 1 && j == 0) && 0 == matriz) && N_LIN == 1) || ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && j == 1) && N_COL == 1) && k == 1) && N_LIN == 1) RESULT: Ultimate proved your program to be correct! [2022-04-27 21:06:35,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...