/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-34549b5 [2022-04-08 08:59:47,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:59:47,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:59:47,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:59:47,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:59:47,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:59:47,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:59:47,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:59:47,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:59:47,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:59:47,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:59:47,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:59:47,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:59:47,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:59:47,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:59:47,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:59:47,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:59:47,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:59:47,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:59:47,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:59:47,174 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:59:47,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:59:47,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:59:47,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:59:47,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:59:47,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:59:47,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:59:47,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:59:47,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:59:47,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:59:47,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:59:47,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:59:47,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:59:47,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:59:47,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:59:47,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:59:47,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:59:47,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:59:47,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:59:47,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:59:47,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:59:47,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:59:47,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 08:59:47,190 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:59:47,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:59:47,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:59:47,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:59:47,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:59:47,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:59:47,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:59:47,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:59:47,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:59:47,192 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:59:47,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:59:47,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:59:47,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:59:47,192 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:59:47,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:59:47,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:59:47,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:59:47,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:59:47,193 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:59:47,193 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:59:47,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:59:47,193 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 08:59:47,193 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-08 08:59:47,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:59:47,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:59:47,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:59:47,357 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:59:47,360 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:59:47,361 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-08 08:59:47,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea65f6221/58c0726190804ba7895451275374e784/FLAG3ac6504a6 [2022-04-08 08:59:47,712 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:59:47,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-1.c [2022-04-08 08:59:47,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea65f6221/58c0726190804ba7895451275374e784/FLAG3ac6504a6 [2022-04-08 08:59:48,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea65f6221/58c0726190804ba7895451275374e784 [2022-04-08 08:59:48,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:59:48,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:59:48,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:59:48,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:59:48,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:59:48,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:59:48" (1/1) ... [2022-04-08 08:59:48,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fcc0ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:48, skipping insertion in model container [2022-04-08 08:59:48,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:59:48" (1/1) ... [2022-04-08 08:59:48,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:59:48,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:59:48,300 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-08 08:59:48,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:59:48,317 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:59:48,344 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-08 08:59:48,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:59:48,358 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:59:48,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:48 WrapperNode [2022-04-08 08:59:48,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:59:48,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:59:48,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:59:48,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:59:48,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:48" (1/1) ... [2022-04-08 08:59:48,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:48" (1/1) ... [2022-04-08 08:59:48,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:48" (1/1) ... [2022-04-08 08:59:48,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:48" (1/1) ... [2022-04-08 08:59:48,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:48" (1/1) ... [2022-04-08 08:59:48,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:48" (1/1) ... [2022-04-08 08:59:48,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:48" (1/1) ... [2022-04-08 08:59:48,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:59:48,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:59:48,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:59:48,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:59:48,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:48" (1/1) ... [2022-04-08 08:59:48,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:59:48,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:48,443 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-08 08:59:48,495 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-08 08:59:48,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:59:48,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:59:48,508 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:59:48,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 08:59:48,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:59:48,509 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:59:48,509 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:59:48,509 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:59:48,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:59:48,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 08:59:48,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:59:48,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:59:48,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 08:59:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:59:48,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:59:48,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:59:48,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:59:48,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:59:48,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:59:48,562 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:59:48,563 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:59:48,678 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:59:48,682 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:59:48,683 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 08:59:48,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:59:48 BoogieIcfgContainer [2022-04-08 08:59:48,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:59:48,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:59:48,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:59:48,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:59:48,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:59:48" (1/3) ... [2022-04-08 08:59:48,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60abaf46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:59:48, skipping insertion in model container [2022-04-08 08:59:48,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:48" (2/3) ... [2022-04-08 08:59:48,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60abaf46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:59:48, skipping insertion in model container [2022-04-08 08:59:48,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:59:48" (3/3) ... [2022-04-08 08:59:48,700 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-1.c [2022-04-08 08:59:48,703 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:59:48,703 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:59:48,729 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:59:48,748 INFO L340 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 [2022-04-08 08:59:48,748 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:59:48,759 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-08 08:59:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 08:59:48,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:48,767 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:48,767 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:48,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:48,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1729786458, now seen corresponding path program 1 times [2022-04-08 08:59:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:48,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1128530991] [2022-04-08 08:59:48,795 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:59:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1729786458, now seen corresponding path program 2 times [2022-04-08 08:59:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:48,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143398680] [2022-04-08 08:59:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:48,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:48,859 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:59:48,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399561063] [2022-04-08 08:59:48,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:48,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:48,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:48,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:59:48,862 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-08 08:59:48,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 08:59:48,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:48,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 08:59:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:48,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:49,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2022-04-08 08:59:49,059 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-08 08:59:49,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 08:59:49,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #56#return; {27#true} is VALID [2022-04-08 08:59:49,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret11 := main(); {27#true} is VALID [2022-04-08 08:59:49,063 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-08 08:59:49,064 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-08 08:59:49,064 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-08 08:59:49,065 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-08 08:59:49,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-08 08:59:49,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-08 08:59:49,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-08 08:59:49,066 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-08 08:59:49,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 08:59:49,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:49,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143398680] [2022-04-08 08:59:49,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:59:49,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399561063] [2022-04-08 08:59:49,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399561063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:49,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:49,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 08:59:49,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:49,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1128530991] [2022-04-08 08:59:49,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1128530991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:49,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:49,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 08:59:49,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462926351] [2022-04-08 08:59:49,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:49,076 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-08 08:59:49,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:49,079 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-08 08:59:49,095 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-08 08:59:49,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 08:59:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:49,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 08:59:49,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 08:59:49,133 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-08 08:59:49,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:49,213 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-04-08 08:59:49,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 08:59:49,214 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-08 08:59:49,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:49,215 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-08 08:59:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-08 08:59:49,224 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-08 08:59:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-04-08 08:59:49,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-04-08 08:59:49,284 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-08 08:59:49,290 INFO L225 Difference]: With dead ends: 47 [2022-04-08 08:59:49,290 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 08:59:49,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 08:59:49,296 INFO L913 BasicCegarLoop]: 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-08 08:59:49,297 INFO L914 BasicCegarLoop]: 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-08 08:59:49,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 08:59:49,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-04-08 08:59:49,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:49,315 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-08 08:59:49,316 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-08 08:59:49,316 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-08 08:59:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:49,320 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-08 08:59:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-08 08:59:49,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:49,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:49,320 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-08 08:59:49,321 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-08 08:59:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:49,325 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-08 08:59:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-08 08:59:49,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:49,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:49,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:49,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:49,328 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-08 08:59:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-08 08:59:49,333 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-08 08:59:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:49,336 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-08 08:59:49,336 INFO L479 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-08 08:59:49,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-08 08:59:49,352 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-08 08:59:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 08:59:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 08:59:49,353 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:49,354 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:49,372 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-08 08:59:49,569 WARN L460 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-08 08:59:49,570 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1358301917, now seen corresponding path program 1 times [2022-04-08 08:59:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:49,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [561719593] [2022-04-08 08:59:49,591 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 08:59:49,591 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1358301917, now seen corresponding path program 2 times [2022-04-08 08:59:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:49,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296431954] [2022-04-08 08:59:49,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:49,610 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:59:49,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736370479] [2022-04-08 08:59:49,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:49,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:49,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:49,612 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-08 08:59:49,614 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-08 08:59:49,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:49,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:49,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 08:59:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:49,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:49,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2022-04-08 08:59:49,801 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-08 08:59:49,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-08 08:59:49,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #56#return; {239#true} is VALID [2022-04-08 08:59:49,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret11 := main(); {239#true} is VALID [2022-04-08 08:59:49,803 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-08 08:59:49,803 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-08 08:59:49,804 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-08 08:59:49,804 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-08 08:59:49,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {240#false} is VALID [2022-04-08 08:59:49,804 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-08 08:59:49,804 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-08 08:59:49,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {240#false} ~cond := #in~cond; {240#false} is VALID [2022-04-08 08:59:49,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {240#false} assume 0 == ~cond; {240#false} is VALID [2022-04-08 08:59:49,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-04-08 08:59:49,805 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-08 08:59:49,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 08:59:49,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:49,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296431954] [2022-04-08 08:59:49,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:59:49,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736370479] [2022-04-08 08:59:49,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736370479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:49,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:49,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:59:49,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:49,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [561719593] [2022-04-08 08:59:49,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [561719593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:49,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:49,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:59:49,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351700122] [2022-04-08 08:59:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:49,808 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-08 08:59:49,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:49,808 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-08 08:59:49,819 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-08 08:59:49,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:59:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:59:49,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:59:49,820 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-08 08:59:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:49,882 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-08 08:59:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:59:49,882 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-08 08:59:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:49,883 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-08 08:59:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-08 08:59:49,884 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-08 08:59:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-08 08:59:49,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-08 08:59:49,915 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-08 08:59:49,916 INFO L225 Difference]: With dead ends: 36 [2022-04-08 08:59:49,916 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 08:59:49,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:59:49,917 INFO L913 BasicCegarLoop]: 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-08 08:59:49,917 INFO L914 BasicCegarLoop]: 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-08 08:59:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 08:59:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-04-08 08:59:49,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:49,920 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-08 08:59:49,920 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-08 08:59:49,921 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-08 08:59:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:49,922 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-08 08:59:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-08 08:59:49,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:49,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:49,922 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-08 08:59:49,922 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-08 08:59:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:49,924 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-08 08:59:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-08 08:59:49,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:49,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:49,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:49,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:49,924 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-08 08:59:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-08 08:59:49,925 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-08 08:59:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:49,925 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-08 08:59:49,925 INFO L479 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-08 08:59:49,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-08 08:59:49,940 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-08 08:59:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 08:59:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 08:59:49,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:49,941 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:49,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 08:59:50,158 WARN L460 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-08 08:59:50,160 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:50,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:50,160 INFO L85 PathProgramCache]: Analyzing trace with hash -770745069, now seen corresponding path program 1 times [2022-04-08 08:59:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:50,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2088355741] [2022-04-08 08:59:50,222 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:50,242 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:50,243 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:50,243 INFO L85 PathProgramCache]: Analyzing trace with hash -770745069, now seen corresponding path program 2 times [2022-04-08 08:59:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:50,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125770923] [2022-04-08 08:59:50,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:50,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:50,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:59:50,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [230834407] [2022-04-08 08:59:50,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:50,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:50,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:50,255 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-08 08:59:50,256 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-08 08:59:50,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:50,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:50,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 08:59:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:50,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:50,388 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-08 08:59:50,486 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-08 08:59:50,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2022-04-08 08:59:50,551 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-08 08:59:50,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-08 08:59:50,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #56#return; {449#true} is VALID [2022-04-08 08:59:50,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret11 := main(); {449#true} is VALID [2022-04-08 08:59:50,552 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-08 08:59:50,553 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-08 08:59:50,554 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-08 08:59:50,554 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-08 08:59:50,555 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-08 08:59:50,555 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-08 08:59:50,555 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-08 08:59:50,556 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-08 08:59:50,556 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-08 08:59:50,557 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-08 08:59:50,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {506#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:59:50,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {506#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {450#false} is VALID [2022-04-08 08:59:50,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-08 08:59:50,558 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-08 08:59:50,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:50,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-04-08 08:59:50,776 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-08 08:59:50,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-08 08:59:50,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {506#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {450#false} is VALID [2022-04-08 08:59:50,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {502#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {506#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:59:50,895 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-08 08:59:50,895 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-08 08:59:50,896 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-08 08:59:50,896 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-08 08:59:50,897 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-08 08:59:50,897 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-08 08:59:50,898 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-08 08:59:50,899 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-08 08:59:50,900 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-08 08:59:50,900 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-08 08:59:50,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {449#true} call #t~ret11 := main(); {449#true} is VALID [2022-04-08 08:59:50,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {449#true} {449#true} #56#return; {449#true} is VALID [2022-04-08 08:59:50,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2022-04-08 08:59:50,901 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-08 08:59:50,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2022-04-08 08:59:50,901 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-08 08:59:50,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:50,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125770923] [2022-04-08 08:59:50,902 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:59:50,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230834407] [2022-04-08 08:59:50,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230834407] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:50,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:59:50,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2022-04-08 08:59:50,902 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:50,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2088355741] [2022-04-08 08:59:50,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2088355741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:50,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:50,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 08:59:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679258187] [2022-04-08 08:59:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:50,903 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-08 08:59:50,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:50,904 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-08 08:59:50,917 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-08 08:59:50,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 08:59:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:50,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 08:59:50,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-08 08:59:50,918 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-08 08:59:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:51,138 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-08 08:59:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 08:59:51,139 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-08 08:59:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:51,139 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-08 08:59:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2022-04-08 08:59:51,141 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-08 08:59:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2022-04-08 08:59:51,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2022-04-08 08:59:51,182 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-08 08:59:51,183 INFO L225 Difference]: With dead ends: 45 [2022-04-08 08:59:51,183 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 08:59:51,183 INFO L912 BasicCegarLoop]: 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-08 08:59:51,184 INFO L913 BasicCegarLoop]: 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-08 08:59:51,184 INFO L914 BasicCegarLoop]: 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-08 08:59:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 08:59:51,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-04-08 08:59:51,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:51,190 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-08 08:59:51,190 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-08 08:59:51,190 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-08 08:59:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:51,191 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 08:59:51,192 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-08 08:59:51,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:51,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:51,192 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-08 08:59:51,192 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-08 08:59:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:51,193 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 08:59:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-08 08:59:51,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:51,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:51,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:51,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:51,194 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-08 08:59:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 08:59:51,195 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-08 08:59:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:51,195 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 08:59:51,196 INFO L479 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-08 08:59:51,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 08:59:51,217 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-08 08:59:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 08:59:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 08:59:51,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:51,218 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:51,249 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-08 08:59:51,432 WARN L460 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-08 08:59:51,433 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:51,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1163772079, now seen corresponding path program 1 times [2022-04-08 08:59:51,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:51,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [466386119] [2022-04-08 08:59:51,475 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:51,489 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:51,489 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1163772079, now seen corresponding path program 2 times [2022-04-08 08:59:51,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:51,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267154384] [2022-04-08 08:59:51,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:51,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:51,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:59:51,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528865032] [2022-04-08 08:59:51,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:51,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:51,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:51,501 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-08 08:59:51,502 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-08 08:59:51,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:51,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:51,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 08:59:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:51,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:51,586 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-08 08:59:51,643 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-08 08:59:51,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-08 08:59:51,699 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-08 08:59:51,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-08 08:59:51,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #56#return; {781#true} is VALID [2022-04-08 08:59:51,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret11 := main(); {781#true} is VALID [2022-04-08 08:59:51,700 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-08 08:59:51,700 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-08 08:59:51,701 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-08 08:59:51,702 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-08 08:59:51,702 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-08 08:59:51,702 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-08 08:59:51,703 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-08 08:59:51,703 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-08 08:59:51,703 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-08 08:59:51,704 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-08 08:59:51,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {837#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:59:51,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {837#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-08 08:59:51,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-08 08:59:51,705 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-08 08:59:51,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 08:59:51,874 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-08 08:59:51,884 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-08 08:59:59,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-08 08:59:59,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {837#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-08 08:59:59,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {837#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:59:59,256 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-08 08:59:59,257 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-08 08:59:59,257 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-08 08:59:59,257 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-08 08:59:59,258 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-08 08:59:59,258 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-08 08:59:59,259 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-08 08:59:59,260 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-08 08:59:59,260 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-08 08:59:59,261 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-08 08:59:59,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret11 := main(); {781#true} is VALID [2022-04-08 08:59:59,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #56#return; {781#true} is VALID [2022-04-08 08:59:59,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-08 08:59:59,262 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-08 08:59:59,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-08 08:59:59,262 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-08 08:59:59,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:59,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267154384] [2022-04-08 08:59:59,262 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:59:59,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528865032] [2022-04-08 08:59:59,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528865032] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 08:59:59,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 08:59:59,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 08:59:59,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:59,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [466386119] [2022-04-08 08:59:59,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [466386119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:59,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:59,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 08:59:59,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497027729] [2022-04-08 08:59:59,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:59,264 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-08 08:59:59,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:59,264 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-08 08:59:59,278 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-08 08:59:59,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 08:59:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:59,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 08:59:59,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-08 08:59:59,279 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-08 08:59:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:59,755 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-08 08:59:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 08:59:59,755 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-08 08:59:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:59,755 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-08 08:59:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2022-04-08 08:59:59,756 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-08 08:59:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2022-04-08 08:59:59,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 44 transitions. [2022-04-08 08:59:59,791 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-08 08:59:59,792 INFO L225 Difference]: With dead ends: 41 [2022-04-08 08:59:59,792 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 08:59:59,793 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-04-08 08:59:59,793 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:59,793 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:59:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 08:59:59,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-04-08 08:59:59,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:59,806 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-08 08:59:59,806 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-08 08:59:59,806 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-08 08:59:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:59,808 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 08:59:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-08 08:59:59,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:59,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:59,808 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-08 08:59:59,808 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-08 08:59:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:59,809 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 08:59:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-08 08:59:59,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:59,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:59,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:59,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:59,810 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-08 08:59:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-08 08:59:59,815 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2022-04-08 08:59:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:59,815 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-08 08:59:59,815 INFO L479 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-08 08:59:59,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2022-04-08 08:59:59,842 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-08 08:59:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-08 08:59:59,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 08:59:59,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:59,844 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:59,860 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-08 09:00:00,055 WARN L460 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-08 09:00:00,055 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:00,056 INFO L85 PathProgramCache]: Analyzing trace with hash 280716319, now seen corresponding path program 1 times [2022-04-08 09:00:00,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:00,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1159379170] [2022-04-08 09:00:00,183 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:00,235 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:00,235 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash 280716319, now seen corresponding path program 2 times [2022-04-08 09:00:00,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:00,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916331045] [2022-04-08 09:00:00,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:00,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:00,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:00:00,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [179194273] [2022-04-08 09:00:00,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:00:00,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:00,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:00,275 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-08 09:00:00,290 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-08 09:00:00,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:00:00,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:00,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 09:00:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:00,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:00,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {1124#true} call ULTIMATE.init(); {1124#true} is VALID [2022-04-08 09:00:00,418 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-08 09:00:00,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {1124#true} assume true; {1124#true} is VALID [2022-04-08 09:00:00,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1124#true} {1124#true} #56#return; {1124#true} is VALID [2022-04-08 09:00:00,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {1124#true} call #t~ret11 := main(); {1124#true} is VALID [2022-04-08 09:00:00,421 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-08 09:00:00,422 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-08 09:00:00,423 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-08 09:00:00,423 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-08 09:00:00,423 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-08 09:00:00,424 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-08 09:00:00,424 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-08 09:00:00,424 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-08 09:00:00,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1125#false} is VALID [2022-04-08 09:00:00,425 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-08 09:00:00,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1125#false} is VALID [2022-04-08 09:00:00,425 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-08 09:00:00,425 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-08 09:00:00,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#false} ~cond := #in~cond; {1125#false} is VALID [2022-04-08 09:00:00,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {1125#false} assume 0 == ~cond; {1125#false} is VALID [2022-04-08 09:00:00,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#false} assume !false; {1125#false} is VALID [2022-04-08 09:00:00,426 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-08 09:00:00,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:00,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#false} assume !false; {1125#false} is VALID [2022-04-08 09:00:00,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {1125#false} assume 0 == ~cond; {1125#false} is VALID [2022-04-08 09:00:00,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#false} ~cond := #in~cond; {1125#false} is VALID [2022-04-08 09:00:00,506 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-08 09:00:00,506 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-08 09:00:00,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1125#false} is VALID [2022-04-08 09:00:00,506 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-08 09:00:00,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1125#false} is VALID [2022-04-08 09:00:00,506 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-08 09:00:00,506 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-08 09:00:00,507 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-08 09:00:00,508 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-08 09:00:00,508 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-08 09:00:00,508 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-08 09:00:00,509 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-08 09:00:00,509 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-08 09:00:00,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {1124#true} call #t~ret11 := main(); {1124#true} is VALID [2022-04-08 09:00:00,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1124#true} {1124#true} #56#return; {1124#true} is VALID [2022-04-08 09:00:00,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {1124#true} assume true; {1124#true} is VALID [2022-04-08 09:00:00,510 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-08 09:00:00,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {1124#true} call ULTIMATE.init(); {1124#true} is VALID [2022-04-08 09:00:00,510 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-08 09:00:00,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:00,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916331045] [2022-04-08 09:00:00,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:00:00,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179194273] [2022-04-08 09:00:00,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179194273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:00,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:00:00,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 09:00:00,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:00,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1159379170] [2022-04-08 09:00:00,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1159379170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:00,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:00,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:00:00,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859753627] [2022-04-08 09:00:00,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:00,512 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-08 09:00:00,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:00,513 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-08 09:00:00,526 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-08 09:00:00,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:00:00,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:00,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:00:00,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:00:00,527 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-08 09:00:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:00,570 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-08 09:00:00,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:00:00,570 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-08 09:00:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:00,570 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-08 09:00:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 09:00:00,572 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-08 09:00:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 09:00:00,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-08 09:00:00,596 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-08 09:00:00,598 INFO L225 Difference]: With dead ends: 45 [2022-04-08 09:00:00,598 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 09:00:00,599 INFO L912 BasicCegarLoop]: 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-08 09:00:00,600 INFO L913 BasicCegarLoop]: 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-08 09:00:00,600 INFO L914 BasicCegarLoop]: 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-08 09:00:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 09:00:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-04-08 09:00:00,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:00,612 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-08 09:00:00,612 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-08 09:00:00,612 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-08 09:00:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:00,613 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 09:00:00,613 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 09:00:00,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:00,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:00,614 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-08 09:00:00,614 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-08 09:00:00,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:00,617 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-08 09:00:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 09:00:00,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:00,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:00,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:00,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:00,620 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-08 09:00:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-08 09:00:00,622 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-04-08 09:00:00,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:00,622 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-08 09:00:00,622 INFO L479 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-08 09:00:00,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-08 09:00:00,645 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-08 09:00:00,645 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 09:00:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 09:00:00,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:00,646 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:00,662 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-08 09:00:00,861 WARN L460 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-08 09:00:00,862 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:00,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:00,862 INFO L85 PathProgramCache]: Analyzing trace with hash -494036724, now seen corresponding path program 3 times [2022-04-08 09:00:00,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:00,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2023577003] [2022-04-08 09:00:00,945 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:00,960 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 09:00:00,960 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash -494036724, now seen corresponding path program 4 times [2022-04-08 09:00:00,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:00,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071551115] [2022-04-08 09:00:00,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:00,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:00,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 09:00:00,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723162249] [2022-04-08 09:00:00,975 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:00:00,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:00,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:00,992 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-08 09:00:00,999 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-08 09:00:01,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:00:01,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:01,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 09:00:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:01,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:01,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2022-04-08 09:00:01,135 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-08 09:00:01,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2022-04-08 09:00:01,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #56#return; {1459#true} is VALID [2022-04-08 09:00:01,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret11 := main(); {1459#true} is VALID [2022-04-08 09:00:01,136 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-08 09:00:01,136 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-08 09:00:01,137 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-08 09:00:01,137 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-08 09:00:01,137 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-08 09:00:01,138 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-08 09:00:01,138 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-08 09:00:01,139 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-08 09:00:01,139 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-08 09:00:01,139 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-08 09:00:01,139 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-08 09:00:01,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {1460#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1460#false} is VALID [2022-04-08 09:00:01,139 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-08 09:00:01,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {1460#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1460#false} is VALID [2022-04-08 09:00:01,139 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-08 09:00:01,139 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-08 09:00:01,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2022-04-08 09:00:01,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {1460#false} assume 0 == ~cond; {1460#false} is VALID [2022-04-08 09:00:01,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2022-04-08 09:00:01,140 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-08 09:00:01,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:01,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {1460#false} assume !false; {1460#false} is VALID [2022-04-08 09:00:01,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {1460#false} assume 0 == ~cond; {1460#false} is VALID [2022-04-08 09:00:01,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {1460#false} ~cond := #in~cond; {1460#false} is VALID [2022-04-08 09:00:01,223 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-08 09:00:01,223 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-08 09:00:01,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {1460#false} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {1460#false} is VALID [2022-04-08 09:00:01,223 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-08 09:00:01,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {1460#false} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {1460#false} is VALID [2022-04-08 09:00:01,224 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-08 09:00:01,224 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-08 09:00:01,224 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-08 09:00:01,226 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-08 09:00:01,227 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-08 09:00:01,227 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-08 09:00:01,228 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-08 09:00:01,228 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-08 09:00:01,228 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-08 09:00:01,228 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-08 09:00:01,229 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-08 09:00:01,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {1459#true} call #t~ret11 := main(); {1459#true} is VALID [2022-04-08 09:00:01,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1459#true} {1459#true} #56#return; {1459#true} is VALID [2022-04-08 09:00:01,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {1459#true} assume true; {1459#true} is VALID [2022-04-08 09:00:01,230 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-08 09:00:01,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {1459#true} call ULTIMATE.init(); {1459#true} is VALID [2022-04-08 09:00:01,230 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-08 09:00:01,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:01,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071551115] [2022-04-08 09:00:01,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 09:00:01,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723162249] [2022-04-08 09:00:01,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723162249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:01,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 09:00:01,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-08 09:00:01,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:01,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2023577003] [2022-04-08 09:00:01,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2023577003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:01,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:01,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:00:01,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891955735] [2022-04-08 09:00:01,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:01,232 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-08 09:00:01,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:01,232 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-08 09:00:01,251 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-08 09:00:01,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:00:01,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:01,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:00:01,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:00:01,252 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-08 09:00:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:01,280 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 09:00:01,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:00:01,280 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-08 09:00:01,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:01,280 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-08 09:00:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-08 09:00:01,281 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-08 09:00:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-08 09:00:01,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-08 09:00:01,300 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-08 09:00:01,300 INFO L225 Difference]: With dead ends: 25 [2022-04-08 09:00:01,300 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:00:01,300 INFO L912 BasicCegarLoop]: 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-08 09:00:01,301 INFO L913 BasicCegarLoop]: 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-08 09:00:01,301 INFO L914 BasicCegarLoop]: 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-08 09:00:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:00:01,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:00:01,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:01,302 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-08 09:00:01,302 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-08 09:00:01,302 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-08 09:00:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:01,302 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:00:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:00:01,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:01,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:01,303 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-08 09:00:01,303 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-08 09:00:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:01,303 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:00:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:00:01,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:01,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:01,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:01,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:01,303 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-08 09:00:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:00:01,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-08 09:00:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:01,303 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:00:01,304 INFO L479 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-08 09:00:01,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:00:01,304 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-08 09:00:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:00:01,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:01,306 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:00:01,337 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-08 09:00:01,522 WARN L460 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-08 09:00:01,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:00:01,699 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 09:00:01,699 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 09:00:01,699 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 09:00:01,699 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 13 33) the Hoare annotation is: true [2022-04-08 09:00:01,699 INFO L878 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-08 09:00:01,699 INFO L878 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-08 09:00:01,699 INFO L878 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-08 09:00:01,699 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 13 33) the Hoare annotation is: true [2022-04-08 09:00:01,699 INFO L878 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-08 09:00:01,699 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 13 33) the Hoare annotation is: true [2022-04-08 09:00:01,700 INFO L885 garLoopResultBuilder]: At program point L30-1(line 30) the Hoare annotation is: true [2022-04-08 09:00:01,700 INFO L878 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-08 09:00:01,700 INFO L878 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-08 09:00:01,700 INFO L878 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-08 09:00:01,700 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:00:01,700 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:00:01,700 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:00:01,700 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:00:01,700 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:00:01,700 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:00:01,700 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:00:01,700 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-08 09:00:01,700 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-08 09:00:01,700 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 09:00:01,700 INFO L878 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-08 09:00:01,700 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-08 09:00:01,701 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 09:00:01,703 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2] [2022-04-08 09:00:01,703 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:00:01,706 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:00:01,707 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 09:00:01,719 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-08 09:00:01,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:00:01 BoogieIcfgContainer [2022-04-08 09:00:01,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:00:01,728 INFO L158 Benchmark]: Toolchain (without parser) took 13565.51ms. Allocated memory was 196.1MB in the beginning and 276.8MB in the end (delta: 80.7MB). Free memory was 141.4MB in the beginning and 140.4MB in the end (delta: 999.4kB). Peak memory consumption was 81.7MB. Max. memory is 8.0GB. [2022-04-08 09:00:01,728 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory was 157.7MB in the beginning and 157.6MB in the end (delta: 76.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:00:01,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.85ms. Allocated memory is still 196.1MB. Free memory was 141.2MB in the beginning and 166.1MB in the end (delta: -25.0MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-08 09:00:01,728 INFO L158 Benchmark]: Boogie Preprocessor took 42.38ms. Allocated memory is still 196.1MB. Free memory was 166.1MB in the beginning and 164.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:00:01,728 INFO L158 Benchmark]: RCFGBuilder took 278.20ms. Allocated memory is still 196.1MB. Free memory was 164.3MB in the beginning and 152.5MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:00:01,728 INFO L158 Benchmark]: TraceAbstraction took 13041.81ms. Allocated memory was 196.1MB in the beginning and 276.8MB in the end (delta: 80.7MB). Free memory was 151.8MB in the beginning and 140.4MB in the end (delta: 11.4MB). Peak memory consumption was 92.8MB. Max. memory is 8.0GB. [2022-04-08 09:00:01,729 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.11ms. Allocated memory is still 196.1MB. Free memory was 157.7MB in the beginning and 157.6MB in the end (delta: 76.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.85ms. Allocated memory is still 196.1MB. Free memory was 141.2MB in the beginning and 166.1MB in the end (delta: -25.0MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.38ms. Allocated memory is still 196.1MB. Free memory was 166.1MB in the beginning and 164.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 278.20ms. Allocated memory is still 196.1MB. Free memory was 164.3MB in the beginning and 152.5MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13041.81ms. Allocated memory was 196.1MB in the beginning and 276.8MB in the end (delta: 80.7MB). Free memory was 151.8MB in the beginning and 140.4MB in the end (delta: 11.4MB). Peak memory consumption was 92.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: 13.0s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 0.4s 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.5s 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-08 09:00:01,757 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...