./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/init-4-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-4-n-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 7e1c46a3eec085decec4254bf9381483b25ba7b6541d5728ae52d1793b9b8c91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:18:50,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:18:50,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:18:50,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:18:50,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:18:50,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:18:50,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:18:50,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:18:50,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:18:50,818 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:18:50,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:18:50,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:18:50,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:18:50,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:18:50,820 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:18:50,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:18:50,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:18:50,820 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:18:50,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:18:50,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:18:50,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:18:50,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:18:50,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:18:50,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:18:50,821 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:18:50,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:18:50,821 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:18:50,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:18:50,821 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:18:50,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:18:50,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:18:50,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:18:50,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:18:50,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:18:50,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:18:50,822 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:18:50,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:18:50,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:18:50,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:18:50,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:18:50,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:18:50,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:18:50,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:18:50,823 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 -> 7e1c46a3eec085decec4254bf9381483b25ba7b6541d5728ae52d1793b9b8c91 [2025-02-05 10:18:51,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:18:51,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:18:51,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:18:51,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:18:51,065 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:18:51,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/init-4-n-u.c [2025-02-05 10:18:52,209 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8dea7ebd/c6976d551f0544f58355ea7b8b7cfff2/FLAG2643e394d [2025-02-05 10:18:52,510 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:18:52,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-4-n-u.c [2025-02-05 10:18:52,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8dea7ebd/c6976d551f0544f58355ea7b8b7cfff2/FLAG2643e394d [2025-02-05 10:18:52,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8dea7ebd/c6976d551f0544f58355ea7b8b7cfff2 [2025-02-05 10:18:52,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:18:52,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:18:52,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:18:52,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:18:52,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:18:52,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7d6240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52, skipping insertion in model container [2025-02-05 10:18:52,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:18:52,681 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-4-n-u.c[322,335] [2025-02-05 10:18:52,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:18:52,700 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:18:52,706 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-4-n-u.c[322,335] [2025-02-05 10:18:52,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:18:52,729 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:18:52,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52 WrapperNode [2025-02-05 10:18:52,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:18:52,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:18:52,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:18:52,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:18:52,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,751 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2025-02-05 10:18:52,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:18:52,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:18:52,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:18:52,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:18:52,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,765 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-05 10:18:52,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:18:52,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:18:52,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:18:52,771 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:18:52,771 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (1/1) ... [2025-02-05 10:18:52,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:18:52,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:18:52,806 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-05 10:18:52,807 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-05 10:18:52,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:18:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:18:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:18:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:18:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:18:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:18:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:18:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:18:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:18:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:18:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:18:52,873 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:18:52,874 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:18:52,975 INFO L1309 $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-05 10:18:52,984 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-02-05 10:18:52,984 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:18:52,991 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:18:52,992 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:18:52,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:52 BoogieIcfgContainer [2025-02-05 10:18:52,992 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:18:52,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:18:52,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:18:52,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:18:52,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:18:52" (1/3) ... [2025-02-05 10:18:52,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c734fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:18:52, skipping insertion in model container [2025-02-05 10:18:52,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:52" (2/3) ... [2025-02-05 10:18:52,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c734fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:18:52, skipping insertion in model container [2025-02-05 10:18:52,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:52" (3/3) ... [2025-02-05 10:18:52,998 INFO L128 eAbstractionObserver]: Analyzing ICFG init-4-n-u.c [2025-02-05 10:18:53,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:18:53,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG init-4-n-u.c that has 1 procedures, 17 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-02-05 10:18:53,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:18:53,049 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;@5233d824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:18:53,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:18:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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-05 10:18:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 10:18:53,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:53,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:53,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:53,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:53,060 INFO L85 PathProgramCache]: Analyzing trace with hash -945061330, now seen corresponding path program 1 times [2025-02-05 10:18:53,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:53,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021958102] [2025-02-05 10:18:53,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:53,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:53,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 10:18:53,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 10:18:53,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:53,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:53,279 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-05 10:18:53,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:53,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021958102] [2025-02-05 10:18:53,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021958102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:53,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:53,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:18:53,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239783998] [2025-02-05 10:18:53,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:53,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:18:53,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:53,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:18:53,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:18:53,301 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 3.0) 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-05 10:18:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:53,337 INFO L93 Difference]: Finished difference Result 32 states and 48 transitions. [2025-02-05 10:18:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:18:53,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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-05 10:18:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:53,345 INFO L225 Difference]: With dead ends: 32 [2025-02-05 10:18:53,346 INFO L226 Difference]: Without dead ends: 18 [2025-02-05 10:18:53,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:18:53,351 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:53,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:18:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-05 10:18:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2025-02-05 10:18:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2025-02-05 10:18:53,380 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2025-02-05 10:18:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:53,381 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-02-05 10:18:53,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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-05 10:18:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2025-02-05 10:18:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 10:18:53,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:53,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:53,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:18:53,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:53,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash -708259340, now seen corresponding path program 1 times [2025-02-05 10:18:53,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:53,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882555838] [2025-02-05 10:18:53,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:53,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 10:18:53,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 10:18:53,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:53,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:53,495 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-05 10:18:53,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:53,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882555838] [2025-02-05 10:18:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882555838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:53,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:18:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193732924] [2025-02-05 10:18:53,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:53,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:18:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:53,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:18:53,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:53,499 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-05 10:18:53,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:53,527 INFO L93 Difference]: Finished difference Result 37 states and 57 transitions. [2025-02-05 10:18:53,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:18:53,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-05 10:18:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:53,528 INFO L225 Difference]: With dead ends: 37 [2025-02-05 10:18:53,528 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 10:18:53,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:53,529 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 23 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-05 10:18:53,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:18:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 10:18:53,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2025-02-05 10:18:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 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-05 10:18:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2025-02-05 10:18:53,532 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 11 [2025-02-05 10:18:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:53,532 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. [2025-02-05 10:18:53,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-05 10:18:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2025-02-05 10:18:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 10:18:53,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:53,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:53,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:18:53,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:53,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:53,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1310043440, now seen corresponding path program 1 times [2025-02-05 10:18:53,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:53,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151883633] [2025-02-05 10:18:53,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:53,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:53,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 10:18:53,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 10:18:53,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:53,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:53,583 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-05 10:18:53,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:53,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151883633] [2025-02-05 10:18:53,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151883633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:53,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:53,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:18:53,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311072365] [2025-02-05 10:18:53,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:53,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:18:53,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:53,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:18:53,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:53,585 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 10:18:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:53,615 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2025-02-05 10:18:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:18:53,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-02-05 10:18:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:53,616 INFO L225 Difference]: With dead ends: 39 [2025-02-05 10:18:53,616 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 10:18:53,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:53,617 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 24 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-05 10:18:53,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 24 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:18:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 10:18:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2025-02-05 10:18:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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-05 10:18:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2025-02-05 10:18:53,622 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 13 [2025-02-05 10:18:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:53,622 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2025-02-05 10:18:53,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-05 10:18:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2025-02-05 10:18:53,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 10:18:53,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:53,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:53,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:18:53,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:53,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash -310324846, now seen corresponding path program 1 times [2025-02-05 10:18:53,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:53,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757087901] [2025-02-05 10:18:53,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:53,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 10:18:53,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 10:18:53,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:53,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:18:53,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:53,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757087901] [2025-02-05 10:18:53,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757087901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:53,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:53,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:18:53,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201272529] [2025-02-05 10:18:53,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:53,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:18:53,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:53,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:18:53,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:53,726 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-05 10:18:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:53,745 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2025-02-05 10:18:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:18:53,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) Word has length 15 [2025-02-05 10:18:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:53,745 INFO L225 Difference]: With dead ends: 41 [2025-02-05 10:18:53,745 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 10:18:53,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:53,746 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:53,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:18:53,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 10:18:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-02-05 10:18:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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-05 10:18:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2025-02-05 10:18:53,750 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 15 [2025-02-05 10:18:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:53,751 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2025-02-05 10:18:53,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-05 10:18:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2025-02-05 10:18:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 10:18:53,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:53,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:53,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:18:53,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:53,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:53,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2123810777, now seen corresponding path program 1 times [2025-02-05 10:18:53,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:53,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864134841] [2025-02-05 10:18:53,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:53,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:53,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 10:18:53,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:18:53,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:53,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:18:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:53,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864134841] [2025-02-05 10:18:53,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864134841] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:18:53,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891106289] [2025-02-05 10:18:53,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:53,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:18:53,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:18:53,837 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-05 10:18:53,838 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-05 10:18:53,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 10:18:53,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:18:53,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:53,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:53,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:18:53,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:18:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:18:53,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:18:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:18:53,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891106289] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:18:53,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:18:53,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-05 10:18:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503185538] [2025-02-05 10:18:53,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:18:53,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:18:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:53,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:18:53,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:18:53,981 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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-05 10:18:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:54,036 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2025-02-05 10:18:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:18:54,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 10:18:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:54,037 INFO L225 Difference]: With dead ends: 57 [2025-02-05 10:18:54,037 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 10:18:54,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 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-05 10:18:54,038 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 84 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:54,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 59 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:18:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 10:18:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2025-02-05 10:18:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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-05 10:18:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-02-05 10:18:54,043 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 16 [2025-02-05 10:18:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:54,043 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-02-05 10:18:54,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 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-05 10:18:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-02-05 10:18:54,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:18:54,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:54,044 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:54,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:18:54,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:18:54,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:54,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:54,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2121247570, now seen corresponding path program 2 times [2025-02-05 10:18:54,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:54,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787905386] [2025-02-05 10:18:54,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:18:54,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:54,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-05 10:18:54,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:18:54,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:18:54,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:54,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:18:54,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:54,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787905386] [2025-02-05 10:18:54,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787905386] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:18:54,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818815223] [2025-02-05 10:18:54,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:18:54,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:18:54,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:18:54,321 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-05 10:18:54,323 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-05 10:18:54,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-02-05 10:18:54,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:18:54,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:18:54,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:54,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 10:18:54,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:18:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:18:54,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:18:54,536 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:18:54,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818815223] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:18:54,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:18:54,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2025-02-05 10:18:54,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639532806] [2025-02-05 10:18:54,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:18:54,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 10:18:54,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:54,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 10:18:54,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:18:54,542 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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-05 10:18:54,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:54,990 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2025-02-05 10:18:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-05 10:18:54,991 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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 19 [2025-02-05 10:18:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:54,992 INFO L225 Difference]: With dead ends: 136 [2025-02-05 10:18:54,992 INFO L226 Difference]: Without dead ends: 106 [2025-02-05 10:18:54,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 10:18:54,993 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 228 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:54,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 86 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:18:54,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-05 10:18:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 73. [2025-02-05 10:18:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2025-02-05 10:18:55,005 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2025-02-05 10:18:55,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:55,005 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2025-02-05 10:18:55,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 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-05 10:18:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2025-02-05 10:18:55,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 10:18:55,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:55,006 INFO L218 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:55,012 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-05 10:18:55,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:18:55,209 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1867747766, now seen corresponding path program 3 times [2025-02-05 10:18:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:55,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205209501] [2025-02-05 10:18:55,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:18:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:55,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 17 equivalence classes. [2025-02-05 10:18:55,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 37 of 41 statements. [2025-02-05 10:18:55,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-02-05 10:18:55,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 8 proven. 176 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 10:18:55,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205209501] [2025-02-05 10:18:55,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205209501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:18:55,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247093759] [2025-02-05 10:18:55,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:18:55,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:18:55,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:18:55,473 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-05 10:18:55,475 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-05 10:18:55,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 17 equivalence classes. [2025-02-05 10:18:56,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 35 of 41 statements. [2025-02-05 10:18:56,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-02-05 10:18:56,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:56,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-05 10:18:56,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:18:56,109 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-05 10:18:56,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,151 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-05 10:18:56,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:18:56,244 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-05 10:18:56,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:18:56,355 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-05 10:18:56,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:18:56,507 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-05 10:18:56,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:18:56,660 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-05 10:18:56,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:56,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:18:56,886 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-05 10:18:57,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:18:57,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:18:57,414 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-05 10:19:21,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:21,829 INFO L349 Elim1Store]: treesize reduction 142, result has 33.3 percent of original size [2025-02-05 10:19:21,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 84 treesize of output 104 [2025-02-05 10:19:46,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:19:46,147 INFO L349 Elim1Store]: treesize reduction 142, result has 33.3 percent of original size [2025-02-05 10:19:46,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 84 treesize of output 104 [2025-02-05 10:20:10,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:10,799 INFO L349 Elim1Store]: treesize reduction 458, result has 14.9 percent of original size [2025-02-05 10:20:10,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 115 treesize of output 138 [2025-02-05 10:20:38,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:20:38,254 INFO L349 Elim1Store]: treesize reduction 687, result has 13.9 percent of original size [2025-02-05 10:20:38,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 28 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 146 treesize of output 172