/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/matrix-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:00:30,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:00:30,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:00:30,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:00:30,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:00:30,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:00:30,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:00:30,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:00:30,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:00:30,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:00:30,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:00:30,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:00:30,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:00:30,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:00:30,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:00:30,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:00:30,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:00:30,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:00:30,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:00:30,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:00:30,761 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:00:30,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:00:30,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:00:30,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:00:30,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:00:30,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:00:30,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:00:30,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:00:30,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:00:30,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:00:30,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:00:30,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:00:30,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:00:30,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:00:30,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:00:30,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:00:30,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:00:30,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:00:30,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:00:30,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:00:30,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:00:30,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:00:30,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:00:30,782 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:00:30,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:00:30,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:00:30,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:00:30,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:00:30,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:00:30,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:00:30,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:00:30,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:00:30,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:00:30,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:00:30,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:00:30,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:00:30,784 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:00:30,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:00:30,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:30,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:00:30,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:00:30,785 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:00:30,785 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:00:30,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:00:30,785 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:00:30,785 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 09:00:30,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:00:30,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:00:30,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:00:30,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:00:30,983 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:00:30,984 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-28 09:00:31,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f4b6761/235bc1c7f74047ddaffb08d36f1f52f9/FLAG590db54ad [2022-04-28 09:00:31,378 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:00:31,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2022-04-28 09:00:31,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f4b6761/235bc1c7f74047ddaffb08d36f1f52f9/FLAG590db54ad [2022-04-28 09:00:31,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f4b6761/235bc1c7f74047ddaffb08d36f1f52f9 [2022-04-28 09:00:31,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:00:31,397 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:00:31,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:31,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:00:31,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:00:31,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:31" (1/1) ... [2022-04-28 09:00:31,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@128378a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:31, skipping insertion in model container [2022-04-28 09:00:31,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:31" (1/1) ... [2022-04-28 09:00:31,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:00:31,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:00:31,546 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-28 09:00:31,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:31,577 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:00:31,584 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-28 09:00:31,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:31,610 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:00:31,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:31 WrapperNode [2022-04-28 09:00:31,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:31,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:00:31,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:00:31,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:00:31,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:31" (1/1) ... [2022-04-28 09:00:31,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:31" (1/1) ... [2022-04-28 09:00:31,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:31" (1/1) ... [2022-04-28 09:00:31,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:31" (1/1) ... [2022-04-28 09:00:31,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:31" (1/1) ... [2022-04-28 09:00:31,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:31" (1/1) ... [2022-04-28 09:00:31,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:31" (1/1) ... [2022-04-28 09:00:31,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:00:31,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:00:31,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:00:31,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:00:31,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:31" (1/1) ... [2022-04-28 09:00:31,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:31,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:31,701 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-28 09:00:31,721 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-28 09:00:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:00:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:00:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:00:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:00:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:00:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:00:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:00:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:00:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:00:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:00:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:00:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:00:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 09:00:31,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:00:31,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:00:31,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:00:31,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:00:31,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:00:31,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:00:31,793 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:00:31,794 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:00:32,031 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:00:32,036 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:00:32,036 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 09:00:32,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:32 BoogieIcfgContainer [2022-04-28 09:00:32,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:00:32,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:00:32,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:00:32,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:00:32,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:00:31" (1/3) ... [2022-04-28 09:00:32,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b553199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:32, skipping insertion in model container [2022-04-28 09:00:32,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:31" (2/3) ... [2022-04-28 09:00:32,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b553199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:32, skipping insertion in model container [2022-04-28 09:00:32,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:32" (3/3) ... [2022-04-28 09:00:32,045 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-1.c [2022-04-28 09:00:32,055 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:00:32,055 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:00:32,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:00:32,104 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@65f003ef, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d995495 [2022-04-28 09:00:32,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:00:32,113 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-28 09:00:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:00:32,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:32,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:32,119 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1729786458, now seen corresponding path program 1 times [2022-04-28 09:00:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:32,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1483392435] [2022-04-28 09:00:32,140 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1729786458, now seen corresponding path program 2 times [2022-04-28 09:00:32,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:32,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647365007] [2022-04-28 09:00:32,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:32,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:32,228 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:00:32,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [121820546] [2022-04-28 09:00:32,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:32,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:32,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:32,244 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-28 09:00:32,246 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-28 09:00:32,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 09:00:32,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:32,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:00:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:32,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:32,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2022-04-28 09:00:32,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-28 09:00:32,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 09:00:32,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #56#return; {27#true} is VALID [2022-04-28 09:00:32,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret11 := main(); {27#true} is VALID [2022-04-28 09:00:32,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {47#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 09:00:32,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {28#false} is VALID [2022-04-28 09:00:32,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {28#false} is VALID [2022-04-28 09:00:32,457 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {28#false} is VALID [2022-04-28 09:00:32,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 09:00:32,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 09:00:32,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 09:00:32,458 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-28 09:00:32,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:00:32,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:32,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647365007] [2022-04-28 09:00:32,459 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:00:32,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121820546] [2022-04-28 09:00:32,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121820546] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:32,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:32,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:00:32,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:32,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1483392435] [2022-04-28 09:00:32,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1483392435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:32,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:32,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:00:32,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798253332] [2022-04-28 09:00:32,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:32,467 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-28 09:00:32,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:32,488 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-28 09:00:32,507 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-28 09:00:32,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:00:32,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:32,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:00:32,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:00:32,524 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:00:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:32,603 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-28 09:00:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:00:32,603 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-28 09:00:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:32,605 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-28 09:00:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-28 09:00:32,615 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-28 09:00:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-28 09:00:32,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-28 09:00:32,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:32,705 INFO L225 Difference]: With dead ends: 47 [2022-04-28 09:00:32,705 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 09:00:32,707 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-28 09:00:32,712 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:32,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 09:00:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-04-28 09:00:32,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:32,736 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-28 09:00:32,737 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-28 09:00:32,737 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-28 09:00:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:32,742 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 09:00:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-28 09:00:32,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:32,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:32,743 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-28 09:00:32,744 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-28 09:00:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:32,746 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 09:00:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-28 09:00:32,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:32,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:32,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:32,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:32,748 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-28 09:00:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 09:00:32,754 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-28 09:00:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:32,763 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 09:00:32,763 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-28 09:00:32,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 09:00:32,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 09:00:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:00:32,784 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:32,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:32,804 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-28 09:00:32,985 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-28 09:00:32,985 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:32,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:32,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1358301917, now seen corresponding path program 1 times [2022-04-28 09:00:32,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:32,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [819908885] [2022-04-28 09:00:33,010 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:00:33,011 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:33,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1358301917, now seen corresponding path program 2 times [2022-04-28 09:00:33,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:33,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050198800] [2022-04-28 09:00:33,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:33,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:33,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:00:33,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1835266114] [2022-04-28 09:00:33,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:33,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:33,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:33,029 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-28 09:00:33,030 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-28 09:00:33,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:33,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:33,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:00:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:33,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:33,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2022-04-28 09:00:33,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {239#true} is VALID [2022-04-28 09:00:33,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-28 09:00:33,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #56#return; {239#true} is VALID [2022-04-28 09:00:33,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret11 := main(); {239#true} is VALID [2022-04-28 09:00:33,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {259#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 09:00:33,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {263#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 09:00:33,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {240#false} is VALID [2022-04-28 09:00:33,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {240#false} is VALID [2022-04-28 09:00:33,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {240#false} is VALID [2022-04-28 09:00:33,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {240#false} is VALID [2022-04-28 09:00:33,173 INFO L272 TraceCheckUtils]: 11: Hoare triple {240#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {240#false} is VALID [2022-04-28 09:00:33,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#false} ~cond := #in~cond; {240#false} is VALID [2022-04-28 09:00:33,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {240#false} assume 0 == ~cond; {240#false} is VALID [2022-04-28 09:00:33,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-04-28 09:00:33,174 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-28 09:00:33,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:00:33,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:33,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050198800] [2022-04-28 09:00:33,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:00:33,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835266114] [2022-04-28 09:00:33,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835266114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:33,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:33,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:00:33,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:33,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [819908885] [2022-04-28 09:00:33,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [819908885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:33,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:33,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:00:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228965014] [2022-04-28 09:00:33,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:33,177 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-28 09:00:33,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:33,178 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-28 09:00:33,190 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-28 09:00:33,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:00:33,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:33,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:00:33,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:00:33,192 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-28 09:00:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:33,262 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-28 09:00:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:00:33,263 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-28 09:00:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:33,264 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-28 09:00:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-28 09:00:33,267 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-28 09:00:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-28 09:00:33,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-28 09:00:33,313 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-28 09:00:33,314 INFO L225 Difference]: With dead ends: 36 [2022-04-28 09:00:33,314 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 09:00:33,315 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-28 09:00:33,315 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-28 09:00:33,316 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-28 09:00:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 09:00:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-04-28 09:00:33,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:33,319 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-28 09:00:33,319 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-28 09:00:33,320 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-28 09:00:33,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:33,321 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-28 09:00:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-28 09:00:33,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:33,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:33,321 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-28 09:00:33,322 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-28 09:00:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:33,324 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-28 09:00:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-28 09:00:33,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:33,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:33,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:33,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:33,325 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-28 09:00:33,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 09:00:33,326 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-28 09:00:33,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:33,327 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 09:00:33,327 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-28 09:00:33,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 09:00:33,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 09:00:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:00:33,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:33,343 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-28 09:00:33,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 09:00:33,560 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-28 09:00:33,563 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:33,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:33,564 INFO L85 PathProgramCache]: Analyzing trace with hash -770745069, now seen corresponding path program 1 times [2022-04-28 09:00:33,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:33,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2108695877] [2022-04-28 09:00:33,632 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:33,659 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:33,659 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:33,659 INFO L85 PathProgramCache]: Analyzing trace with hash -770745069, now seen corresponding path program 2 times [2022-04-28 09:00:33,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:33,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411626784] [2022-04-28 09:00:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:33,683 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:00:33,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33830495] [2022-04-28 09:00:33,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:33,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:33,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:33,696 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-28 09:00:33,704 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-28 09:00:33,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:33,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:33,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 09:00:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:33,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:33,911 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-28 09:00:34,020 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-28 09:00:34,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2022-04-28 09:00:34,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-04-28 09:00:34,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-28 09:00:34,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #56#return; {449#true} is VALID [2022-04-28 09:00:34,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret11 := main(); {449#true} is VALID [2022-04-28 09:00:34,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {469#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 09:00:34,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {469#(and (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {473#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 09:00:34,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {473#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {473#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 09:00:34,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {473#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~N_LIN~0 1))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {480#(and (= main_~k~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 09:00:34,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {480#(and (= main_~k~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (= main_~N_LIN~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {484#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= main_~k~0 1) (= main_~N_LIN~0 1))} is VALID [2022-04-28 09:00:34,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {484#(and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= main_~k~0 1) (= main_~N_LIN~0 1))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {488#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:34,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {488#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {488#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:34,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {488#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {488#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:34,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {488#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {498#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-28 09:00:34,101 INFO L272 TraceCheckUtils]: 14: Hoare triple {498#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {502#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:34,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {506#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:34,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {506#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {450#false} is VALID [2022-04-28 09:00:34,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-28 09:00:34,102 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-28 09:00:34,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:34,360 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-28 09:00:34,372 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-28 09:00:34,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-28 09:00:34,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {506#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {450#false} is VALID [2022-04-28 09:00:34,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {506#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:34,470 INFO L272 TraceCheckUtils]: 14: Hoare triple {498#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {502#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:34,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {488#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {498#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-28 09:00:34,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {488#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {488#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:34,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {488#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {488#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:34,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {534#(or (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {488#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:34,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {534#(or (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)) (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0))} is VALID [2022-04-28 09:00:34,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {542#(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|))) (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {538#(or (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 09:00:34,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {546#(or (not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) 0) (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {542#(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|))) (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 09:00:34,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) 0) (<= (mod main_~N_COL~0 4294967296) (mod main_~j~0 4294967296)) (< 1 (mod main_~N_LIN~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {546#(or (not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296))) (= (+ (* (mod main_~k~0 4294967296) 4) (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4)) 0) (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 09:00:34,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {550#(or (= (* (* (mod main_~N_LIN~0 4294967296) (mod main_~j~0 4294967296)) 4) 0) (<= (mod main_~N_COL~0 4294967296) (mod main_~j~0 4294967296)) (< 1 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 09:00:34,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret11 := main(); {449#true} is VALID [2022-04-28 09:00:34,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #56#return; {449#true} is VALID [2022-04-28 09:00:34,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-28 09:00:34,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {449#true} is VALID [2022-04-28 09:00:34,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2022-04-28 09:00:34,481 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-28 09:00:34,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:34,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411626784] [2022-04-28 09:00:34,481 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:00:34,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33830495] [2022-04-28 09:00:34,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33830495] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:34,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:00:34,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2022-04-28 09:00:34,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:34,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2108695877] [2022-04-28 09:00:34,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2108695877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:34,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:34,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:00:34,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638215263] [2022-04-28 09:00:34,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:34,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-28 09:00:34,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:34,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-28 09:00:34,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:34,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:00:34,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:34,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:00:34,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:00:34,502 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-28 09:00:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:34,778 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-28 09:00:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:00:34,778 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-28 09:00:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-28 09:00:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2022-04-28 09:00:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-28 09:00:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2022-04-28 09:00:34,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2022-04-28 09:00:34,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:34,828 INFO L225 Difference]: With dead ends: 45 [2022-04-28 09:00:34,828 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 09:00:34,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:00:34,829 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:34,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 67 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:00:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 09:00:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-04-28 09:00:34,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:34,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 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-28 09:00:34,844 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 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-28 09:00:34,844 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 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-28 09:00:34,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:34,845 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 09:00:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 09:00:34,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:34,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:34,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 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 30 states. [2022-04-28 09:00:34,846 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 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 30 states. [2022-04-28 09:00:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:34,847 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 09:00:34,847 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 09:00:34,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:34,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:34,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:34,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 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-28 09:00:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-28 09:00:34,849 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-28 09:00:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:34,850 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-28 09:00:34,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-28 09:00:34,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-28 09:00:34,879 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-28 09:00:34,879 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 09:00:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:00:34,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:34,880 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-28 09:00:34,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 09:00:35,080 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-28 09:00:35,081 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:35,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1163772079, now seen corresponding path program 1 times [2022-04-28 09:00:35,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:35,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1038359033] [2022-04-28 09:00:35,138 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:35,157 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:35,157 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:35,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1163772079, now seen corresponding path program 2 times [2022-04-28 09:00:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:35,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97631271] [2022-04-28 09:00:35,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:35,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:35,171 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:00:35,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947454674] [2022-04-28 09:00:35,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:35,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:35,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:35,173 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-28 09:00:35,187 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-28 09:00:35,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:35,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:35,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 09:00:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:35,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:35,307 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-28 09:00:35,399 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-28 09:00:35,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-28 09:00:35,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {781#true} is VALID [2022-04-28 09:00:35,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-28 09:00:35,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #56#return; {781#true} is VALID [2022-04-28 09:00:35,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret11 := main(); {781#true} is VALID [2022-04-28 09:00:35,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {801#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 09:00:35,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {801#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {805#(and (= main_~k~0 0) (= main_~j~0 0))} is VALID [2022-04-28 09:00:35,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {805#(and (= main_~k~0 0) (= main_~j~0 0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {809#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|)} is VALID [2022-04-28 09:00:35,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {809#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|)} assume !(#t~mem8 >= ~maior~0);havoc #t~mem8; {813#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:35,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {813#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {813#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:35,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {813#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {813#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:35,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {813#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {813#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:35,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {813#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {813#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:35,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {813#(< (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {829#(< |main_#t~mem10| main_~maior~0)} is VALID [2022-04-28 09:00:35,498 INFO L272 TraceCheckUtils]: 14: Hoare triple {829#(< |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {833#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:35,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {837#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:35,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {837#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-28 09:00:35,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-28 09:00:35,499 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-28 09:00:35,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:35,712 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-28 09:00:35,723 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-28 09:00:44,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-28 09:00:44,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {837#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-28 09:00:44,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {837#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:00:44,040 INFO L272 TraceCheckUtils]: 14: Hoare triple {853#(<= |main_#t~mem10| main_~maior~0)} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {833#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:00:44,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {857#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {853#(<= |main_#t~mem10| main_~maior~0)} is VALID [2022-04-28 09:00:44,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {857#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {857#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:44,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {857#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {857#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:44,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {857#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {857#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:44,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {857#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {857#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:44,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1))} assume !(#t~mem8 >= ~maior~0);havoc #t~mem8; {857#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0)} is VALID [2022-04-28 09:00:44,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#(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)))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {873#(<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) (+ |main_#t~mem8| 1))} is VALID [2022-04-28 09:00:44,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {881#(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))))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {877#(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-28 09:00:44,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {881#(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-28 09:00:44,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret11 := main(); {781#true} is VALID [2022-04-28 09:00:44,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #56#return; {781#true} is VALID [2022-04-28 09:00:44,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-28 09:00:44,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {781#true} is VALID [2022-04-28 09:00:44,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-28 09:00:44,045 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-28 09:00:44,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:44,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97631271] [2022-04-28 09:00:44,046 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:00:44,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947454674] [2022-04-28 09:00:44,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947454674] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:44,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:00:44,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 09:00:44,046 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:44,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1038359033] [2022-04-28 09:00:44,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1038359033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:44,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:44,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:00:44,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412380545] [2022-04-28 09:00:44,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:44,047 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-28 09:00:44,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:44,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-28 09:00:44,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:44,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:00:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:44,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:00:44,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:00:44,069 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-28 09:00:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:44,490 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-28 09:00:44,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:00:44,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-28 09:00:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-28 09:00:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2022-04-28 09:00:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-28 09:00:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2022-04-28 09:00:44,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 44 transitions. [2022-04-28 09:00:44,525 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-28 09:00:44,528 INFO L225 Difference]: With dead ends: 41 [2022-04-28 09:00:44,529 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 09:00:44,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:00:44,532 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:44,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:00:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 09:00:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-04-28 09:00:44,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:44,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-28 09:00:44,556 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-28 09:00:44,556 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-28 09:00:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:44,557 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-28 09:00:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-28 09:00:44,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:44,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:44,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 35 states. [2022-04-28 09:00:44,561 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 35 states. [2022-04-28 09:00:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:44,562 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-28 09:00:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-28 09:00:44,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:44,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:44,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:44,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-28 09:00:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-28 09:00:44,563 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2022-04-28 09:00:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:44,564 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-28 09:00:44,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-28 09:00:44,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-28 09:00:44,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 09:00:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 09:00:44,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:44,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:00:44,624 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-28 09:00:44,795 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-28 09:00:44,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:44,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash 280716319, now seen corresponding path program 1 times [2022-04-28 09:00:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:44,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2142560662] [2022-04-28 09:00:44,964 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:45,008 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:45,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash 280716319, now seen corresponding path program 2 times [2022-04-28 09:00:45,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:45,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535463278] [2022-04-28 09:00:45,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:45,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:00:45,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [510924067] [2022-04-28 09:00:45,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:45,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:45,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:45,040 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-28 09:00:45,041 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-28 09:00:45,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:00:45,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:45,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:00:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:45,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:45,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {1124#true} call ULTIMATE.init(); {1124#true} is VALID [2022-04-28 09:00:45,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1124#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1124#true} is VALID [2022-04-28 09:00:45,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1124#true} assume true; {1124#true} is VALID [2022-04-28 09:00:45,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1124#true} {1124#true} #56#return; {1124#true} is VALID [2022-04-28 09:00:45,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {1124#true} call #t~ret11 := main(); {1124#true} is VALID [2022-04-28 09:00:45,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {1124#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1144#(= main_~N_LIN~0 1)} is VALID [2022-04-28 09:00:45,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {1144#(= main_~N_LIN~0 1)} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1148#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 09:00:45,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {1148#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1148#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 09:00:45,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {1148#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} assume !(#t~mem8 >= ~maior~0);havoc #t~mem8; {1148#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 09:00:45,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {1148#(and (= main_~k~0 0) (= main_~N_LIN~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1158#(and (= (+ (- 1) main_~k~0) 0) (= main_~N_LIN~0 1))} is VALID [2022-04-28 09:00:45,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {1158#(and (= (+ (- 1) main_~k~0) 0) (= main_~N_LIN~0 1))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1125#false} is VALID [2022-04-28 09:00:45,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {1125#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1125#false} is VALID [2022-04-28 09:00:45,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {1125#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1125#false} is VALID [2022-04-28 09:00:45,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1125#false} is VALID [2022-04-28 09:00:45,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1125#false} is VALID [2022-04-28 09:00:45,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1125#false} is VALID [2022-04-28 09:00:45,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {1125#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1125#false} is VALID [2022-04-28 09:00:45,172 INFO L272 TraceCheckUtils]: 17: Hoare triple {1125#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1125#false} is VALID [2022-04-28 09:00:45,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#false} ~cond := #in~cond; {1125#false} is VALID [2022-04-28 09:00:45,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {1125#false} assume 0 == ~cond; {1125#false} is VALID [2022-04-28 09:00:45,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#false} assume !false; {1125#false} is VALID [2022-04-28 09:00:45,172 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-28 09:00:45,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:45,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#false} assume !false; {1125#false} is VALID [2022-04-28 09:00:45,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {1125#false} assume 0 == ~cond; {1125#false} is VALID [2022-04-28 09:00:45,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#false} ~cond := #in~cond; {1125#false} is VALID [2022-04-28 09:00:45,253 INFO L272 TraceCheckUtils]: 17: Hoare triple {1125#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1125#false} is VALID [2022-04-28 09:00:45,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {1125#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1125#false} is VALID [2022-04-28 09:00:45,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1125#false} is VALID [2022-04-28 09:00:45,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1125#false} is VALID [2022-04-28 09:00:45,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1125#false} is VALID [2022-04-28 09:00:45,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {1125#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1125#false} is VALID [2022-04-28 09:00:45,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {1125#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1125#false} is VALID [2022-04-28 09:00:45,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {1222#(not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1125#false} is VALID [2022-04-28 09:00:45,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {1226#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1222#(not (< (mod main_~k~0 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 09:00:45,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {1226#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} assume !(#t~mem8 >= ~maior~0);havoc #t~mem8; {1226#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 09:00:45,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {1226#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1226#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 09:00:45,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {1236#(not (< 1 (mod main_~N_LIN~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1226#(not (< (mod (+ main_~k~0 1) 4294967296) (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 09:00:45,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {1124#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1236#(not (< 1 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-28 09:00:45,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {1124#true} call #t~ret11 := main(); {1124#true} is VALID [2022-04-28 09:00:45,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1124#true} {1124#true} #56#return; {1124#true} is VALID [2022-04-28 09:00:45,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {1124#true} assume true; {1124#true} is VALID [2022-04-28 09:00:45,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {1124#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1124#true} is VALID [2022-04-28 09:00:45,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {1124#true} call ULTIMATE.init(); {1124#true} is VALID [2022-04-28 09:00:45,257 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-28 09:00:45,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:45,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535463278] [2022-04-28 09:00:45,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:00:45,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510924067] [2022-04-28 09:00:45,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510924067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:45,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:00:45,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 09:00:45,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:45,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2142560662] [2022-04-28 09:00:45,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2142560662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:45,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:45,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:00:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860931366] [2022-04-28 09:00:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:45,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-28 09:00:45,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:45,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-28 09:00:45,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:45,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:00:45,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:45,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:00:45,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:00:45,275 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-28 09:00:45,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:45,318 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-28 09:00:45,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:00:45,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-28 09:00:45,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-28 09:00:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 09:00:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-28 09:00:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-28 09:00:45,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-28 09:00:45,348 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-28 09:00:45,348 INFO L225 Difference]: With dead ends: 45 [2022-04-28 09:00:45,348 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 09:00:45,349 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-28 09:00:45,349 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:45,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 09:00:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-04-28 09:00:45,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:45,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 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-28 09:00:45,389 INFO L74 IsIncluded]: Start isIncluded. First operand 31 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-28 09:00:45,389 INFO L87 Difference]: Start difference. First operand 31 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-28 09:00:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:45,390 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 09:00:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 09:00:45,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:45,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:45,391 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 31 states. [2022-04-28 09:00:45,391 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 31 states. [2022-04-28 09:00:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:45,392 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 09:00:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 09:00:45,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:45,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:45,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:45,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:45,392 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-28 09:00:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 09:00:45,393 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-04-28 09:00:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:45,393 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 09:00:45,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-28 09:00:45,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 09:00:45,419 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-28 09:00:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 09:00:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 09:00:45,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:45,420 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-28 09:00:45,439 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-28 09:00:45,627 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-28 09:00:45,628 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:45,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:45,628 INFO L85 PathProgramCache]: Analyzing trace with hash -494036724, now seen corresponding path program 3 times [2022-04-28 09:00:45,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:45,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [536469764] [2022-04-28 09:00:45,717 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:45,733 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:45,733 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:45,733 INFO L85 PathProgramCache]: Analyzing trace with hash -494036724, now seen corresponding path program 4 times [2022-04-28 09:00:45,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:45,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372933665] [2022-04-28 09:00:45,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:45,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:45,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 09:00:45,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325363594] [2022-04-28 09:00:45,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:00:45,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:45,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:45,774 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-28 09:00:45,775 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-28 09:00:45,828 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:00:45,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:00:45,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:00:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:45,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:00:45,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2022-04-28 09:00:45,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {1459#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1459#true} is VALID [2022-04-28 09:00:45,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2022-04-28 09:00:45,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #56#return; {1459#true} is VALID [2022-04-28 09:00:45,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret11 := main(); {1459#true} is VALID [2022-04-28 09:00:45,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {1459#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1479#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 09:00:45,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {1479#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1479#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 09:00:45,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {1479#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1479#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 09:00:45,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {1479#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1479#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 09:00:45,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {1479#(and (= main_~N_COL~0 1) (= main_~j~0 0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1479#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 09:00:45,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {1479#(and (= main_~N_COL~0 1) (= main_~j~0 0))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1479#(and (= main_~N_COL~0 1) (= main_~j~0 0))} is VALID [2022-04-28 09:00:45,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {1479#(and (= main_~N_COL~0 1) (= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1498#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1))} is VALID [2022-04-28 09:00:45,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {1498#(and (= (+ (- 1) main_~j~0) 0) (= main_~N_COL~0 1))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1460#false} is VALID [2022-04-28 09:00:45,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {1460#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1460#false} is VALID [2022-04-28 09:00:45,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {1460#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1460#false} is VALID [2022-04-28 09:00:45,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {1460#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1460#false} is VALID [2022-04-28 09:00:45,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {1460#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1460#false} is VALID [2022-04-28 09:00:45,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {1460#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1460#false} is VALID [2022-04-28 09:00:45,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {1460#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1460#false} is VALID [2022-04-28 09:00:45,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {1460#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1460#false} is VALID [2022-04-28 09:00:45,907 INFO L272 TraceCheckUtils]: 20: Hoare triple {1460#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1460#false} is VALID [2022-04-28 09:00:45,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2022-04-28 09:00:45,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {1460#false} assume 0 == ~cond; {1460#false} is VALID [2022-04-28 09:00:45,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2022-04-28 09:00:45,907 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-28 09:00:45,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:00:45,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2022-04-28 09:00:45,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {1460#false} assume 0 == ~cond; {1460#false} is VALID [2022-04-28 09:00:45,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2022-04-28 09:00:45,983 INFO L272 TraceCheckUtils]: 20: Hoare triple {1460#false} call __VERIFIER_assert((if #t~mem10 <= ~maior~0 then 1 else 0)); {1460#false} is VALID [2022-04-28 09:00:45,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {1460#false} call #t~mem10 := read~int(~#matriz~0.base, ~#matriz~0.offset, 4); {1460#false} is VALID [2022-04-28 09:00:45,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {1460#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1460#false} is VALID [2022-04-28 09:00:45,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {1460#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1460#false} is VALID [2022-04-28 09:00:45,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {1460#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1460#false} is VALID [2022-04-28 09:00:45,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {1460#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1460#false} is VALID [2022-04-28 09:00:45,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {1460#false} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1460#false} is VALID [2022-04-28 09:00:45,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {1460#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1460#false} is VALID [2022-04-28 09:00:45,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {1568#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1460#false} is VALID [2022-04-28 09:00:45,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {1572#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1568#(not (< (mod main_~j~0 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 09:00:45,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {1572#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1572#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 09:00:45,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {1572#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1572#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 09:00:45,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {1572#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume #t~mem8 >= ~maior~0;havoc #t~mem8;call #t~mem9 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);~maior~0 := #t~mem9;havoc #t~mem9; {1572#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 09:00:45,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;call write~int(#t~nondet7, ~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4);havoc #t~nondet7;call #t~mem8 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {1572#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 09:00:45,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {1572#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {1572#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 09:00:45,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {1459#true} ~N_LIN~0 := 1;~N_COL~0 := 1;havoc ~j~0;havoc ~k~0;call ~#matriz~0.base, ~#matriz~0.offset := #Ultimate.allocOnStack(4 * (~N_LIN~0 % 4294967296) * (~N_COL~0 % 4294967296));havoc ~maior~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~maior~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; {1572#(not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-28 09:00:45,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret11 := main(); {1459#true} is VALID [2022-04-28 09:00:45,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #56#return; {1459#true} is VALID [2022-04-28 09:00:45,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2022-04-28 09:00:45,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {1459#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1459#true} is VALID [2022-04-28 09:00:45,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2022-04-28 09:00:45,991 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-28 09:00:45,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:45,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372933665] [2022-04-28 09:00:45,991 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 09:00:45,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325363594] [2022-04-28 09:00:45,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325363594] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:00:45,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:00:45,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-28 09:00:45,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:45,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [536469764] [2022-04-28 09:00:45,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [536469764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:45,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:45,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:00:45,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80377951] [2022-04-28 09:00:45,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:45,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-28 09:00:45,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:45,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-28 09:00:46,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:46,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:00:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:46,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:00:46,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:00:46,010 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-28 09:00:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:46,041 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 09:00:46,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:00:46,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-28 09:00:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-28 09:00:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-28 09:00:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-28 09:00:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-28 09:00:46,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-28 09:00:46,065 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-28 09:00:46,065 INFO L225 Difference]: With dead ends: 25 [2022-04-28 09:00:46,065 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:00:46,066 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-28 09:00:46,066 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 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-28 09:00:46,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:00:46,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:00:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:00:46,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:46,068 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-28 09:00:46,068 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-28 09:00:46,068 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-28 09:00:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:46,068 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:00:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:00:46,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:46,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:46,068 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-28 09:00:46,068 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-28 09:00:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:46,069 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:00:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:00:46,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:46,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:46,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:46,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:46,069 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-28 09:00:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:00:46,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-28 09:00:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:46,069 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:00:46,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-28 09:00:46,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:00:46,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:00:46,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:46,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:00:46,090 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-28 09:00:46,289 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-28 09:00:46,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:00:46,465 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 09:00:46,465 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 09:00:46,465 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 09:00:46,465 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 13 33) the Hoare annotation is: true [2022-04-28 09:00:46,465 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 28) the Hoare annotation is: (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) main_~maior~0) (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~k~0 1) (= main_~N_LIN~0 1)) [2022-04-28 09:00:46,465 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) .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-28 09:00:46,465 INFO L895 garLoopResultBuilder]: At program point L21-4(lines 21 28) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|))) (or (and (<= .cse0 main_~maior~0) (= main_~k~0 1) (= main_~N_LIN~0 1)) (< .cse0 main_~maior~0))) [2022-04-28 09:00:46,465 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 13 33) the Hoare annotation is: true [2022-04-28 09:00:46,465 INFO L895 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|))) (or (and (<= .cse0 main_~maior~0) (= main_~k~0 1) (<= |main_#t~mem10| main_~maior~0) (= main_~N_LIN~0 1)) (and (< |main_#t~mem10| main_~maior~0) (< .cse0 main_~maior~0)))) [2022-04-28 09:00:46,465 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 33) the Hoare annotation is: true [2022-04-28 09:00:46,465 INFO L902 garLoopResultBuilder]: At program point L30-1(line 30) the Hoare annotation is: true [2022-04-28 09:00:46,466 INFO L895 garLoopResultBuilder]: At program point L26(lines 26 27) the Hoare annotation is: (and (<= (select (select |#memory_int| |main_~#matriz~0.base|) |main_~#matriz~0.offset|) |main_#t~mem8|) (= main_~k~0 0) (= main_~N_COL~0 1) (= main_~j~0 0) (= main_~N_LIN~0 1)) [2022-04-28 09:00:46,466 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 28) the Hoare annotation is: (and (= main_~k~0 0) (= main_~N_COL~0 1) (= main_~j~0 0) (<= (select (select |#memory_int| |main_~#matriz~0.base|) (+ (* (mod main_~k~0 4294967296) 4) |main_~#matriz~0.offset|)) main_~maior~0) (= main_~N_LIN~0 1)) [2022-04-28 09:00:46,466 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 .cse2))) [2022-04-28 09:00:46,466 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:00:46,466 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:00:46,466 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:00:46,466 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:00:46,466 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:00:46,466 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:00:46,466 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:00:46,466 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-28 09:00:46,466 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-28 09:00:46,466 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 09:00:46,466 INFO L895 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 09:00:46,466 INFO L902 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-28 09:00:46,466 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 09:00:46,469 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2] [2022-04-28 09:00:46,470 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:00:46,472 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:00:46,473 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 09:00:46,485 INFO L163 areAnnotationChecker]: CFG has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:00:46,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:00:46 BoogieIcfgContainer [2022-04-28 09:00:46,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:00:46,495 INFO L158 Benchmark]: Toolchain (without parser) took 15097.93ms. Allocated memory was 183.5MB in the beginning and 222.3MB in the end (delta: 38.8MB). Free memory was 134.1MB in the beginning and 127.9MB in the end (delta: 6.2MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-04-28 09:00:46,496 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:00:46,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.46ms. Allocated memory is still 183.5MB. Free memory was 133.9MB in the beginning and 159.0MB in the end (delta: -25.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 09:00:46,496 INFO L158 Benchmark]: Boogie Preprocessor took 45.51ms. Allocated memory is still 183.5MB. Free memory was 159.0MB in the beginning and 157.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 09:00:46,496 INFO L158 Benchmark]: RCFGBuilder took 379.92ms. Allocated memory is still 183.5MB. Free memory was 157.4MB in the beginning and 144.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 09:00:46,497 INFO L158 Benchmark]: TraceAbstraction took 14456.28ms. Allocated memory was 183.5MB in the beginning and 222.3MB in the end (delta: 38.8MB). Free memory was 144.3MB in the beginning and 127.9MB in the end (delta: 16.4MB). Peak memory consumption was 55.8MB. Max. memory is 8.0GB. [2022-04-28 09:00:46,498 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.12ms. Allocated memory is still 183.5MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.46ms. Allocated memory is still 183.5MB. Free memory was 133.9MB in the beginning and 159.0MB in the end (delta: -25.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.51ms. Allocated memory is still 183.5MB. Free memory was 159.0MB in the beginning and 157.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 379.92ms. Allocated memory is still 183.5MB. Free memory was 157.4MB in the beginning and 144.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14456.28ms. Allocated memory was 183.5MB in the beginning and 222.3MB in the end (delta: 38.8MB). Free memory was 144.3MB in the beginning and 127.9MB in the end (delta: 16.4MB). Peak memory consumption was 55.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 195 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 231 IncrementalHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 85 mSDtfsCounter, 231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=4, InterpolantAutomatonStates: 38, 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, 6 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 60 PreInvPairs, 88 NumberOfFragments, 212 HoareAnnotationTreeSize, 60 FomulaSimplifications, 53 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 92 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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) && N_LIN == 1) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((N_COL == 1 && j == 0) && N_LIN == 1) || ((((unknown-#memory_int-unknown[matriz][matriz] <= maior && j == 1) && N_COL == 1) && k == 1) && N_LIN == 1) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 09:00:46,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...