/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-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:59:53,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:59:53,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:59:53,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:59:53,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:59:53,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:59:53,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:59:53,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:59:53,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:59:53,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:59:53,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:59:53,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:59:53,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:59:53,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:59:53,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:59:53,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:59:53,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:59:53,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:59:53,306 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:59:53,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:59:53,308 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:59:53,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:59:53,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:59:53,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:59:53,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:59:53,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:59:53,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:59:53,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:59:53,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:59:53,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:59:53,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:59:53,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:59:53,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:59:53,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:59:53,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:59:53,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:59:53,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:59:53,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:59:53,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:59:53,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:59:53,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:59:53,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:59:53,335 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:53,340 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:59:53,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:59:53,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:59:53,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:59:53,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:59:53,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:59:53,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:59:53,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:59:53,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:59:53,342 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:59:53,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:59:53,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:59:53,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:59:53,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:59:53,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:59:53,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:59:53,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:59:53,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:59:53,343 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:59:53,343 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:59:53,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:59:53,347 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 08:59:53,348 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:53,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:59:53,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:59:53,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:59:53,534 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:59:53,535 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:59:53,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix-2.c [2022-04-08 08:59:53,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4113eab1d/e882b9834e4e4c5eaabc8823dfe4dc6d/FLAG065c0ee1c [2022-04-08 08:59:53,929 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:59:53,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix-2.c [2022-04-08 08:59:53,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4113eab1d/e882b9834e4e4c5eaabc8823dfe4dc6d/FLAG065c0ee1c [2022-04-08 08:59:54,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4113eab1d/e882b9834e4e4c5eaabc8823dfe4dc6d [2022-04-08 08:59:54,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:59:54,373 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:59:54,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:59:54,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:59:54,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:59:54,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:59:54" (1/1) ... [2022-04-08 08:59:54,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e8c2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:54, skipping insertion in model container [2022-04-08 08:59:54,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:59:54" (1/1) ... [2022-04-08 08:59:54,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:59:54,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:59:54,500 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-2.c[320,333] [2022-04-08 08:59:54,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:59:54,517 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:59:54,524 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-2.c[320,333] [2022-04-08 08:59:54,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:59:54,538 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:59:54,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:54 WrapperNode [2022-04-08 08:59:54,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:59:54,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:59:54,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:59:54,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:59:54,546 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:54" (1/1) ... [2022-04-08 08:59:54,546 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:54" (1/1) ... [2022-04-08 08:59:54,550 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:54" (1/1) ... [2022-04-08 08:59:54,550 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:54" (1/1) ... [2022-04-08 08:59:54,560 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:54" (1/1) ... [2022-04-08 08:59:54,566 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:54" (1/1) ... [2022-04-08 08:59:54,570 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:54" (1/1) ... [2022-04-08 08:59:54,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:59:54,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:59:54,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:59:54,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:59:54,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:54" (1/1) ... [2022-04-08 08:59:54,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:59:54,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:54,622 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:54,627 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:54,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:59:54,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:59:54,662 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:59:54,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 08:59:54,662 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:59:54,662 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:59:54,662 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:59:54,662 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:59:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:59:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 08:59:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 08:59:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:59:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:59:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 08:59:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:59:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:59:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:59:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:59:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:59:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:59:54,706 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:59:54,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:59:54,843 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:59:54,847 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:59:54,848 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-08 08:59:54,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:59:54 BoogieIcfgContainer [2022-04-08 08:59:54,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:59:54,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:59:54,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:59:54,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:59:54,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:59:54" (1/3) ... [2022-04-08 08:59:54,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccd28eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:59:54, skipping insertion in model container [2022-04-08 08:59:54,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:59:54" (2/3) ... [2022-04-08 08:59:54,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccd28eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:59:54, skipping insertion in model container [2022-04-08 08:59:54,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:59:54" (3/3) ... [2022-04-08 08:59:54,875 INFO L111 eAbstractionObserver]: Analyzing ICFG matrix-2.c [2022-04-08 08:59:54,880 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:59:54,880 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:59:54,935 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:59:54,939 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:54,939 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:59:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 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:54,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 08:59:54,977 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:54,978 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:54,978 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:54,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:54,981 INFO L85 PathProgramCache]: Analyzing trace with hash -691068696, now seen corresponding path program 1 times [2022-04-08 08:59:54,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:54,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [775751719] [2022-04-08 08:59:55,004 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:59:55,005 INFO L85 PathProgramCache]: Analyzing trace with hash -691068696, now seen corresponding path program 2 times [2022-04-08 08:59:55,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:55,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276916072] [2022-04-08 08:59:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:55,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:55,078 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:59:55,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767149780] [2022-04-08 08:59:55,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:55,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:55,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:55,081 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:55,082 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:55,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 08:59:55,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:55,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 08:59:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:55,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:55,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2022-04-08 08:59:55,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#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); {32#true} is VALID [2022-04-08 08:59:55,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 08:59:55,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #82#return; {32#true} is VALID [2022-04-08 08:59:55,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret15 := main(); {32#true} is VALID [2022-04-08 08:59:55,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} ~N_LIN~0 := #t~nondet4;havoc #t~nondet4;~N_COL~0 := #t~nondet5;havoc #t~nondet5;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~nondet6 && #t~nondet6 <= 2147483647;~maior~0 := #t~nondet6;havoc #t~nondet6;~j~0 := 0; {52#(= main_~j~0 0)} is VALID [2022-04-08 08:59:55,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {52#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {56#(not (< 0 (mod main_~N_COL~0 4294967296)))} is VALID [2022-04-08 08:59:55,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {56#(not (< 0 (mod main_~N_COL~0 4294967296)))} ~j~0 := 0; {60#(and (= main_~j~0 0) (not (< 0 (mod main_~N_COL~0 4294967296))))} is VALID [2022-04-08 08:59:55,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#(and (= main_~j~0 0) (not (< 0 (mod main_~N_COL~0 4294967296))))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {33#false} is VALID [2022-04-08 08:59:55,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem14 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {33#false} is VALID [2022-04-08 08:59:55,300 INFO L272 TraceCheckUtils]: 10: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem14 < ~maior~0 then 1 else 0)); {33#false} is VALID [2022-04-08 08:59:55,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 08:59:55,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 08:59:55,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 08:59:55,301 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:55,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 08:59:55,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:55,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276916072] [2022-04-08 08:59:55,302 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:59:55,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767149780] [2022-04-08 08:59:55,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767149780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:55,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:55,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:55,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:55,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [775751719] [2022-04-08 08:59:55,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [775751719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:55,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:55,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:55,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090852870] [2022-04-08 08:59:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:55,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-08 08:59:55,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:55,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:55,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:55,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:59:55,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:55,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:59:55,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:59:55,344 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 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 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:55,530 INFO L93 Difference]: Finished difference Result 68 states and 100 transitions. [2022-04-08 08:59:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:59:55,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-08 08:59:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-08 08:59:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-08 08:59:55,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-08 08:59:55,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:55,630 INFO L225 Difference]: With dead ends: 68 [2022-04-08 08:59:55,631 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 08:59:55,633 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:55,638 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:55,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 93 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:59:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 08:59:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-04-08 08:59:55,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:55,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:55,666 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:55,666 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:55,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:55,671 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-08 08:59:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-08 08:59:55,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:55,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:55,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-08 08:59:55,672 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-08 08:59:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:55,675 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-08 08:59:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-08 08:59:55,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:55,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:55,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:55,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-08 08:59:55,687 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2022-04-08 08:59:55,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:55,687 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-08 08:59:55,687 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:55,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-08 08:59:55,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-08 08:59:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 08:59:55,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:55,708 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:55,724 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:55,923 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:55,924 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:55,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1002836895, now seen corresponding path program 1 times [2022-04-08 08:59:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:55,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1212374765] [2022-04-08 08:59:55,968 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 08:59:55,968 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1002836895, now seen corresponding path program 2 times [2022-04-08 08:59:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:55,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919857644] [2022-04-08 08:59:55,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:55,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:55,988 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:59:55,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598957823] [2022-04-08 08:59:55,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:55,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:55,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:55,996 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:55,997 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:56,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:56,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:59:56,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 08:59:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:59:56,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:59:56,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2022-04-08 08:59:56,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#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); {334#true} is VALID [2022-04-08 08:59:56,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-08 08:59:56,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #82#return; {334#true} is VALID [2022-04-08 08:59:56,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret15 := main(); {334#true} is VALID [2022-04-08 08:59:56,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} ~N_LIN~0 := #t~nondet4;havoc #t~nondet4;~N_COL~0 := #t~nondet5;havoc #t~nondet5;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~nondet6 && #t~nondet6 <= 2147483647;~maior~0 := #t~nondet6;havoc #t~nondet6;~j~0 := 0; {334#true} is VALID [2022-04-08 08:59:56,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {334#true} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {357#(= main_~k~0 0)} is VALID [2022-04-08 08:59:56,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {357#(= main_~k~0 0)} assume !(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296); {361#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-08 08:59:56,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {361#(not (< 0 (mod main_~N_LIN~0 4294967296)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {361#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-08 08:59:56,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#(not (< 0 (mod main_~N_LIN~0 4294967296)))} assume !(~j~0 % 4294967296 < ~N_COL~0 % 4294967296); {361#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-08 08:59:56,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {361#(not (< 0 (mod main_~N_LIN~0 4294967296)))} ~j~0 := 0; {361#(not (< 0 (mod main_~N_LIN~0 4294967296)))} is VALID [2022-04-08 08:59:56,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#(not (< 0 (mod main_~N_LIN~0 4294967296)))} assume !!(~j~0 % 4294967296 < ~N_COL~0 % 4294967296);~k~0 := 0; {374#(and (= main_~k~0 0) (not (< 0 (mod main_~N_LIN~0 4294967296))))} is VALID [2022-04-08 08:59:56,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {374#(and (= main_~k~0 0) (not (< 0 (mod main_~N_LIN~0 4294967296))))} assume !!(~k~0 % 4294967296 < ~N_LIN~0 % 4294967296);call #t~mem14 := read~int(~#matriz~0.base, ~#matriz~0.offset + ~j~0 % 4294967296 * (4 * (~N_LIN~0 % 4294967296)) + 4 * (~k~0 % 4294967296), 4); {335#false} is VALID [2022-04-08 08:59:56,186 INFO L272 TraceCheckUtils]: 13: Hoare triple {335#false} call __VERIFIER_assert((if #t~mem14 < ~maior~0 then 1 else 0)); {335#false} is VALID [2022-04-08 08:59:56,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2022-04-08 08:59:56,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2022-04-08 08:59:56,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} assume !false; {335#false} is VALID [2022-04-08 08:59:56,187 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:56,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 08:59:56,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:59:56,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919857644] [2022-04-08 08:59:56,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:59:56,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598957823] [2022-04-08 08:59:56,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598957823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:56,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:56,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:56,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:59:56,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1212374765] [2022-04-08 08:59:56,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1212374765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:59:56,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:59:56,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:59:56,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865460476] [2022-04-08 08:59:56,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:59:56,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-08 08:59:56,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:59:56,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:56,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:56,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:59:56,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:56,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:59:56,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:59:56,206 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:56,311 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-08 08:59:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:59:56,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2022-04-08 08:59:56,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:59:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-08 08:59:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-08 08:59:56,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-08 08:59:56,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:56,390 INFO L225 Difference]: With dead ends: 57 [2022-04-08 08:59:56,390 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 08:59:56,390 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:56,391 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:59:56,391 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 62 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:59:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 08:59:56,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2022-04-08 08:59:56,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:59:56,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:56,395 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:56,395 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:56,396 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-08 08:59:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 08:59:56,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:56,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:56,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-08 08:59:56,397 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-08 08:59:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:59:56,398 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-08 08:59:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-08 08:59:56,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:59:56,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:59:56,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:59:56,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:59:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:59:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-08 08:59:56,400 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2022-04-08 08:59:56,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:59:56,400 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-08 08:59:56,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:56,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-08 08:59:56,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:59:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 08:59:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:59:56,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:59:56,448 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:59:56,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 08:59:56,664 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:56,665 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:59:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:59:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash -230396703, now seen corresponding path program 1 times [2022-04-08 08:59:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:59:56,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1208087793] [2022-04-08 08:59:56,729 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:56,752 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 08:59:56,752 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:59:56,752 INFO L85 PathProgramCache]: Analyzing trace with hash -230396703, now seen corresponding path program 2 times [2022-04-08 08:59:56,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:59:56,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369183416] [2022-04-08 08:59:56,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:59:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:59:56,767 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:59:56,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208394597] [2022-04-08 08:59:56,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:59:56,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:59:56,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:59:56,768 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:56,769 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:56,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:59:56,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-08 08:59:56,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 08:59:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 08:59:56,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 08:59:56,828 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 08:59:56,828 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 08:59:56,829 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 08:59:56,848 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:57,031 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:57,033 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 08:59:57,035 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 08:59:57,052 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 08:59:57,052 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 08:59:57,052 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 08:59:57,052 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 08:59:57,052 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 08:59:57,052 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 08:59:57,052 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-08 08:59:57,053 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-08 08:59:57,054 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-08 08:59:57,054 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 08:59:57,054 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-08 08:59:57,054 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-08 08:59:57,054 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-08 08:59:57,054 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-04-08 08:59:57,054 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 08:59:57,054 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 08:59:57,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 08:59:57 BoogieIcfgContainer [2022-04-08 08:59:57,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 08:59:57,055 INFO L158 Benchmark]: Toolchain (without parser) took 2682.59ms. Allocated memory is still 195.0MB. Free memory was 150.0MB in the beginning and 104.7MB in the end (delta: 45.3MB). Peak memory consumption was 46.0MB. Max. memory is 8.0GB. [2022-04-08 08:59:57,056 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory is still 165.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:59:57,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.16ms. Allocated memory is still 195.0MB. Free memory was 150.0MB in the beginning and 173.7MB in the end (delta: -23.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 08:59:57,056 INFO L158 Benchmark]: Boogie Preprocessor took 33.34ms. Allocated memory is still 195.0MB. Free memory was 173.7MB in the beginning and 172.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 08:59:57,056 INFO L158 Benchmark]: RCFGBuilder took 276.53ms. Allocated memory is still 195.0MB. Free memory was 172.1MB in the beginning and 159.0MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 08:59:57,056 INFO L158 Benchmark]: TraceAbstraction took 2204.73ms. Allocated memory is still 195.0MB. Free memory was 158.6MB in the beginning and 104.7MB in the end (delta: 53.9MB). Peak memory consumption was 54.7MB. Max. memory is 8.0GB. [2022-04-08 08:59:57,057 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.13ms. Allocated memory is still 195.0MB. Free memory is still 165.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 164.16ms. Allocated memory is still 195.0MB. Free memory was 150.0MB in the beginning and 173.7MB in the end (delta: -23.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.34ms. Allocated memory is still 195.0MB. Free memory was 173.7MB in the beginning and 172.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 276.53ms. Allocated memory is still 195.0MB. Free memory was 172.1MB in the beginning and 159.0MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2204.73ms. Allocated memory is still 195.0MB. Free memory was 158.6MB in the beginning and 104.7MB in the end (delta: 53.9MB). Peak memory consumption was 54.7MB. 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 - CounterExampleResult [Line: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] unsigned int N_LIN=__VERIFIER_nondet_uint(); [L17] unsigned int N_COL=__VERIFIER_nondet_uint(); [L18] unsigned int j,k; [L19] int matriz[N_COL][N_LIN], maior; [L21] maior = __VERIFIER_nondet_int() [L22] j=0 [L22] COND TRUE jmaior [L28] EXPR matriz[j][k] [L28] maior = matriz[j][k] [L23] k++ [L23] COND FALSE !(k