./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/init-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/init-3-u.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 385b06dfd41f8b2cf291934cb4635d07bfe2a63001fa162165126d7b890c1d72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:09:23,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:09:23,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:09:23,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:09:23,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:09:23,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:09:23,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:09:23,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:09:23,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:09:23,508 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:09:23,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:09:23,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:09:23,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:09:23,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:09:23,510 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:09:23,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:09:23,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:09:23,511 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:09:23,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:09:23,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:09:23,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:09:23,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:09:23,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:09:23,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:09:23,511 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:09:23,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:09:23,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:09:23,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:09:23,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 385b06dfd41f8b2cf291934cb4635d07bfe2a63001fa162165126d7b890c1d72 [2025-02-07 17:09:23,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:09:23,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:09:23,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:09:23,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:09:23,725 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:09:23,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/init-3-u.c [2025-02-07 17:09:24,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c32f5b87/f7fc2880aa6c422894db8a3ae1d8f51c/FLAG58a85621e [2025-02-07 17:09:25,071 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:09:25,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-3-u.c [2025-02-07 17:09:25,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c32f5b87/f7fc2880aa6c422894db8a3ae1d8f51c/FLAG58a85621e [2025-02-07 17:09:25,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c32f5b87/f7fc2880aa6c422894db8a3ae1d8f51c [2025-02-07 17:09:25,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:09:25,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:09:25,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:09:25,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:09:25,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:09:25,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c29319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25, skipping insertion in model container [2025-02-07 17:09:25,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:09:25,212 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-3-u.c[320,333] [2025-02-07 17:09:25,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:09:25,235 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:09:25,242 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-3-u.c[320,333] [2025-02-07 17:09:25,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:09:25,263 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:09:25,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25 WrapperNode [2025-02-07 17:09:25,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:09:25,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:09:25,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:09:25,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:09:25,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,288 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-02-07 17:09:25,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:09:25,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:09:25,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:09:25,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:09:25,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,310 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-07 17:09:25,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,316 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:09:25,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:09:25,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:09:25,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:09:25,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (1/1) ... [2025-02-07 17:09:25,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:09:25,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:25,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 17:09:25,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:09:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:09:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:09:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:09:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:09:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:09:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:09:25,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:09:25,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:09:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:09:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:09:25,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:09:25,425 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:09:25,427 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:09:25,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset; [2025-02-07 17:09:25,533 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;main_~k~0#1 := 1 + main_~k~0#1; [2025-02-07 17:09:25,540 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-07 17:09:25,540 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:09:25,545 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:09:25,545 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:09:25,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:09:25 BoogieIcfgContainer [2025-02-07 17:09:25,546 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:09:25,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:09:25,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:09:25,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:09:25,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:09:25" (1/3) ... [2025-02-07 17:09:25,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e082d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:09:25, skipping insertion in model container [2025-02-07 17:09:25,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:25" (2/3) ... [2025-02-07 17:09:25,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e082d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:09:25, skipping insertion in model container [2025-02-07 17:09:25,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:09:25" (3/3) ... [2025-02-07 17:09:25,552 INFO L128 eAbstractionObserver]: Analyzing ICFG init-3-u.c [2025-02-07 17:09:25,561 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:09:25,562 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG init-3-u.c that has 1 procedures, 14 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-07 17:09:25,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:09:25,603 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;@282738fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:09:25,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:09:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 13 states have internal predecessors, (19), 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) [2025-02-07 17:09:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 17:09:25,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:25,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:25,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:25,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash -651683151, now seen corresponding path program 1 times [2025-02-07 17:09:25,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:25,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145459108] [2025-02-07 17:09:25,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:25,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 17:09:25,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 17:09:25,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:25,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:25,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:25,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145459108] [2025-02-07 17:09:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145459108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:25,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:25,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:09:25,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125969483] [2025-02-07 17:09:25,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:25,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:09:25,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:25,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:09:25,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:09:25,797 INFO L87 Difference]: Start difference. First operand has 14 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 13 states have internal predecessors, (19), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) [2025-02-07 17:09:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:25,835 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2025-02-07 17:09:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:09:25,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-02-07 17:09:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:25,842 INFO L225 Difference]: With dead ends: 27 [2025-02-07 17:09:25,842 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 17:09:25,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:09:25,847 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 17 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 [2025-02-07 17:09:25,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 17 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 17:09:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2025-02-07 17:09:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 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) [2025-02-07 17:09:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-02-07 17:09:25,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2025-02-07 17:09:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:25,866 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-02-07 17:09:25,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) [2025-02-07 17:09:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2025-02-07 17:09:25,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 17:09:25,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:25,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:25,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:09:25,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:25,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:25,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1538927827, now seen corresponding path program 1 times [2025-02-07 17:09:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:25,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897694116] [2025-02-07 17:09:25,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:25,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:25,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 17:09:25,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 17:09:25,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:25,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:25,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897694116] [2025-02-07 17:09:25,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897694116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:25,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:25,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:25,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970335434] [2025-02-07 17:09:25,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:25,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:25,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:25,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:25,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:25,944 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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) [2025-02-07 17:09:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:25,979 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2025-02-07 17:09:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:25,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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 [2025-02-07 17:09:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:25,980 INFO L225 Difference]: With dead ends: 24 [2025-02-07 17:09:25,980 INFO L226 Difference]: Without dead ends: 15 [2025-02-07 17:09:25,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:25,981 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:25,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-07 17:09:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-02-07 17:09:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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) [2025-02-07 17:09:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-02-07 17:09:25,989 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 9 [2025-02-07 17:09:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:25,990 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-07 17:09:25,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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) [2025-02-07 17:09:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2025-02-07 17:09:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 17:09:25,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:25,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:25,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:09:25,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:25,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1543429361, now seen corresponding path program 1 times [2025-02-07 17:09:25,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:25,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793474572] [2025-02-07 17:09:25,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:25,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:26,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 17:09:26,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:09:26,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:26,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:26,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:26,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793474572] [2025-02-07 17:09:26,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793474572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:26,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:26,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908458711] [2025-02-07 17:09:26,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:26,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:26,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:26,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:26,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:26,063 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2025-02-07 17:09:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:26,087 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2025-02-07 17:09:26,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:26,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-02-07 17:09:26,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:26,088 INFO L225 Difference]: With dead ends: 24 [2025-02-07 17:09:26,088 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 17:09:26,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:26,089 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5 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 [2025-02-07 17:09:26,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 17:09:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-07 17:09:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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) [2025-02-07 17:09:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-02-07 17:09:26,093 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2025-02-07 17:09:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:26,093 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-02-07 17:09:26,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2025-02-07 17:09:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-02-07 17:09:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 17:09:26,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:26,093 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:26,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 17:09:26,093 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:26,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash 250774043, now seen corresponding path program 1 times [2025-02-07 17:09:26,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:26,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156475543] [2025-02-07 17:09:26,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:26,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:26,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 17:09:26,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 17:09:26,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:26,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:26,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:26,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156475543] [2025-02-07 17:09:26,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156475543] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:26,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120820607] [2025-02-07 17:09:26,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:26,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:26,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:26,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:09:26,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:09:26,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 17:09:26,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 17:09:26,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:26,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:26,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:09:26,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:26,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:09:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:26,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120820607] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:09:26,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:09:26,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-07 17:09:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862830757] [2025-02-07 17:09:26,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:09:26,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 17:09:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:26,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 17:09:26,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-07 17:09:26,335 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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) [2025-02-07 17:09:26,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:26,393 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2025-02-07 17:09:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:09:26,394 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 [2025-02-07 17:09:26,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:26,394 INFO L225 Difference]: With dead ends: 27 [2025-02-07 17:09:26,394 INFO L226 Difference]: Without dead ends: 16 [2025-02-07 17:09:26,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:09:26,395 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:26,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-07 17:09:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-07 17:09:26,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 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) [2025-02-07 17:09:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-02-07 17:09:26,402 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2025-02-07 17:09:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:26,402 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-02-07 17:09:26,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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) [2025-02-07 17:09:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-02-07 17:09:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 17:09:26,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:26,403 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:26,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 17:09:26,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:26,608 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:26,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:26,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2065267185, now seen corresponding path program 2 times [2025-02-07 17:09:26,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:26,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193747357] [2025-02-07 17:09:26,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:09:26,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:26,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-07 17:09:26,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 17:09:26,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:09:26,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:26,675 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-07 17:09:26,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:26,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193747357] [2025-02-07 17:09:26,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193747357] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:26,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942360696] [2025-02-07 17:09:26,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:09:26,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:26,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:26,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:09:26,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:09:26,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-07 17:09:26,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 17:09:26,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:09:26,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:26,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 17:09:26,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:26,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:09:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:26,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942360696] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:09:26,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:09:26,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 15 [2025-02-07 17:09:26,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999037021] [2025-02-07 17:09:26,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:09:26,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 17:09:26,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:26,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 17:09:26,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:09:26,864 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 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) [2025-02-07 17:09:27,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:27,237 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2025-02-07 17:09:27,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 17:09:27,238 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 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 15 [2025-02-07 17:09:27,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:27,238 INFO L225 Difference]: With dead ends: 63 [2025-02-07 17:09:27,238 INFO L226 Difference]: Without dead ends: 49 [2025-02-07 17:09:27,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2025-02-07 17:09:27,240 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:27,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 13 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:27,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-07 17:09:27,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2025-02-07 17:09:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 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) [2025-02-07 17:09:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-02-07 17:09:27,246 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 15 [2025-02-07 17:09:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:27,246 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-02-07 17:09:27,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 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) [2025-02-07 17:09:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-02-07 17:09:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 17:09:27,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:27,247 INFO L218 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:27,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 17:09:27,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:27,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:27,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1503044115, now seen corresponding path program 3 times [2025-02-07 17:09:27,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:27,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259142796] [2025-02-07 17:09:27,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:09:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:27,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 15 equivalence classes. [2025-02-07 17:09:27,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 33 of 35 statements. [2025-02-07 17:09:27,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-02-07 17:09:27,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 126 proven. 55 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-07 17:09:27,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:27,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259142796] [2025-02-07 17:09:27,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259142796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:27,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764118513] [2025-02-07 17:09:27,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:09:27,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:27,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:27,681 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:09:27,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:09:27,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 15 equivalence classes. [2025-02-07 17:09:27,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 31 of 35 statements. [2025-02-07 17:09:27,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-07 17:09:27,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:27,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-02-07 17:09:27,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:28,055 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 [2025-02-07 17:09:28,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,096 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 21 treesize of output 20 [2025-02-07 17:09:28,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:28,163 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-02-07 17:09:28,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:28,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-02-07 17:09:28,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:28,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:28,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-02-07 17:09:30,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:30,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:30,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-02-07 17:09:31,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:31,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:31,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-02-07 17:09:36,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:36,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:36,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-02-07 17:09:43,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:09:43,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:09:43,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 104 [2025-02-07 17:10:11,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:11,821 INFO L349 Elim1Store]: treesize reduction 160, result has 33.3 percent of original size [2025-02-07 17:10:11,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 93 treesize of output 116 [2025-02-07 17:10:40,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:10:40,662 INFO L349 Elim1Store]: treesize reduction 390, result has 18.6 percent of original size [2025-02-07 17:10:40,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 109 treesize of output 135 [2025-02-07 17:11:13,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:11:13,274 INFO L349 Elim1Store]: treesize reduction 565, result has 15.7 percent of original size [2025-02-07 17:11:13,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 36 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 125 treesize of output 154