./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/cart.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/cart.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:49:41,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:49:41,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:49:41,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:49:41,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:49:41,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:49:41,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:49:41,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:49:41,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:49:41,517 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:49:41,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:49:41,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:49:41,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:49:41,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:49:41,519 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:49:41,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:49:41,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:49:41,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:49:41,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:49:41,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:49:41,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:49:41,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:49:41,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:49:41,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:49:41,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:49:41,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:49:41,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:49:41,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:49:41,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:49:41,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:49:41,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:49:41,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:49:41,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:49:41,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:49:41,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:49:41,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:49:41,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:49:41,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:49:41,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:49:41,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:49:41,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:49:41,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:49:41,532 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2024-11-08 13:49:41,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:49:41,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:49:41,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:49:41,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:49:41,788 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:49:41,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2024-11-08 13:49:43,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:49:43,389 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:49:43,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2024-11-08 13:49:43,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a1a6796/b76b4f2384414106860b5ea027b433c9/FLAG2d95c0b39 [2024-11-08 13:49:43,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a1a6796/b76b4f2384414106860b5ea027b433c9 [2024-11-08 13:49:43,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:49:43,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:49:43,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:49:43,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:49:43,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:49:43,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:43,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5169469b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43, skipping insertion in model container [2024-11-08 13:49:43,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:43,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:49:43,819 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2024-11-08 13:49:43,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:49:43,834 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:49:43,880 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2024-11-08 13:49:43,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:49:43,945 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:49:43,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43 WrapperNode [2024-11-08 13:49:43,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:49:43,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:49:43,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:49:43,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:49:43,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:43,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:44,018 INFO L138 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2024-11-08 13:49:44,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:49:44,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:49:44,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:49:44,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:49:44,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:44,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:44,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:44,050 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2024-11-08 13:49:44,050 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:44,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:44,058 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:44,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:44,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:44,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:44,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:49:44,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:49:44,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:49:44,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:49:44,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (1/1) ... [2024-11-08 13:49:44,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:49:44,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:49:44,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:49:44,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:49:44,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:49:44,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:49:44,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:49:44,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:49:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:49:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:49:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:49:44,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:49:44,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:49:44,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:49:44,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:49:44,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:49:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:49:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:49:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:49:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:49:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:49:44,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:49:44,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:49:44,313 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:49:44,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:49:44,486 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 13:49:44,486 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:49:44,496 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:49:44,498 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 13:49:44,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:49:44 BoogieIcfgContainer [2024-11-08 13:49:44,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:49:44,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:49:44,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:49:44,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:49:44,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:49:43" (1/3) ... [2024-11-08 13:49:44,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f80fc9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:49:44, skipping insertion in model container [2024-11-08 13:49:44,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:43" (2/3) ... [2024-11-08 13:49:44,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f80fc9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:49:44, skipping insertion in model container [2024-11-08 13:49:44,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:49:44" (3/3) ... [2024-11-08 13:49:44,510 INFO L112 eAbstractionObserver]: Analyzing ICFG cart.i [2024-11-08 13:49:44,528 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:49:44,528 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:49:44,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:49:44,584 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42cc8d6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:49:44,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:49:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 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) [2024-11-08 13:49:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 13:49:44,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:44,597 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:44,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:44,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:44,603 INFO L85 PathProgramCache]: Analyzing trace with hash -680841488, now seen corresponding path program 1 times [2024-11-08 13:49:44,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:44,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281614255] [2024-11-08 13:49:44,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:44,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:44,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:44,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281614255] [2024-11-08 13:49:44,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281614255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:49:44,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:49:44,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:49:44,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440320222] [2024-11-08 13:49:44,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:49:44,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:49:44,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:44,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:49:44,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:49:44,817 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 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 has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-11-08 13:49:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:44,830 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2024-11-08 13:49:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:49:44,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2024-11-08 13:49:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:44,839 INFO L225 Difference]: With dead ends: 34 [2024-11-08 13:49:44,839 INFO L226 Difference]: Without dead ends: 17 [2024-11-08 13:49:44,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:49:44,846 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:44,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:49:44,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-08 13:49:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-08 13:49:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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) [2024-11-08 13:49:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-11-08 13:49:44,881 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2024-11-08 13:49:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:44,881 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-08 13:49:44,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-11-08 13:49:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2024-11-08 13:49:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 13:49:44,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:44,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:44,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:49:44,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:44,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1910225148, now seen corresponding path program 1 times [2024-11-08 13:49:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:44,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148313487] [2024-11-08 13:49:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:44,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:45,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:45,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148313487] [2024-11-08 13:49:45,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148313487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:49:45,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:49:45,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:49:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908242404] [2024-11-08 13:49:45,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:49:45,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:49:45,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:45,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:49:45,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:49:45,074 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2024-11-08 13:49:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:45,129 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2024-11-08 13:49:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:49:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2024-11-08 13:49:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:45,130 INFO L225 Difference]: With dead ends: 36 [2024-11-08 13:49:45,130 INFO L226 Difference]: Without dead ends: 21 [2024-11-08 13:49:45,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:49:45,132 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:45,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 48 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:49:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-08 13:49:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-08 13:49:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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) [2024-11-08 13:49:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-11-08 13:49:45,137 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2024-11-08 13:49:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:45,138 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-08 13:49:45,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2024-11-08 13:49:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-11-08 13:49:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 13:49:45,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:45,139 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:45,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:49:45,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:45,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1849394690, now seen corresponding path program 1 times [2024-11-08 13:49:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:45,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463263234] [2024-11-08 13:49:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:45,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:45,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463263234] [2024-11-08 13:49:45,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463263234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:49:45,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:49:45,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:49:45,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635732028] [2024-11-08 13:49:45,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:49:45,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:49:45,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:45,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:49:45,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:49:45,302 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-08 13:49:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:45,343 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-11-08 13:49:45,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:49:45,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16 [2024-11-08 13:49:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:45,347 INFO L225 Difference]: With dead ends: 31 [2024-11-08 13:49:45,347 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 13:49:45,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:49:45,349 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:45,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 47 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:49:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 13:49:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-08 13:49:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 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) [2024-11-08 13:49:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-11-08 13:49:45,358 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2024-11-08 13:49:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:45,358 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-11-08 13:49:45,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2024-11-08 13:49:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-11-08 13:49:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 13:49:45,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:45,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:45,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:49:45,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:45,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:45,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1690179633, now seen corresponding path program 1 times [2024-11-08 13:49:45,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:45,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089210518] [2024-11-08 13:49:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:49:45,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:45,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089210518] [2024-11-08 13:49:45,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089210518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:49:45,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:49:45,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:49:45,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508325508] [2024-11-08 13:49:45,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:49:45,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:49:45,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:45,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:49:45,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:49:45,468 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2024-11-08 13:49:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:45,488 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2024-11-08 13:49:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:49:45,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 20 [2024-11-08 13:49:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:45,490 INFO L225 Difference]: With dead ends: 37 [2024-11-08 13:49:45,490 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 13:49:45,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:49:45,494 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:45,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:49:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 13:49:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 13:49:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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) [2024-11-08 13:49:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-08 13:49:45,502 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2024-11-08 13:49:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:45,503 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-08 13:49:45,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2024-11-08 13:49:45,503 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-08 13:49:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 13:49:45,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:45,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:45,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:49:45,505 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:45,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:45,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1795441037, now seen corresponding path program 1 times [2024-11-08 13:49:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:45,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998364808] [2024-11-08 13:49:45,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:45,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:46,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:46,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998364808] [2024-11-08 13:49:46,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998364808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:49:46,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031110931] [2024-11-08 13:49:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:46,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:49:46,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:49:46,089 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) [2024-11-08 13:49:46,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:49:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:46,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 13:49:46,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:49:46,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2024-11-08 13:49:46,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:46,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-08 13:49:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:46,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:49:46,597 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-08 13:49:46,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1596 treesize of output 1405 [2024-11-08 13:49:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:49:46,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031110931] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:49:46,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:49:46,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2024-11-08 13:49:46,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888326901] [2024-11-08 13:49:46,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:49:46,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 13:49:46,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:46,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 13:49:46,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-08 13:49:46,797 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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) [2024-11-08 13:49:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:47,051 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-11-08 13:49:47,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 13:49:47,052 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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) Word has length 20 [2024-11-08 13:49:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:47,052 INFO L225 Difference]: With dead ends: 38 [2024-11-08 13:49:47,052 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 13:49:47,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-08 13:49:47,053 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:47,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 126 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:49:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 13:49:47,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-08 13:49:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 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) [2024-11-08 13:49:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-08 13:49:47,058 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2024-11-08 13:49:47,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:47,058 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-08 13:49:47,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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) [2024-11-08 13:49:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-08 13:49:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 13:49:47,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:47,059 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:47,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 13:49:47,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:49:47,264 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:47,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1534874359, now seen corresponding path program 1 times [2024-11-08 13:49:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:47,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885883626] [2024-11-08 13:49:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:49:47,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:47,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885883626] [2024-11-08 13:49:47,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885883626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:49:47,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447905741] [2024-11-08 13:49:47,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:47,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:49:47,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:49:47,427 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) [2024-11-08 13:49:47,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:49:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:47,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 13:49:47,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:49:47,588 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2024-11-08 13:49:47,596 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2024-11-08 13:49:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:47,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:49:47,770 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 29 [2024-11-08 13:49:47,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:47,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-08 13:49:47,789 INFO L378 Elim1Store]: Elim1 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 39 treesize of output 35 [2024-11-08 13:49:47,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:47,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2024-11-08 13:49:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:49:47,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447905741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:49:47,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:49:47,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2024-11-08 13:49:47,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701167607] [2024-11-08 13:49:47,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:49:47,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 13:49:47,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:47,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 13:49:47,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-08 13:49:47,839 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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) [2024-11-08 13:49:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:47,994 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2024-11-08 13:49:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 13:49:47,995 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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) Word has length 23 [2024-11-08 13:49:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:47,995 INFO L225 Difference]: With dead ends: 49 [2024-11-08 13:49:47,995 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:49:47,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-08 13:49:47,996 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:47,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 127 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:49:47,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:49:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-08 13:49:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 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) [2024-11-08 13:49:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2024-11-08 13:49:48,001 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2024-11-08 13:49:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:48,002 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2024-11-08 13:49:48,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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) [2024-11-08 13:49:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2024-11-08 13:49:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 13:49:48,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:48,003 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:48,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 13:49:48,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 13:49:48,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:48,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:48,207 INFO L85 PathProgramCache]: Analyzing trace with hash 379469720, now seen corresponding path program 2 times [2024-11-08 13:49:48,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:48,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66174467] [2024-11-08 13:49:48,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:48,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:48,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:48,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66174467] [2024-11-08 13:49:48,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66174467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:49:48,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632364657] [2024-11-08 13:49:48,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:49:48,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:49:48,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:49:48,534 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) [2024-11-08 13:49:48,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 13:49:48,630 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:49:48,630 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:49:48,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 13:49:48,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:49:48,656 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:49:48,660 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:49:48,737 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 14 [2024-11-08 13:49:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:48,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:49:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:48,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632364657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:49:48,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:49:48,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-08 13:49:48,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820596587] [2024-11-08 13:49:48,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:49:48,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 13:49:48,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:48,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 13:49:48,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:49:48,831 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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) [2024-11-08 13:49:48,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:48,953 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2024-11-08 13:49:48,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:49:48,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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) Word has length 24 [2024-11-08 13:49:48,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:48,954 INFO L225 Difference]: With dead ends: 67 [2024-11-08 13:49:48,954 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 13:49:48,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-08 13:49:48,956 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:48,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:49:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 13:49:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-08 13:49:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 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) [2024-11-08 13:49:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-08 13:49:48,961 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2024-11-08 13:49:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:48,961 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-08 13:49:48,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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) [2024-11-08 13:49:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-08 13:49:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 13:49:48,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:48,962 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:48,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 13:49:49,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:49:49,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:49,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:49,169 INFO L85 PathProgramCache]: Analyzing trace with hash -3886178, now seen corresponding path program 3 times [2024-11-08 13:49:49,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:49,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548863336] [2024-11-08 13:49:49,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:49,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:49,999 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:49,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:50,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548863336] [2024-11-08 13:49:50,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548863336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:49:50,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671308683] [2024-11-08 13:49:50,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 13:49:50,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:49:50,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:49:50,002 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) [2024-11-08 13:49:50,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 13:49:50,140 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-08 13:49:50,140 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:49:50,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 13:49:50,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:49:50,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-11-08 13:49:50,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2024-11-08 13:49:50,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-08 13:49:50,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:49:50,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2024-11-08 13:49:50,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:50,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2024-11-08 13:49:50,455 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:49:50,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-11-08 13:49:50,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-08 13:49:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:50,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:49:50,717 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 28 [2024-11-08 13:49:50,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:50,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 84 [2024-11-08 13:49:50,814 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse8 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse3 (store .cse8 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) |c_ULTIMATE.start_main_~order~0#1|)) (.cse5 (select .cse8 .cse4))) (and (forall ((v_ArrVal_380 Int)) (or (forall ((v_ArrVal_386 (Array Int Int)) (v_arrayElimCell_23 Int)) (or (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 .cse4 v_ArrVal_380)) v_arrayElimCell_23 v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 .cse1) (+ (select .cse0 .cse2) 1))) (= |c_ULTIMATE.start_main_~i~0#1.base| v_arrayElimCell_23))) (< v_ArrVal_380 .cse5))) (forall ((v_ArrVal_380 Int)) (or (forall ((v_ArrVal_386 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 .cse4 v_ArrVal_380)) 0 v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse6 .cse1) (+ (select .cse6 .cse2) 1)))) (< v_ArrVal_380 .cse5))) (or (forall ((v_ArrVal_380 Int) (v_ArrVal_386 (Array Int Int)) (v_arrayElimCell_23 Int)) (or (let ((.cse7 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 .cse4 v_ArrVal_380)) v_arrayElimCell_23 v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse7 .cse1) (+ (select .cse7 .cse2) 1))) (< v_ArrVal_380 .cse5))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.offset|))))) |c_ULTIMATE.start_main_#t~short8#1|) is different from false [2024-11-08 13:49:50,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:50,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 210 treesize of output 183 [2024-11-08 13:49:50,924 INFO L349 Elim1Store]: treesize reduction 35, result has 36.4 percent of original size [2024-11-08 13:49:50,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 184 [2024-11-08 13:49:50,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:50,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 108 [2024-11-08 13:49:50,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:50,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 309 [2024-11-08 13:49:51,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:51,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 175 treesize of output 195 [2024-11-08 13:49:51,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 134 [2024-11-08 13:49:51,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2024-11-08 13:49:51,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 13:49:51,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2024-11-08 13:49:51,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:51,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2024-11-08 13:49:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 13:49:51,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671308683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:49:51,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:49:51,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2024-11-08 13:49:51,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49244086] [2024-11-08 13:49:51,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:49:51,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 13:49:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:51,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 13:49:51,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=457, Unknown=1, NotChecked=44, Total=600 [2024-11-08 13:49:51,464 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 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) [2024-11-08 13:49:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:51,834 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-11-08 13:49:51,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 13:49:51,834 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 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) Word has length 28 [2024-11-08 13:49:51,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:51,835 INFO L225 Difference]: With dead ends: 55 [2024-11-08 13:49:51,835 INFO L226 Difference]: Without dead ends: 50 [2024-11-08 13:49:51,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=684, Unknown=1, NotChecked=56, Total=930 [2024-11-08 13:49:51,836 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 102 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:51,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 237 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 181 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2024-11-08 13:49:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-08 13:49:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-08 13:49:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 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) [2024-11-08 13:49:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2024-11-08 13:49:51,842 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 28 [2024-11-08 13:49:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:51,842 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-11-08 13:49:51,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 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) [2024-11-08 13:49:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-11-08 13:49:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 13:49:51,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:51,843 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:51,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 13:49:52,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:49:52,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:52,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash 194884952, now seen corresponding path program 2 times [2024-11-08 13:49:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:52,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230035347] [2024-11-08 13:49:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:52,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:52,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:52,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230035347] [2024-11-08 13:49:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230035347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:49:52,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725072938] [2024-11-08 13:49:52,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:49:52,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:49:52,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:49:52,774 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) [2024-11-08 13:49:52,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 13:49:52,892 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:49:52,892 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:49:52,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 13:49:52,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:49:52,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:49:52,917 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-08 13:49:52,920 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:49:52,928 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 13:49:52,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 13:49:53,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-08 13:49:53,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-11-08 13:49:53,169 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:49:53,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 128 [2024-11-08 13:49:53,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 23 [2024-11-08 13:49:53,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2024-11-08 13:49:53,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2024-11-08 13:49:53,271 INFO L378 Elim1Store]: Elim1 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 35 treesize of output 19 [2024-11-08 13:49:53,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:49:53,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:53,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-08 13:49:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:53,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:49:53,485 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-11-08 13:49:53,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1950 treesize of output 1645 [2024-11-08 13:49:53,593 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_516 (Array Int Int))) (or (not (= v_ArrVal_516 (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (store (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) .cse0 (select v_ArrVal_516 .cse0))) .cse1 (select v_ArrVal_516 .cse1))))) (= |c_ULTIMATE.start_main_~i~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (forall ((v_ArrVal_514 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.base|))) is different from false [2024-11-08 13:49:57,642 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|))) (and (forall ((v_ArrVal_511 (Array Int Int))) (or (forall ((v_ArrVal_516 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_511)) (.cse3 (select v_ArrVal_511 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= v_ArrVal_516 (let ((.cse4 (+ .cse3 4))) (store (let ((.cse2 (+ .cse3 8))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_516 .cse2))) .cse4 (select v_ArrVal_516 .cse4))))) (= (select (select (store .cse0 .cse1 v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse3)))) (not (= v_ArrVal_511 (store (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) .cse5 (select v_ArrVal_511 .cse5)) .cse6 (select v_ArrVal_511 .cse6)))))) (forall ((v_ArrVal_514 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_508 Int)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse7 .cse5 v_ArrVal_509) .cse6 v_ArrVal_508)) .cse1 v_ArrVal_514) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse1))))) is different from false [2024-11-08 13:50:02,008 INFO L378 Elim1Store]: Elim1 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 90 treesize of output 88 [2024-11-08 13:50:02,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:02,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 95 [2024-11-08 13:50:02,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:02,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 80 [2024-11-08 13:50:02,086 INFO L378 Elim1Store]: Elim1 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 78 treesize of output 70 [2024-11-08 13:50:02,097 INFO L378 Elim1Store]: Elim1 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 57 treesize of output 55 [2024-11-08 13:50:02,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2024-11-08 13:50:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-11-08 13:50:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725072938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:50:02,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:50:02,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-11-08 13:50:02,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711380867] [2024-11-08 13:50:02,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:50:02,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 13:50:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:02,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 13:50:02,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=426, Unknown=4, NotChecked=86, Total=600 [2024-11-08 13:50:02,221 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 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) [2024-11-08 13:50:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:03,210 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2024-11-08 13:50:03,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 13:50:03,210 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 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) Word has length 31 [2024-11-08 13:50:03,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:03,211 INFO L225 Difference]: With dead ends: 55 [2024-11-08 13:50:03,211 INFO L226 Difference]: Without dead ends: 53 [2024-11-08 13:50:03,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=174, Invalid=822, Unknown=4, NotChecked=122, Total=1122 [2024-11-08 13:50:03,212 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 67 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:03,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 298 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 99 Unchecked, 0.5s Time] [2024-11-08 13:50:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-08 13:50:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-11-08 13:50:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 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) [2024-11-08 13:50:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-11-08 13:50:03,218 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 31 [2024-11-08 13:50:03,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:03,218 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-11-08 13:50:03,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 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) [2024-11-08 13:50:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-11-08 13:50:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 13:50:03,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:03,219 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:03,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 13:50:03,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:50:03,420 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:03,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:03,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1832566487, now seen corresponding path program 4 times [2024-11-08 13:50:03,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:03,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304058532] [2024-11-08 13:50:03,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:50:04,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304058532] [2024-11-08 13:50:04,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304058532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:50:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685259237] [2024-11-08 13:50:04,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 13:50:04,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:50:04,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:50:04,127 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) [2024-11-08 13:50:04,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 13:50:04,479 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 13:50:04,479 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:50:04,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-08 13:50:04,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:50:04,545 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:50:04,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:50:04,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-08 13:50:04,675 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 13:50:04,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 13:50:04,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 13:50:04,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-11-08 13:50:05,006 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 13:50:05,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2024-11-08 13:50:05,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2024-11-08 13:50:05,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-08 13:50:05,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:50:05,188 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 13:50:05,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 58 [2024-11-08 13:50:05,219 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:50:05,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 19 [2024-11-08 13:50:05,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2024-11-08 13:50:05,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2024-11-08 13:50:05,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-08 13:50:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:50:05,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:50:05,733 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_680 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_675) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_680) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1)))) is different from false [2024-11-08 13:50:05,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:05,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 118 [2024-11-08 13:50:06,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:06,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 241 [2024-11-08 13:50:06,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 166 [2024-11-08 13:50:06,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2024-11-08 13:50:06,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:06,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2024-11-08 13:50:06,512 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 4 [2024-11-08 13:50:06,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:06,718 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-08 13:50:06,721 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:50:06,723 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 9 [2024-11-08 13:50:06,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2024-11-08 13:50:06,731 INFO L378 Elim1Store]: Elim1 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 5 treesize of output 3 [2024-11-08 13:50:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-08 13:50:06,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685259237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:50:06,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:50:06,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 26 [2024-11-08 13:50:06,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538485063] [2024-11-08 13:50:06,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:50:06,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 13:50:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:06,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 13:50:06,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=527, Unknown=7, NotChecked=46, Total=650 [2024-11-08 13:50:06,740 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 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) [2024-11-08 13:50:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:09,542 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions. [2024-11-08 13:50:09,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 13:50:09,543 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 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) Word has length 32 [2024-11-08 13:50:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:09,544 INFO L225 Difference]: With dead ends: 111 [2024-11-08 13:50:09,544 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 13:50:09,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=260, Invalid=1454, Unknown=12, NotChecked=80, Total=1806 [2024-11-08 13:50:09,545 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 213 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 38 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:09,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 371 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 324 Invalid, 13 Unknown, 79 Unchecked, 1.3s Time] [2024-11-08 13:50:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 13:50:09,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2024-11-08 13:50:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 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) [2024-11-08 13:50:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2024-11-08 13:50:09,561 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 32 [2024-11-08 13:50:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:09,561 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2024-11-08 13:50:09,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 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) [2024-11-08 13:50:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2024-11-08 13:50:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:50:09,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:09,562 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:09,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 13:50:09,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:50:09,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:09,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:09,763 INFO L85 PathProgramCache]: Analyzing trace with hash -974282402, now seen corresponding path program 3 times [2024-11-08 13:50:09,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:09,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371447752] [2024-11-08 13:50:09,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:50:10,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:10,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371447752] [2024-11-08 13:50:10,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371447752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:50:10,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101084344] [2024-11-08 13:50:10,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 13:50:10,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:50:10,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:50:10,352 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:50:10,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 13:50:10,502 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-08 13:50:10,503 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:50:10,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-08 13:50:10,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:50:10,558 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:50:10,565 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-08 13:50:10,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-08 13:50:10,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-08 13:50:11,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 59 [2024-11-08 13:50:11,056 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-08 13:50:11,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-08 13:50:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:50:11,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:50:14,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:14,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 61 [2024-11-08 13:50:14,862 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-08 13:50:14,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 231 [2024-11-08 13:50:14,883 INFO L378 Elim1Store]: Elim1 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 202 treesize of output 182 [2024-11-08 13:50:14,938 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:50:14,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:50:14,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:50:14,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:50:14,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:50:14,942 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:50:14,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 1 [2024-11-08 13:50:15,007 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2024-11-08 13:50:15,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2024-11-08 13:50:15,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2024-11-08 13:50:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:50:15,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101084344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:50:15,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:50:15,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 25 [2024-11-08 13:50:15,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063097748] [2024-11-08 13:50:15,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:50:15,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 13:50:15,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:15,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 13:50:15,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-11-08 13:50:15,055 INFO L87 Difference]: Start difference. First operand 81 states and 108 transitions. Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 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) [2024-11-08 13:50:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:16,923 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2024-11-08 13:50:16,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 13:50:16,924 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 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) Word has length 34 [2024-11-08 13:50:16,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:16,924 INFO L225 Difference]: With dead ends: 99 [2024-11-08 13:50:16,924 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 13:50:16,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 13:50:16,925 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 86 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:16,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 422 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 13:50:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 13:50:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2024-11-08 13:50:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 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) [2024-11-08 13:50:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2024-11-08 13:50:16,934 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 34 [2024-11-08 13:50:16,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:16,934 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2024-11-08 13:50:16,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 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) [2024-11-08 13:50:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2024-11-08 13:50:16,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 13:50:16,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:16,935 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:16,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 13:50:17,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:50:17,136 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:17,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:17,137 INFO L85 PathProgramCache]: Analyzing trace with hash -820908507, now seen corresponding path program 1 times [2024-11-08 13:50:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:17,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993626330] [2024-11-08 13:50:17,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:50:18,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:18,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993626330] [2024-11-08 13:50:18,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993626330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:50:18,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120421664] [2024-11-08 13:50:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:18,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:50:18,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:50:18,512 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:50:18,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 13:50:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:18,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-08 13:50:18,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:50:18,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:50:18,775 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-08 13:50:18,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 13:50:18,790 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 1 [2024-11-08 13:50:18,877 INFO L378 Elim1Store]: Elim1 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 [2024-11-08 13:50:18,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-08 13:50:18,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:50:18,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-08 13:50:18,940 INFO L349 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2024-11-08 13:50:18,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2024-11-08 13:50:19,182 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 13:50:19,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 22 [2024-11-08 13:50:19,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2024-11-08 13:50:19,212 INFO L378 Elim1Store]: Elim1 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 7 treesize of output 3 [2024-11-08 13:50:19,436 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 13:50:19,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 59 [2024-11-08 13:50:19,458 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:50:19,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2024-11-08 13:50:19,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2024-11-08 13:50:19,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2024-11-08 13:50:19,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:19,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-08 13:50:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:50:19,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:50:19,855 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1008 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1008) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1009) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1)))) is different from false [2024-11-08 13:50:19,938 WARN L851 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1002 Int)) (let ((.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (< v_ArrVal_1002 (select .cse0 .cse1)) (not (= v_ArrVal_996 (store (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) .cse2 (select v_ArrVal_996 .cse2)) .cse1 (select v_ArrVal_996 .cse1)))) (let ((.cse3 (select (let ((.cse4 (select v_ArrVal_996 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 .cse2 |c_ULTIMATE.start_main_~order~0#1|) .cse1 v_ArrVal_1002)) .cse4 v_ArrVal_1008) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_996) .cse4) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) v_ArrVal_1009)) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse3 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (+ (select .cse3 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1))))))) is different from false [2024-11-08 13:50:19,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:19,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 86 [2024-11-08 13:50:20,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:20,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 291 treesize of output 303 [2024-11-08 13:50:20,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2024-11-08 13:50:20,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2024-11-08 13:50:20,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:20,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2024-11-08 13:50:20,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-08 13:50:20,478 INFO L378 Elim1Store]: Elim1 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 6 treesize of output 4 [2024-11-08 13:50:20,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:20,619 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-08 13:50:20,621 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:50:20,623 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 9 [2024-11-08 13:50:20,625 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 9 [2024-11-08 13:50:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2024-11-08 13:50:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120421664] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:50:20,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:50:20,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2024-11-08 13:50:20,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785157915] [2024-11-08 13:50:20,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:50:20,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 13:50:20,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:50:20,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 13:50:20,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=504, Unknown=4, NotChecked=94, Total=702 [2024-11-08 13:50:20,703 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 27 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 27 states have internal predecessors, (92), 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) [2024-11-08 13:50:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:50:21,314 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2024-11-08 13:50:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 13:50:21,315 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 27 states have internal predecessors, (92), 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) Word has length 39 [2024-11-08 13:50:21,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:50:21,316 INFO L225 Difference]: With dead ends: 81 [2024-11-08 13:50:21,316 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 13:50:21,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=222, Invalid=838, Unknown=4, NotChecked=126, Total=1190 [2024-11-08 13:50:21,317 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 192 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:50:21,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 236 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 139 Invalid, 0 Unknown, 109 Unchecked, 0.3s Time] [2024-11-08 13:50:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 13:50:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2024-11-08 13:50:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 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) [2024-11-08 13:50:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-11-08 13:50:21,326 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 39 [2024-11-08 13:50:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:50:21,326 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-11-08 13:50:21,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.4074074074074074) internal successors, (92), 27 states have internal predecessors, (92), 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) [2024-11-08 13:50:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-11-08 13:50:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 13:50:21,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:50:21,332 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:50:21,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 13:50:21,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 13:50:21,536 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:50:21,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:50:21,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1993858009, now seen corresponding path program 4 times [2024-11-08 13:50:21,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:50:21,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188640806] [2024-11-08 13:50:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:50:21,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:50:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:50:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:50:22,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:50:22,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188640806] [2024-11-08 13:50:22,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188640806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:50:22,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105985976] [2024-11-08 13:50:22,857 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 13:50:22,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:50:22,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:50:22,858 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:50:22,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 13:50:23,081 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 13:50:23,082 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:50:23,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-08 13:50:23,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:50:23,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:50:23,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-11-08 13:50:23,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 13:50:23,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-08 13:50:23,260 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2024-11-08 13:50:23,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 31 [2024-11-08 13:50:23,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-08 13:50:23,290 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 13:50:23,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 13:50:23,301 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2024-11-08 13:50:23,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2024-11-08 13:50:23,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-11-08 13:50:23,791 INFO L349 Elim1Store]: treesize reduction 32, result has 13.5 percent of original size [2024-11-08 13:50:23,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 162 [2024-11-08 13:50:23,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 23 [2024-11-08 13:50:23,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 1 [2024-11-08 13:50:23,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2024-11-08 13:50:24,071 INFO L349 Elim1Store]: treesize reduction 34, result has 50.7 percent of original size [2024-11-08 13:50:24,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 153 treesize of output 138 [2024-11-08 13:50:24,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-08 13:50:24,137 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-08 13:50:24,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2024-11-08 13:50:24,191 INFO L349 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2024-11-08 13:50:24,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 37 [2024-11-08 13:50:24,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2024-11-08 13:50:24,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 47 [2024-11-08 13:50:24,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2024-11-08 13:50:25,014 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-08 13:50:25,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 54 [2024-11-08 13:50:25,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 13:50:25,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-08 13:50:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:50:25,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:50:25,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:25,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 127 [2024-11-08 13:50:26,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:26,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 558 treesize of output 529 [2024-11-08 13:50:26,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:26,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1071 treesize of output 1911 [2024-11-08 13:50:26,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 770 treesize of output 714 [2024-11-08 13:50:27,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 714 treesize of output 602 [2024-11-08 13:50:27,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:50:27,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 918 treesize of output 970 [2024-11-08 13:51:04,801 INFO L378 Elim1Store]: Elim1 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 53 treesize of output 51 [2024-11-08 13:51:04,879 INFO L378 Elim1Store]: Elim1 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 53 treesize of output 51 [2024-11-08 13:51:04,957 INFO L378 Elim1Store]: Elim1 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 83 treesize of output 79 [2024-11-08 13:51:05,140 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 27 [2024-11-08 13:51:08,952 INFO L378 Elim1Store]: Elim1 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 105 treesize of output 101 [2024-11-08 13:51:09,110 INFO L378 Elim1Store]: Elim1 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 132 treesize of output 126 [2024-11-08 13:51:09,184 INFO L378 Elim1Store]: Elim1 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 132 treesize of output 126 [2024-11-08 13:51:09,268 INFO L378 Elim1Store]: Elim1 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 132 treesize of output 126 [2024-11-08 13:51:09,411 INFO L378 Elim1Store]: Elim1 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 105 treesize of output 101 [2024-11-08 13:51:09,538 INFO L378 Elim1Store]: Elim1 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 105 treesize of output 101 [2024-11-08 13:51:09,822 INFO L378 Elim1Store]: Elim1 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 158 treesize of output 152 [2024-11-08 13:51:10,078 INFO L378 Elim1Store]: Elim1 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 105 treesize of output 101 [2024-11-08 13:51:10,128 INFO L378 Elim1Store]: Elim1 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 134 treesize of output 128