./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr5.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-tiling/nr5.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 7a05e17fa6f76d5004d5085f0b83441da7dbecb194f05c3b661e69c00b5f4df0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:07:10,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:07:10,387 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:07:10,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:07:10,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:07:10,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:07:10,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:07:10,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:07:10,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:07:10,416 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:07:10,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:07:10,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:07:10,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:07:10,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:07:10,417 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:07:10,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:07:10,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:07:10,417 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:07:10,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:07:10,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:07:10,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:07:10,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:07:10,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:07:10,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:07:10,418 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:07:10,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:07:10,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:07:10,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:07:10,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:07:10,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:07:10,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:07:10,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:07:10,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:07:10,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:07:10,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:07:10,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:07:10,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:07:10,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:07:10,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:07:10,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:07:10,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:07:10,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:07:10,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:07:10,421 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 -> 7a05e17fa6f76d5004d5085f0b83441da7dbecb194f05c3b661e69c00b5f4df0 [2025-02-05 10:07:10,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:07:10,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:07:10,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:07:10,738 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:07:10,738 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:07:10,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr5.c [2025-02-05 10:07:12,086 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45338be99/972881291c6d4a4683ebc03c20d9dba2/FLAG5856250d2 [2025-02-05 10:07:12,378 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:07:12,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/nr5.c [2025-02-05 10:07:12,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45338be99/972881291c6d4a4683ebc03c20d9dba2/FLAG5856250d2 [2025-02-05 10:07:12,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45338be99/972881291c6d4a4683ebc03c20d9dba2 [2025-02-05 10:07:12,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:07:12,448 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:07:12,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:07:12,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:07:12,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:07:12,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:07:12" (1/1) ... [2025-02-05 10:07:12,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5746c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12, skipping insertion in model container [2025-02-05 10:07:12,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:07:12" (1/1) ... [2025-02-05 10:07:12,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:07:12,603 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-tiling/nr5.c[394,407] [2025-02-05 10:07:12,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:07:12,636 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:07:12,646 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-tiling/nr5.c[394,407] [2025-02-05 10:07:12,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:07:12,668 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:07:12,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12 WrapperNode [2025-02-05 10:07:12,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:07:12,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:07:12,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:07:12,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:07:12,676 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:07:12" (1/1) ... [2025-02-05 10:07:12,682 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:07:12" (1/1) ... [2025-02-05 10:07:12,700 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-02-05 10:07:12,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:07:12,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:07:12,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:07:12,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:07:12,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12" (1/1) ... [2025-02-05 10:07:12,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12" (1/1) ... [2025-02-05 10:07:12,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12" (1/1) ... [2025-02-05 10:07:12,739 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 2 writes are split as follows [0, 0, 2]. [2025-02-05 10:07:12,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12" (1/1) ... [2025-02-05 10:07:12,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12" (1/1) ... [2025-02-05 10:07:12,750 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12" (1/1) ... [2025-02-05 10:07:12,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12" (1/1) ... [2025-02-05 10:07:12,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12" (1/1) ... [2025-02-05 10:07:12,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12" (1/1) ... [2025-02-05 10:07:12,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:07:12,760 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:07:12,760 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:07:12,760 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:07:12,761 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12" (1/1) ... [2025-02-05 10:07:12,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:07:12,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:12,798 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:07:12,803 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:07:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:07:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:07:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:07:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:07:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:07:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:07:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:07:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:07:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:07:12,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:07:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:07:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:07:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:07:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:07:12,908 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:07:12,910 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:07:13,079 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-05 10:07:13,079 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:07:13,086 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:07:13,087 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:07:13,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:07:13 BoogieIcfgContainer [2025-02-05 10:07:13,087 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:07:13,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:07:13,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:07:13,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:07:13,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:07:12" (1/3) ... [2025-02-05 10:07:13,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b44621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:07:13, skipping insertion in model container [2025-02-05 10:07:13,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:07:12" (2/3) ... [2025-02-05 10:07:13,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b44621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:07:13, skipping insertion in model container [2025-02-05 10:07:13,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:07:13" (3/3) ... [2025-02-05 10:07:13,098 INFO L128 eAbstractionObserver]: Analyzing ICFG nr5.c [2025-02-05 10:07:13,114 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:07:13,115 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nr5.c that has 1 procedures, 21 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-05 10:07:13,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:07:13,176 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;@15a6e3a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:07:13,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:07:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 10:07:13,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:13,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:13,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:13,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1768238075, now seen corresponding path program 1 times [2025-02-05 10:07:13,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113481600] [2025-02-05 10:07:13,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:13,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:13,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 10:07:13,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 10:07:13,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:13,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:13,354 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:07:13,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:13,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113481600] [2025-02-05 10:07:13,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113481600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:07:13,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:07:13,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:07:13,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885561142] [2025-02-05 10:07:13,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:07:13,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:07:13,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:13,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:07:13,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:07:13,381 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:13,393 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2025-02-05 10:07:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:07:13,394 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 10:07:13,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:13,400 INFO L225 Difference]: With dead ends: 37 [2025-02-05 10:07:13,400 INFO L226 Difference]: Without dead ends: 17 [2025-02-05 10:07:13,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:07:13,405 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:13,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:07:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-05 10:07:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-05 10:07:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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:07:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-02-05 10:07:13,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 12 [2025-02-05 10:07:13,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:13,439 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-05 10:07:13,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-02-05 10:07:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 10:07:13,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:13,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:13,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:07:13,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:13,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash -783918886, now seen corresponding path program 1 times [2025-02-05 10:07:13,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:13,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888981386] [2025-02-05 10:07:13,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:13,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:13,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 10:07:13,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 10:07:13,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:13,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:13,769 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:07:13,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:13,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888981386] [2025-02-05 10:07:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888981386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:07:13,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:07:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:07:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507133351] [2025-02-05 10:07:13,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:07:13,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:07:13,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:13,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:07:13,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:07:13,776 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:13,814 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-02-05 10:07:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:07:13,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 10:07:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:13,815 INFO L225 Difference]: With dead ends: 28 [2025-02-05 10:07:13,815 INFO L226 Difference]: Without dead ends: 21 [2025-02-05 10:07:13,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:07:13,816 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 42 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:13,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 22 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:07:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-05 10:07:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-02-05 10:07:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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:07:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-02-05 10:07:13,825 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2025-02-05 10:07:13,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:13,825 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-05 10:07:13,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:13,826 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-02-05 10:07:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 10:07:13,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:13,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:13,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:07:13,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:13,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:13,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2003912629, now seen corresponding path program 1 times [2025-02-05 10:07:13,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:13,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768980391] [2025-02-05 10:07:13,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:13,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:13,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:07:13,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:07:13,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:13,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:13,931 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:07:13,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:13,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768980391] [2025-02-05 10:07:13,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768980391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:07:13,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:07:13,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:07:13,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649435430] [2025-02-05 10:07:13,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:07:13,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:07:13,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:13,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:07:13,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:07:13,932 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:07:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:13,956 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-02-05 10:07:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:07:13,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2025-02-05 10:07:13,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:13,957 INFO L225 Difference]: With dead ends: 32 [2025-02-05 10:07:13,957 INFO L226 Difference]: Without dead ends: 21 [2025-02-05 10:07:13,958 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:07:13,959 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:13,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:07:13,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-05 10:07:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-02-05 10:07:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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:07:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-02-05 10:07:13,965 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 14 [2025-02-05 10:07:13,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:13,965 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-02-05 10:07:13,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:07:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-02-05 10:07:13,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:07:13,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:13,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:13,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:07:13,967 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:13,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1205006704, now seen corresponding path program 1 times [2025-02-05 10:07:13,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:13,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639246296] [2025-02-05 10:07:13,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:13,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:13,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:07:13,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:07:13,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:13,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:07:14,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:14,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639246296] [2025-02-05 10:07:14,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639246296] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:14,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100642337] [2025-02-05 10:07:14,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:14,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:14,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:14,071 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:07:14,074 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:07:14,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:07:14,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:07:14,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:14,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:14,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:07:14,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:07:14,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:07:14,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100642337] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:14,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:14,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 10:07:14,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579111983] [2025-02-05 10:07:14,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:14,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 10:07:14,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:14,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 10:07:14,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:07:14,230 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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:07:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:14,271 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2025-02-05 10:07:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:07:14,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) Word has length 17 [2025-02-05 10:07:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:14,272 INFO L225 Difference]: With dead ends: 40 [2025-02-05 10:07:14,272 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 10:07:14,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:07:14,273 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:14,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 43 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:07:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 10:07:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-05 10:07:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-02-05 10:07:14,285 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2025-02-05 10:07:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:14,285 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-02-05 10:07:14,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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:07:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-02-05 10:07:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:07:14,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:14,286 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:14,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 10:07:14,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:14,487 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:14,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1141378059, now seen corresponding path program 2 times [2025-02-05 10:07:14,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:14,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619223863] [2025-02-05 10:07:14,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:07:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:14,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-05 10:07:14,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:07:14,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:07:14,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:07:14,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:14,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619223863] [2025-02-05 10:07:14,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619223863] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:14,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91093354] [2025-02-05 10:07:14,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:07:14,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:14,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:14,665 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:07:14,665 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:07:14,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-05 10:07:14,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:07:14,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:07:14,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:14,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:07:14,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:07:14,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:07:14,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91093354] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:14,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:14,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-02-05 10:07:14,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493241163] [2025-02-05 10:07:14,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:14,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:07:14,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:14,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:07:14,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:07:14,834 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:14,880 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2025-02-05 10:07:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:07:14,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 10:07:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:14,881 INFO L225 Difference]: With dead ends: 52 [2025-02-05 10:07:14,881 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 10:07:14,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:07:14,882 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:14,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 43 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:07:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 10:07:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-05 10:07:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-02-05 10:07:14,888 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 26 [2025-02-05 10:07:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:14,888 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-02-05 10:07:14,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-02-05 10:07:14,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 10:07:14,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:14,889 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:14,896 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:07:15,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:15,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:15,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:15,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1143349968, now seen corresponding path program 3 times [2025-02-05 10:07:15,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:15,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279966929] [2025-02-05 10:07:15,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:07:15,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:15,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 7 equivalence classes. [2025-02-05 10:07:15,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 17 of 29 statements. [2025-02-05 10:07:15,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:07:15,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 10:07:15,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:15,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279966929] [2025-02-05 10:07:15,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279966929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:07:15,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:07:15,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:07:15,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091385330] [2025-02-05 10:07:15,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:07:15,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:07:15,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:15,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:07:15,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:07:15,198 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:07:15,238 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2025-02-05 10:07:15,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:07:15,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-05 10:07:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:07:15,240 INFO L225 Difference]: With dead ends: 63 [2025-02-05 10:07:15,240 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 10:07:15,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:07:15,241 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:07:15,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 40 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:07:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 10:07:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2025-02-05 10:07:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-02-05 10:07:15,255 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 29 [2025-02-05 10:07:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:07:15,255 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-02-05 10:07:15,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:07:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-02-05 10:07:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 10:07:15,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:07:15,256 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:07:15,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:07:15,256 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:07:15,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:07:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1344162865, now seen corresponding path program 1 times [2025-02-05 10:07:15,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:07:15,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266415485] [2025-02-05 10:07:15,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:15,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:07:15,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 10:07:15,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:07:15,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:15,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:07:16,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:07:16,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266415485] [2025-02-05 10:07:16,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266415485] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:07:16,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946978566] [2025-02-05 10:07:16,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:07:16,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:07:16,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:07:16,370 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:07:16,374 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:07:16,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 10:07:16,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:07:16,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:07:16,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:07:16,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 10:07:16,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:07:16,571 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:07:16,697 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 19 treesize of output 18 [2025-02-05 10:07:16,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:16,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:16,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:07:16,836 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:07:17,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:07:17,039 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 41 treesize of output 46 [2025-02-05 10:07:17,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:07:17,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:07:17,333 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 60 treesize of output 49 [2025-02-05 10:07:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:07:17,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:07:55,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 60 [2025-02-05 10:07:55,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85746 treesize of output 85490 [2025-02-05 10:07:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:07:58,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946978566] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:07:58,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:07:58,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 43 [2025-02-05 10:07:58,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520905348] [2025-02-05 10:07:58,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:07:58,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-05 10:07:58,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:07:58,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-05 10:07:58,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1479, Unknown=8, NotChecked=0, Total=1806 [2025-02-05 10:07:58,339 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 43 states, 43 states have (on average 1.813953488372093) internal successors, (78), 43 states have internal predecessors, (78), 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:08:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:01,469 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2025-02-05 10:08:01,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-05 10:08:01,469 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.813953488372093) internal successors, (78), 43 states have internal predecessors, (78), 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 29 [2025-02-05 10:08:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:01,470 INFO L225 Difference]: With dead ends: 184 [2025-02-05 10:08:01,470 INFO L226 Difference]: Without dead ends: 160 [2025-02-05 10:08:01,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 43.0s TimeCoverageRelationStatistics Valid=1194, Invalid=5938, Unknown=8, NotChecked=0, Total=7140 [2025-02-05 10:08:01,474 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 342 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:01,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 177 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:08:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-05 10:08:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 90. [2025-02-05 10:08:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 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:08:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2025-02-05 10:08:01,492 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 29 [2025-02-05 10:08:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:01,493 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2025-02-05 10:08:01,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.813953488372093) internal successors, (78), 43 states have internal predecessors, (78), 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:08:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2025-02-05 10:08:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 10:08:01,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:01,494 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:01,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:08:01,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:01,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:01,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:01,695 INFO L85 PathProgramCache]: Analyzing trace with hash 765938142, now seen corresponding path program 1 times [2025-02-05 10:08:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:01,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058491567] [2025-02-05 10:08:01,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:01,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:01,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 10:08:01,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 10:08:01,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:01,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:08:01,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:01,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058491567] [2025-02-05 10:08:01,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058491567] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844682623] [2025-02-05 10:08:01,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:08:01,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:01,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:01,875 INFO L229 MonitoredProcess]: Starting monitored process 5 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:08:01,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:08:01,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 10:08:01,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 10:08:01,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:08:01,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:01,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:08:01,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:08:02,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:08:02,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844682623] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:02,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:02,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-05 10:08:02,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799710525] [2025-02-05 10:08:02,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:02,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 10:08:02,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:02,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 10:08:02,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:08:02,142 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 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:08:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:08:02,207 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2025-02-05 10:08:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:08:02,209 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-05 10:08:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:08:02,209 INFO L225 Difference]: With dead ends: 134 [2025-02-05 10:08:02,209 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 10:08:02,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:08:02,211 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:08:02,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 66 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:08:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 10:08:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2025-02-05 10:08:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 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:08:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2025-02-05 10:08:02,223 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 34 [2025-02-05 10:08:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:08:02,226 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2025-02-05 10:08:02,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 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:08:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2025-02-05 10:08:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 10:08:02,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:08:02,227 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:08:02,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:08:02,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 10:08:02,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:08:02,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:08:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1891944527, now seen corresponding path program 2 times [2025-02-05 10:08:02,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:08:02,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490528469] [2025-02-05 10:08:02,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:08:02,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:08:02,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-05 10:08:02,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 10:08:02,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:08:02,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:08:03,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:08:03,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490528469] [2025-02-05 10:08:03,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490528469] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:08:03,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618249618] [2025-02-05 10:08:03,434 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:08:03,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:08:03,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:08:03,436 INFO L229 MonitoredProcess]: Starting monitored process 6 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:08:03,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:08:03,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-05 10:08:03,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 10:08:03,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:08:03,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:08:03,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 10:08:03,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:08:03,816 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:08:03,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:08:03,970 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 23 treesize of output 22 [2025-02-05 10:08:04,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:08:04,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:08:04,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:08:04,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:08:04,166 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 42 treesize of output 25 [2025-02-05 10:08:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:04,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:08:42,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2025-02-05 10:08:42,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 358 treesize of output 350 [2025-02-05 10:08:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:08:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618249618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:08:46,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:08:46,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 45 [2025-02-05 10:08:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765112835] [2025-02-05 10:08:46,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:08:46,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-05 10:08:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:08:46,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-05 10:08:46,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1714, Unknown=10, NotChecked=0, Total=1980 [2025-02-05 10:08:46,510 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 45 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 45 states have internal predecessors, (107), 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)