./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label52.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/eca-rers2012/Problem03_label52.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 dadc4a7f56d2eeb12d7009442a875d9c494d437949017438f5005c98bfcd0bea --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:57:56,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:57:56,467 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:57:56,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:57:56,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:57:56,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:57:56,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:57:56,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:57:56,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:57:56,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:57:56,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:57:56,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:57:56,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:57:56,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:57:56,490 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:57:56,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:57:56,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:57:56,491 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:57:56,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:57:56,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:57:56,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:57:56,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:57:56,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:57:56,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:57:56,491 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:57:56,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:57:56,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:57:56,492 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:57:56,492 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:57:56,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:57:56,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:57:56,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:57:56,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:57:56,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:57:56,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:57:56,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:57:56,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:57:56,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:57:56,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:57:56,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:57:56,493 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:57:56,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:57:56,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:57:56,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:57:56,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:57:56,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:57:56,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:57:56,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:57:56,494 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 -> dadc4a7f56d2eeb12d7009442a875d9c494d437949017438f5005c98bfcd0bea [2025-01-08 22:57:56,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:57:56,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:57:56,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:57:56,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:57:56,730 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:57:56,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label52.c [2025-01-08 22:57:57,812 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83b05fdf0/43c2f062e421495cb8f03ed31ea57e23/FLAG275d5dc2f [2025-01-08 22:57:58,089 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:57:58,090 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label52.c [2025-01-08 22:57:58,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83b05fdf0/43c2f062e421495cb8f03ed31ea57e23/FLAG275d5dc2f [2025-01-08 22:57:58,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83b05fdf0/43c2f062e421495cb8f03ed31ea57e23 [2025-01-08 22:57:58,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:57:58,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:57:58,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:57:58,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:57:58,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:57:58,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626e5a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58, skipping insertion in model container [2025-01-08 22:57:58,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:57:58,525 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/eca-rers2012/Problem03_label52.c[53923,53936] [2025-01-08 22:57:58,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:57:58,570 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:57:58,698 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/eca-rers2012/Problem03_label52.c[53923,53936] [2025-01-08 22:57:58,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:57:58,734 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:57:58,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58 WrapperNode [2025-01-08 22:57:58,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:57:58,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:57:58,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:57:58,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:57:58,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,855 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-01-08 22:57:58,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:57:58,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:57:58,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:57:58,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:57:58,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,902 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:57:58,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,946 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:57:58,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:57:58,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:57:58,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:57:58,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (1/1) ... [2025-01-08 22:57:58,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:57:59,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:59,016 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-01-08 22:57:59,019 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-01-08 22:57:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:57:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:57:59,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:57:59,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:57:59,093 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:57:59,094 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:58:00,396 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-08 22:58:00,396 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:58:00,410 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:58:00,410 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:58:00,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:58:00 BoogieIcfgContainer [2025-01-08 22:58:00,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:58:00,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:58:00,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:58:00,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:58:00,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:57:58" (1/3) ... [2025-01-08 22:58:00,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fc69c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:58:00, skipping insertion in model container [2025-01-08 22:58:00,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:58" (2/3) ... [2025-01-08 22:58:00,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fc69c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:58:00, skipping insertion in model container [2025-01-08 22:58:00,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:58:00" (3/3) ... [2025-01-08 22:58:00,418 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label52.c [2025-01-08 22:58:00,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:58:00,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label52.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:58:00,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:58:00,495 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;@b3bedba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:58:00,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:58:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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-01-08 22:58:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-08 22:58:00,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:00,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:00,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:00,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:00,516 INFO L85 PathProgramCache]: Analyzing trace with hash -216365526, now seen corresponding path program 1 times [2025-01-08 22:58:00,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:00,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807645040] [2025-01-08 22:58:00,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:00,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-08 22:58:00,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-08 22:58:00,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:00,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:58:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:01,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807645040] [2025-01-08 22:58:01,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807645040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:01,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:01,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:58:01,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023156883] [2025-01-08 22:58:01,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:01,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:01,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:01,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:01,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:01,229 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-01-08 22:58:02,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:02,025 INFO L93 Difference]: Finished difference Result 857 states and 1495 transitions. [2025-01-08 22:58:02,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:02,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 146 [2025-01-08 22:58:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:02,033 INFO L225 Difference]: With dead ends: 857 [2025-01-08 22:58:02,033 INFO L226 Difference]: Without dead ends: 462 [2025-01-08 22:58:02,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:02,037 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 142 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:02,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 186 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:58:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-01-08 22:58:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2025-01-08 22:58:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 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-01-08 22:58:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions. [2025-01-08 22:58:02,087 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 146 [2025-01-08 22:58:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:02,088 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 706 transitions. [2025-01-08 22:58:02,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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-01-08 22:58:02,089 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions. [2025-01-08 22:58:02,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-08 22:58:02,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:02,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:02,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:58:02,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:02,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1653358711, now seen corresponding path program 1 times [2025-01-08 22:58:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:02,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553244573] [2025-01-08 22:58:02,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:02,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:02,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-08 22:58:02,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-08 22:58:02,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:02,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:58:02,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:02,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553244573] [2025-01-08 22:58:02,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553244573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:02,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:02,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:58:02,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551923361] [2025-01-08 22:58:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:02,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:02,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:02,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:02,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:02,254 INFO L87 Difference]: Start difference. First operand 460 states and 706 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-01-08 22:58:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:02,890 INFO L93 Difference]: Finished difference Result 1344 states and 2079 transitions. [2025-01-08 22:58:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:02,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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 154 [2025-01-08 22:58:02,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:02,894 INFO L225 Difference]: With dead ends: 1344 [2025-01-08 22:58:02,894 INFO L226 Difference]: Without dead ends: 886 [2025-01-08 22:58:02,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:02,895 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:02,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 92 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-01-08 22:58:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870. [2025-01-08 22:58:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5132336018411967) internal successors, (1315), 869 states have internal predecessors, (1315), 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-01-08 22:58:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1315 transitions. [2025-01-08 22:58:02,922 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1315 transitions. Word has length 154 [2025-01-08 22:58:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:02,922 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1315 transitions. [2025-01-08 22:58:02,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-01-08 22:58:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1315 transitions. [2025-01-08 22:58:02,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-08 22:58:02,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:02,925 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:02,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:58:02,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:02,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:02,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2011546447, now seen corresponding path program 1 times [2025-01-08 22:58:02,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:02,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859014612] [2025-01-08 22:58:02,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:02,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-08 22:58:02,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-08 22:58:02,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:02,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:58:03,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859014612] [2025-01-08 22:58:03,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859014612] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:58:03,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647968426] [2025-01-08 22:58:03,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:03,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:03,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:58:03,322 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-01-08 22:58:03,324 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-01-08 22:58:03,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-08 22:58:03,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-08 22:58:03,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:03,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:03,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:58:03,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:58:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:58:03,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:58:03,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647968426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:03,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:58:03,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:58:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695301279] [2025-01-08 22:58:03,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:03,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:03,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:03,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:03,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:58:03,581 INFO L87 Difference]: Start difference. First operand 870 states and 1315 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-01-08 22:58:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:04,190 INFO L93 Difference]: Finished difference Result 2554 states and 3872 transitions. [2025-01-08 22:58:04,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:04,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 161 [2025-01-08 22:58:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:04,196 INFO L225 Difference]: With dead ends: 2554 [2025-01-08 22:58:04,196 INFO L226 Difference]: Without dead ends: 1686 [2025-01-08 22:58:04,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:58:04,197 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 93 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:04,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 416 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:04,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2025-01-08 22:58:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1684. [2025-01-08 22:58:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.3368983957219251) internal successors, (2250), 1683 states have internal predecessors, (2250), 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-01-08 22:58:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2250 transitions. [2025-01-08 22:58:04,221 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2250 transitions. Word has length 161 [2025-01-08 22:58:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:04,222 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2250 transitions. [2025-01-08 22:58:04,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-01-08 22:58:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2250 transitions. [2025-01-08 22:58:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-08 22:58:04,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:04,225 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:04,231 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-01-08 22:58:04,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:04,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:04,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:04,429 INFO L85 PathProgramCache]: Analyzing trace with hash -314587352, now seen corresponding path program 1 times [2025-01-08 22:58:04,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780036867] [2025-01-08 22:58:04,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:04,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-08 22:58:04,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-08 22:58:04,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:04,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:58:04,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:04,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780036867] [2025-01-08 22:58:04,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780036867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:04,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:04,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:58:04,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225451142] [2025-01-08 22:58:04,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:04,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:04,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:04,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:04,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:04,608 INFO L87 Difference]: Start difference. First operand 1684 states and 2250 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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-01-08 22:58:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:05,229 INFO L93 Difference]: Finished difference Result 4178 states and 5736 transitions. [2025-01-08 22:58:05,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:05,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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 169 [2025-01-08 22:58:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:05,238 INFO L225 Difference]: With dead ends: 4178 [2025-01-08 22:58:05,238 INFO L226 Difference]: Without dead ends: 2496 [2025-01-08 22:58:05,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:05,240 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 199 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:05,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 197 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-08 22:58:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2496. [2025-01-08 22:58:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.2725450901803608) internal successors, (3175), 2495 states have internal predecessors, (3175), 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-01-08 22:58:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3175 transitions. [2025-01-08 22:58:05,278 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3175 transitions. Word has length 169 [2025-01-08 22:58:05,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:05,278 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 3175 transitions. [2025-01-08 22:58:05,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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-01-08 22:58:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3175 transitions. [2025-01-08 22:58:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-08 22:58:05,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:05,282 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:05,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:58:05,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:05,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash 454492939, now seen corresponding path program 1 times [2025-01-08 22:58:05,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:05,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568118603] [2025-01-08 22:58:05,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:05,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:05,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-08 22:58:05,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-08 22:58:05,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:05,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:58:05,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:05,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568118603] [2025-01-08 22:58:05,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568118603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:05,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:05,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:58:05,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664259903] [2025-01-08 22:58:05,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:05,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:05,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:05,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:05,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:05,420 INFO L87 Difference]: Start difference. First operand 2496 states and 3175 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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-01-08 22:58:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:06,109 INFO L93 Difference]: Finished difference Result 7441 states and 9465 transitions. [2025-01-08 22:58:06,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:06,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2025-01-08 22:58:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:06,124 INFO L225 Difference]: With dead ends: 7441 [2025-01-08 22:58:06,125 INFO L226 Difference]: Without dead ends: 4947 [2025-01-08 22:58:06,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:06,129 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 234 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:06,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 213 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2025-01-08 22:58:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4944. [2025-01-08 22:58:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4944 states, 4943 states have (on average 1.2352822172769573) internal successors, (6106), 4943 states have internal predecessors, (6106), 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-01-08 22:58:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4944 states to 4944 states and 6106 transitions. [2025-01-08 22:58:06,225 INFO L78 Accepts]: Start accepts. Automaton has 4944 states and 6106 transitions. Word has length 176 [2025-01-08 22:58:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:06,225 INFO L471 AbstractCegarLoop]: Abstraction has 4944 states and 6106 transitions. [2025-01-08 22:58:06,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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-01-08 22:58:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4944 states and 6106 transitions. [2025-01-08 22:58:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-08 22:58:06,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:06,235 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:06,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:58:06,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:06,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1374351693, now seen corresponding path program 1 times [2025-01-08 22:58:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:06,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405059323] [2025-01-08 22:58:06,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:06,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:06,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-08 22:58:06,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-08 22:58:06,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:06,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:58:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:06,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405059323] [2025-01-08 22:58:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405059323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:06,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:06,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:06,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992830608] [2025-01-08 22:58:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:06,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:06,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:06,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:06,409 INFO L87 Difference]: Start difference. First operand 4944 states and 6106 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-01-08 22:58:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:07,084 INFO L93 Difference]: Finished difference Result 14569 states and 18004 transitions. [2025-01-08 22:58:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:07,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 181 [2025-01-08 22:58:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:07,113 INFO L225 Difference]: With dead ends: 14569 [2025-01-08 22:58:07,113 INFO L226 Difference]: Without dead ends: 9627 [2025-01-08 22:58:07,120 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-01-08 22:58:07,121 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 202 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:07,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 410 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9627 states. [2025-01-08 22:58:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9627 to 9622. [2025-01-08 22:58:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9622 states, 9621 states have (on average 1.1831410456293525) internal successors, (11383), 9621 states have internal predecessors, (11383), 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-01-08 22:58:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9622 states to 9622 states and 11383 transitions. [2025-01-08 22:58:07,280 INFO L78 Accepts]: Start accepts. Automaton has 9622 states and 11383 transitions. Word has length 181 [2025-01-08 22:58:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:07,280 INFO L471 AbstractCegarLoop]: Abstraction has 9622 states and 11383 transitions. [2025-01-08 22:58:07,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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-01-08 22:58:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 9622 states and 11383 transitions. [2025-01-08 22:58:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-08 22:58:07,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:07,289 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:07,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:58:07,290 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:07,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash 154736623, now seen corresponding path program 1 times [2025-01-08 22:58:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200423254] [2025-01-08 22:58:07,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:07,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:07,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-08 22:58:07,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-08 22:58:07,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:07,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:58:07,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:07,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200423254] [2025-01-08 22:58:07,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200423254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:07,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:07,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:07,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032060079] [2025-01-08 22:58:07,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:07,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:58:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:07,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:58:07,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:58:07,482 INFO L87 Difference]: Start difference. First operand 9622 states and 11383 transitions. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 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-01-08 22:58:08,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:08,244 INFO L93 Difference]: Finished difference Result 21851 states and 26127 transitions. [2025-01-08 22:58:08,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:58:08,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 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 202 [2025-01-08 22:58:08,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:08,271 INFO L225 Difference]: With dead ends: 21851 [2025-01-08 22:58:08,274 INFO L226 Difference]: Without dead ends: 12231 [2025-01-08 22:58:08,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:58:08,285 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 520 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:08,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 64 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:58:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12231 states. [2025-01-08 22:58:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12231 to 12230. [2025-01-08 22:58:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12230 states, 12229 states have (on average 1.1517703818791398) internal successors, (14085), 12229 states have internal predecessors, (14085), 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-01-08 22:58:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12230 states to 12230 states and 14085 transitions. [2025-01-08 22:58:08,487 INFO L78 Accepts]: Start accepts. Automaton has 12230 states and 14085 transitions. Word has length 202 [2025-01-08 22:58:08,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:08,487 INFO L471 AbstractCegarLoop]: Abstraction has 12230 states and 14085 transitions. [2025-01-08 22:58:08,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 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-01-08 22:58:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 12230 states and 14085 transitions. [2025-01-08 22:58:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-08 22:58:08,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:08,498 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:08,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:58:08,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:08,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:08,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1548617770, now seen corresponding path program 1 times [2025-01-08 22:58:08,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:08,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424506850] [2025-01-08 22:58:08,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:08,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:08,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-08 22:58:08,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-08 22:58:08,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:08,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:58:08,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:08,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424506850] [2025-01-08 22:58:08,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424506850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:08,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:08,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:08,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278991044] [2025-01-08 22:58:08,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:08,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:08,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:08,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:08,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:08,651 INFO L87 Difference]: Start difference. First operand 12230 states and 14085 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-01-08 22:58:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:09,333 INFO L93 Difference]: Finished difference Result 29138 states and 33817 transitions. [2025-01-08 22:58:09,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:09,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 220 [2025-01-08 22:58:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:09,369 INFO L225 Difference]: With dead ends: 29138 [2025-01-08 22:58:09,369 INFO L226 Difference]: Without dead ends: 16910 [2025-01-08 22:58:09,384 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-01-08 22:58:09,385 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 83 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:09,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 327 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16910 states. [2025-01-08 22:58:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16910 to 16899. [2025-01-08 22:58:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16899 states, 16898 states have (on average 1.154811220262753) internal successors, (19514), 16898 states have internal predecessors, (19514), 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-01-08 22:58:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16899 states to 16899 states and 19514 transitions. [2025-01-08 22:58:09,594 INFO L78 Accepts]: Start accepts. Automaton has 16899 states and 19514 transitions. Word has length 220 [2025-01-08 22:58:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:09,594 INFO L471 AbstractCegarLoop]: Abstraction has 16899 states and 19514 transitions. [2025-01-08 22:58:09,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-01-08 22:58:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand 16899 states and 19514 transitions. [2025-01-08 22:58:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-08 22:58:09,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:09,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:09,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:58:09,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:09,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:09,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1306210958, now seen corresponding path program 1 times [2025-01-08 22:58:09,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:09,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470516639] [2025-01-08 22:58:09,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:09,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:09,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-08 22:58:09,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-08 22:58:09,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:09,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:58:09,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:09,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470516639] [2025-01-08 22:58:09,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470516639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:09,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:09,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:58:09,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169181832] [2025-01-08 22:58:09,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:09,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:09,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:09,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:09,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:09,809 INFO L87 Difference]: Start difference. First operand 16899 states and 19514 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 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-01-08 22:58:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:10,382 INFO L93 Difference]: Finished difference Result 33807 states and 39047 transitions. [2025-01-08 22:58:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:10,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 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 227 [2025-01-08 22:58:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:10,407 INFO L225 Difference]: With dead ends: 33807 [2025-01-08 22:58:10,408 INFO L226 Difference]: Without dead ends: 16910 [2025-01-08 22:58:10,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:10,422 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 156 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:10,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 126 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:58:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16910 states. [2025-01-08 22:58:10,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16910 to 16899. [2025-01-08 22:58:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16899 states, 16898 states have (on average 1.149781039176234) internal successors, (19429), 16898 states have internal predecessors, (19429), 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-01-08 22:58:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16899 states to 16899 states and 19429 transitions. [2025-01-08 22:58:10,661 INFO L78 Accepts]: Start accepts. Automaton has 16899 states and 19429 transitions. Word has length 227 [2025-01-08 22:58:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:10,661 INFO L471 AbstractCegarLoop]: Abstraction has 16899 states and 19429 transitions. [2025-01-08 22:58:10,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 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-01-08 22:58:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 16899 states and 19429 transitions. [2025-01-08 22:58:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-08 22:58:10,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:10,674 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:10,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:58:10,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:10,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash -424965225, now seen corresponding path program 1 times [2025-01-08 22:58:10,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:10,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101757361] [2025-01-08 22:58:10,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:10,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-08 22:58:10,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-08 22:58:10,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:10,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-01-08 22:58:10,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:10,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101757361] [2025-01-08 22:58:10,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101757361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:10,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:10,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:58:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248024966] [2025-01-08 22:58:10,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:10,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:10,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:10,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:10,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:10,840 INFO L87 Difference]: Start difference. First operand 16899 states and 19429 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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-01-08 22:58:11,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:11,524 INFO L93 Difference]: Finished difference Result 41946 states and 48306 transitions. [2025-01-08 22:58:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:11,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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 253 [2025-01-08 22:58:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:11,559 INFO L225 Difference]: With dead ends: 41946 [2025-01-08 22:58:11,559 INFO L226 Difference]: Without dead ends: 25049 [2025-01-08 22:58:11,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:11,574 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 207 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:11,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 87 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25049 states. [2025-01-08 22:58:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25049 to 25045. [2025-01-08 22:58:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25045 states, 25044 states have (on average 1.149936112442102) internal successors, (28799), 25044 states have internal predecessors, (28799), 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-01-08 22:58:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25045 states to 25045 states and 28799 transitions. [2025-01-08 22:58:11,815 INFO L78 Accepts]: Start accepts. Automaton has 25045 states and 28799 transitions. Word has length 253 [2025-01-08 22:58:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:11,815 INFO L471 AbstractCegarLoop]: Abstraction has 25045 states and 28799 transitions. [2025-01-08 22:58:11,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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-01-08 22:58:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 25045 states and 28799 transitions. [2025-01-08 22:58:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-08 22:58:11,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:11,836 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:11,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:58:11,836 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:11,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:11,837 INFO L85 PathProgramCache]: Analyzing trace with hash 388176815, now seen corresponding path program 1 times [2025-01-08 22:58:11,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:11,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679548587] [2025-01-08 22:58:11,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:11,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:11,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-08 22:58:11,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-08 22:58:11,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:11,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:58:12,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:12,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679548587] [2025-01-08 22:58:12,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679548587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:12,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:12,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210130533] [2025-01-08 22:58:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:12,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:58:12,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:12,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:58:12,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:58:12,151 INFO L87 Difference]: Start difference. First operand 25045 states and 28799 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 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-01-08 22:58:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:13,117 INFO L93 Difference]: Finished difference Result 53358 states and 61348 transitions. [2025-01-08 22:58:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:58:13,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 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 254 [2025-01-08 22:58:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:13,155 INFO L225 Difference]: With dead ends: 53358 [2025-01-08 22:58:13,156 INFO L226 Difference]: Without dead ends: 28315 [2025-01-08 22:58:13,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:58:13,175 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 367 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:13,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 77 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:58:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28315 states. [2025-01-08 22:58:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28315 to 27489. [2025-01-08 22:58:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27489 states, 27488 states have (on average 1.1477008149010477) internal successors, (31548), 27488 states have internal predecessors, (31548), 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-01-08 22:58:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27489 states to 27489 states and 31548 transitions. [2025-01-08 22:58:13,461 INFO L78 Accepts]: Start accepts. Automaton has 27489 states and 31548 transitions. Word has length 254 [2025-01-08 22:58:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:13,461 INFO L471 AbstractCegarLoop]: Abstraction has 27489 states and 31548 transitions. [2025-01-08 22:58:13,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 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-01-08 22:58:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 27489 states and 31548 transitions. [2025-01-08 22:58:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-01-08 22:58:13,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:13,481 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:13,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:58:13,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:13,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash -635997679, now seen corresponding path program 1 times [2025-01-08 22:58:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:13,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594210688] [2025-01-08 22:58:13,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:13,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:13,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-08 22:58:13,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-08 22:58:13,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:13,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 79 proven. 6 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-01-08 22:58:13,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:13,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594210688] [2025-01-08 22:58:13,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594210688] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:58:13,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553560386] [2025-01-08 22:58:13,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:13,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:13,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:58:13,690 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-01-08 22:58:13,692 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-01-08 22:58:13,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-08 22:58:13,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-08 22:58:13,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:13,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:13,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:58:13,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:58:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-08 22:58:13,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:58:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553560386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:13,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:58:13,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:58:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615642417] [2025-01-08 22:58:13,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:13,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:13,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:13,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:13,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:58:13,985 INFO L87 Difference]: Start difference. First operand 27489 states and 31548 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-01-08 22:58:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:14,567 INFO L93 Difference]: Finished difference Result 54373 states and 62387 transitions. [2025-01-08 22:58:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:14,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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 260 [2025-01-08 22:58:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:14,598 INFO L225 Difference]: With dead ends: 54373 [2025-01-08 22:58:14,598 INFO L226 Difference]: Without dead ends: 26886 [2025-01-08 22:58:14,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:58:14,619 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 117 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:14,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 290 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:58:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26886 states. [2025-01-08 22:58:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26886 to 26880. [2025-01-08 22:58:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26880 states, 26879 states have (on average 1.140183786599204) internal successors, (30647), 26879 states have internal predecessors, (30647), 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-01-08 22:58:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26880 states to 26880 states and 30647 transitions. [2025-01-08 22:58:14,849 INFO L78 Accepts]: Start accepts. Automaton has 26880 states and 30647 transitions. Word has length 260 [2025-01-08 22:58:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:14,849 INFO L471 AbstractCegarLoop]: Abstraction has 26880 states and 30647 transitions. [2025-01-08 22:58:14,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-01-08 22:58:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 26880 states and 30647 transitions. [2025-01-08 22:58:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-01-08 22:58:14,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:14,867 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:14,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:58:15,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:15,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:15,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:15,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1735548908, now seen corresponding path program 1 times [2025-01-08 22:58:15,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:15,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843918133] [2025-01-08 22:58:15,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:15,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:15,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-01-08 22:58:15,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-01-08 22:58:15,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:15,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-01-08 22:58:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:15,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843918133] [2025-01-08 22:58:15,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843918133] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:58:15,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919809487] [2025-01-08 22:58:15,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:15,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:15,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:58:15,382 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-01-08 22:58:15,384 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-01-08 22:58:15,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-01-08 22:58:15,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-01-08 22:58:15,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:15,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:15,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:58:15,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:58:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-08 22:58:15,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:58:15,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919809487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:15,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:58:15,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:58:15,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421339126] [2025-01-08 22:58:15,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:15,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:15,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:15,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:15,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:58:15,607 INFO L87 Difference]: Start difference. First operand 26880 states and 30647 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-01-08 22:58:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:16,179 INFO L93 Difference]: Finished difference Result 51710 states and 58822 transitions. [2025-01-08 22:58:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:16,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 330 [2025-01-08 22:58:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:16,216 INFO L225 Difference]: With dead ends: 51710 [2025-01-08 22:58:16,217 INFO L226 Difference]: Without dead ends: 24832 [2025-01-08 22:58:16,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:58:16,230 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 181 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:16,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 333 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:58:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24832 states. [2025-01-08 22:58:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24832 to 24829. [2025-01-08 22:58:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24829 states, 24828 states have (on average 1.1083856935717737) internal successors, (27519), 24828 states have internal predecessors, (27519), 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-01-08 22:58:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24829 states to 24829 states and 27519 transitions. [2025-01-08 22:58:16,529 INFO L78 Accepts]: Start accepts. Automaton has 24829 states and 27519 transitions. Word has length 330 [2025-01-08 22:58:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:16,529 INFO L471 AbstractCegarLoop]: Abstraction has 24829 states and 27519 transitions. [2025-01-08 22:58:16,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-01-08 22:58:16,530 INFO L276 IsEmpty]: Start isEmpty. Operand 24829 states and 27519 transitions. [2025-01-08 22:58:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-08 22:58:16,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:16,550 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:16,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:58:16,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:16,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:16,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:16,752 INFO L85 PathProgramCache]: Analyzing trace with hash -63472512, now seen corresponding path program 1 times [2025-01-08 22:58:16,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:16,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308418457] [2025-01-08 22:58:16,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:16,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:16,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-08 22:58:16,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-08 22:58:16,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:16,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-01-08 22:58:17,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:17,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308418457] [2025-01-08 22:58:17,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308418457] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:58:17,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786753002] [2025-01-08 22:58:17,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:17,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:17,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:58:17,132 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-01-08 22:58:17,134 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-01-08 22:58:17,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-08 22:58:17,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-08 22:58:17,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:17,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:17,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:58:17,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:58:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-08 22:58:17,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:58:17,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786753002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:17,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:58:17,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:58:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18084751] [2025-01-08 22:58:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:17,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:17,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:17,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:17,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:58:17,296 INFO L87 Difference]: Start difference. First operand 24829 states and 27519 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-01-08 22:58:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:17,591 INFO L93 Difference]: Finished difference Result 69380 states and 76985 transitions. [2025-01-08 22:58:17,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:17,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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 336 [2025-01-08 22:58:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:17,635 INFO L225 Difference]: With dead ends: 69380 [2025-01-08 22:58:17,635 INFO L226 Difference]: Without dead ends: 44553 [2025-01-08 22:58:17,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:58:17,656 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 292 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:17,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 855 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:58:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44553 states. [2025-01-08 22:58:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44553 to 44549. [2025-01-08 22:58:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44549 states, 44548 states have (on average 1.100947292807758) internal successors, (49045), 44548 states have internal predecessors, (49045), 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-01-08 22:58:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44549 states to 44549 states and 49045 transitions. [2025-01-08 22:58:18,123 INFO L78 Accepts]: Start accepts. Automaton has 44549 states and 49045 transitions. Word has length 336 [2025-01-08 22:58:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:18,124 INFO L471 AbstractCegarLoop]: Abstraction has 44549 states and 49045 transitions. [2025-01-08 22:58:18,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-01-08 22:58:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 44549 states and 49045 transitions. [2025-01-08 22:58:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-01-08 22:58:18,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:18,151 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:18,158 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-01-08 22:58:18,352 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,SelfDestructingSolverStorable13 [2025-01-08 22:58:18,352 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:18,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1807022167, now seen corresponding path program 1 times [2025-01-08 22:58:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:18,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137355279] [2025-01-08 22:58:18,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:18,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-08 22:58:18,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-08 22:58:18,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:18,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-01-08 22:58:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:18,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137355279] [2025-01-08 22:58:18,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137355279] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:58:18,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843188731] [2025-01-08 22:58:18,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:18,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:18,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:58:18,604 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-01-08 22:58:18,605 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-01-08 22:58:18,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-08 22:58:18,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-08 22:58:18,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:18,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:18,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:58:18,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:58:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-01-08 22:58:18,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:58:18,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843188731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:18,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:58:18,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:58:18,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866871275] [2025-01-08 22:58:18,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:18,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:58:18,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:18,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:58:18,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:58:18,889 INFO L87 Difference]: Start difference. First operand 44549 states and 49045 transitions. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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-01-08 22:58:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:19,648 INFO L93 Difference]: Finished difference Result 119996 states and 132177 transitions. [2025-01-08 22:58:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:58:19,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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 351 [2025-01-08 22:58:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:19,718 INFO L225 Difference]: With dead ends: 119996 [2025-01-08 22:58:19,719 INFO L226 Difference]: Without dead ends: 75449 [2025-01-08 22:58:19,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:58:19,754 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 759 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:19,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 313 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:58:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75449 states. [2025-01-08 22:58:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75449 to 71180. [2025-01-08 22:58:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71180 states, 71179 states have (on average 1.1035839222242516) internal successors, (78552), 71179 states have internal predecessors, (78552), 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-01-08 22:58:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71180 states to 71180 states and 78552 transitions. [2025-01-08 22:58:20,546 INFO L78 Accepts]: Start accepts. Automaton has 71180 states and 78552 transitions. Word has length 351 [2025-01-08 22:58:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:20,546 INFO L471 AbstractCegarLoop]: Abstraction has 71180 states and 78552 transitions. [2025-01-08 22:58:20,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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-01-08 22:58:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 71180 states and 78552 transitions. [2025-01-08 22:58:20,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-08 22:58:20,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:20,572 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:20,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 22:58:20,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-08 22:58:20,772 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:20,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:20,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1838112959, now seen corresponding path program 1 times [2025-01-08 22:58:20,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:20,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873231807] [2025-01-08 22:58:20,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:20,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:20,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-08 22:58:20,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-08 22:58:20,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:20,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-08 22:58:20,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873231807] [2025-01-08 22:58:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873231807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:20,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:58:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33516651] [2025-01-08 22:58:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:20,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:20,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:20,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:20,951 INFO L87 Difference]: Start difference. First operand 71180 states and 78552 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 2 states have internal predecessors, (272), 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-01-08 22:58:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:21,723 INFO L93 Difference]: Finished difference Result 211301 states and 233257 transitions. [2025-01-08 22:58:21,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:21,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 2 states have internal predecessors, (272), 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 352 [2025-01-08 22:58:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:21,875 INFO L225 Difference]: With dead ends: 211301 [2025-01-08 22:58:21,875 INFO L226 Difference]: Without dead ends: 140123 [2025-01-08 22:58:21,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:21,923 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 211 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:21,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 525 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:58:22,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140123 states. [2025-01-08 22:58:23,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140123 to 140121. [2025-01-08 22:58:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140121 states, 140120 states have (on average 1.1036754210676563) internal successors, (154647), 140120 states have internal predecessors, (154647), 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-01-08 22:58:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140121 states to 140121 states and 154647 transitions. [2025-01-08 22:58:23,687 INFO L78 Accepts]: Start accepts. Automaton has 140121 states and 154647 transitions. Word has length 352 [2025-01-08 22:58:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:23,687 INFO L471 AbstractCegarLoop]: Abstraction has 140121 states and 154647 transitions. [2025-01-08 22:58:23,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 2 states have internal predecessors, (272), 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-01-08 22:58:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 140121 states and 154647 transitions. [2025-01-08 22:58:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-08 22:58:23,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:23,713 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:23,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:58:23,713 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:23,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:23,713 INFO L85 PathProgramCache]: Analyzing trace with hash 985811747, now seen corresponding path program 1 times [2025-01-08 22:58:23,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:23,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655587226] [2025-01-08 22:58:23,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:23,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:23,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-08 22:58:23,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-08 22:58:23,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:23,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:24,097 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-08 22:58:24,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:24,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655587226] [2025-01-08 22:58:24,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655587226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:24,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:24,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:24,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130971898] [2025-01-08 22:58:24,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:24,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:24,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:24,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:24,098 INFO L87 Difference]: Start difference. First operand 140121 states and 154647 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-01-08 22:58:25,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:25,283 INFO L93 Difference]: Finished difference Result 282495 states and 312009 transitions. [2025-01-08 22:58:25,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:25,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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 365 [2025-01-08 22:58:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:25,458 INFO L225 Difference]: With dead ends: 282495 [2025-01-08 22:58:25,458 INFO L226 Difference]: Without dead ends: 142376 [2025-01-08 22:58:25,551 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-01-08 22:58:25,552 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 150 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:25,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 363 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:58:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142376 states. [2025-01-08 22:58:26,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142376 to 142376. [2025-01-08 22:58:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142376 states, 142375 states have (on average 1.1027989464442494) internal successors, (157011), 142375 states have internal predecessors, (157011), 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-01-08 22:58:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142376 states to 142376 states and 157011 transitions. [2025-01-08 22:58:27,267 INFO L78 Accepts]: Start accepts. Automaton has 142376 states and 157011 transitions. Word has length 365 [2025-01-08 22:58:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:27,267 INFO L471 AbstractCegarLoop]: Abstraction has 142376 states and 157011 transitions. [2025-01-08 22:58:27,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-01-08 22:58:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 142376 states and 157011 transitions. [2025-01-08 22:58:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-01-08 22:58:27,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:27,303 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:27,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:58:27,304 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:27,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1012497190, now seen corresponding path program 1 times [2025-01-08 22:58:27,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:27,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932515499] [2025-01-08 22:58:27,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:27,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:27,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-01-08 22:58:27,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-01-08 22:58:27,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:27,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 22:58:27,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:27,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932515499] [2025-01-08 22:58:27,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932515499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:27,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:27,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:27,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988465060] [2025-01-08 22:58:27,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:27,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:58:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:27,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:58:27,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:58:27,774 INFO L87 Difference]: Start difference. First operand 142376 states and 157011 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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-01-08 22:58:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:29,165 INFO L93 Difference]: Finished difference Result 406344 states and 448409 transitions. [2025-01-08 22:58:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:58:29,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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 373 [2025-01-08 22:58:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:29,814 INFO L225 Difference]: With dead ends: 406344 [2025-01-08 22:58:29,814 INFO L226 Difference]: Without dead ends: 263970 [2025-01-08 22:58:29,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:58:29,864 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 691 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:29,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 46 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263970 states. [2025-01-08 22:58:32,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263970 to 258262. [2025-01-08 22:58:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258262 states, 258261 states have (on average 1.1041272201377677) internal successors, (285153), 258261 states have internal predecessors, (285153), 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-01-08 22:58:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258262 states to 258262 states and 285153 transitions. [2025-01-08 22:58:33,105 INFO L78 Accepts]: Start accepts. Automaton has 258262 states and 285153 transitions. Word has length 373 [2025-01-08 22:58:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:33,105 INFO L471 AbstractCegarLoop]: Abstraction has 258262 states and 285153 transitions. [2025-01-08 22:58:33,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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-01-08 22:58:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 258262 states and 285153 transitions. [2025-01-08 22:58:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-08 22:58:33,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:33,154 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:33,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:58:33,155 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:33,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash 795202478, now seen corresponding path program 1 times [2025-01-08 22:58:33,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:33,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034342471] [2025-01-08 22:58:33,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:33,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:33,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-08 22:58:33,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-08 22:58:33,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:33,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 240 proven. 9 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-08 22:58:33,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:33,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034342471] [2025-01-08 22:58:33,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034342471] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:58:33,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811998433] [2025-01-08 22:58:33,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:33,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:33,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:58:33,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:58:33,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:58:33,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-08 22:58:33,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-08 22:58:33,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:33,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:33,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:58:33,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:58:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-08 22:58:33,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:58:33,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811998433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:33,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:58:33,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 22:58:33,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811239302] [2025-01-08 22:58:33,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:33,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:33,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:33,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:58:33,880 INFO L87 Difference]: Start difference. First operand 258262 states and 285153 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-01-08 22:58:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:35,508 INFO L93 Difference]: Finished difference Result 513716 states and 567424 transitions. [2025-01-08 22:58:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:35,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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 375 [2025-01-08 22:58:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:35,832 INFO L225 Difference]: With dead ends: 513716 [2025-01-08 22:58:35,832 INFO L226 Difference]: Without dead ends: 255456 [2025-01-08 22:58:35,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:58:35,908 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 210 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:35,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 376 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:58:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255456 states. [2025-01-08 22:58:38,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255456 to 250954. [2025-01-08 22:58:38,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250954 states, 250953 states have (on average 1.0982096249098436) internal successors, (275599), 250953 states have internal predecessors, (275599), 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-01-08 22:58:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250954 states to 250954 states and 275599 transitions. [2025-01-08 22:58:39,067 INFO L78 Accepts]: Start accepts. Automaton has 250954 states and 275599 transitions. Word has length 375 [2025-01-08 22:58:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:39,067 INFO L471 AbstractCegarLoop]: Abstraction has 250954 states and 275599 transitions. [2025-01-08 22:58:39,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-01-08 22:58:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 250954 states and 275599 transitions. [2025-01-08 22:58:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-01-08 22:58:39,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:39,110 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:39,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-08 22:58:39,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:39,310 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:39,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash -888455343, now seen corresponding path program 1 times [2025-01-08 22:58:39,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:39,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550758970] [2025-01-08 22:58:39,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:39,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:39,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-01-08 22:58:39,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-01-08 22:58:39,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:39,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 22:58:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550758970] [2025-01-08 22:58:39,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550758970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:39,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:39,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:39,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546978115] [2025-01-08 22:58:39,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:39,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:39,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:39,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:39,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:39,474 INFO L87 Difference]: Start difference. First operand 250954 states and 275599 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-01-08 22:58:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:41,566 INFO L93 Difference]: Finished difference Result 486050 states and 533448 transitions. [2025-01-08 22:58:41,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:41,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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 377 [2025-01-08 22:58:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:41,861 INFO L225 Difference]: With dead ends: 486050 [2025-01-08 22:58:41,861 INFO L226 Difference]: Without dead ends: 235098 [2025-01-08 22:58:41,939 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-01-08 22:58:41,939 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 176 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:41,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 323 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235098 states. [2025-01-08 22:58:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235098 to 216601. [2025-01-08 22:58:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216601 states, 216600 states have (on average 1.0807202216066483) internal successors, (234084), 216600 states have internal predecessors, (234084), 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-01-08 22:58:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216601 states to 216601 states and 234084 transitions. [2025-01-08 22:58:44,416 INFO L78 Accepts]: Start accepts. Automaton has 216601 states and 234084 transitions. Word has length 377 [2025-01-08 22:58:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:44,417 INFO L471 AbstractCegarLoop]: Abstraction has 216601 states and 234084 transitions. [2025-01-08 22:58:44,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-01-08 22:58:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 216601 states and 234084 transitions. [2025-01-08 22:58:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-01-08 22:58:44,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:44,444 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:44,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 22:58:44,444 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:44,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:44,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1869441678, now seen corresponding path program 1 times [2025-01-08 22:58:44,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:44,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622860949] [2025-01-08 22:58:44,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:44,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:44,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-01-08 22:58:44,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-01-08 22:58:44,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:44,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-01-08 22:58:45,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:45,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622860949] [2025-01-08 22:58:45,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622860949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:45,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:45,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:45,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090996974] [2025-01-08 22:58:45,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:45,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:45,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:45,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:45,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:45,115 INFO L87 Difference]: Start difference. First operand 216601 states and 234084 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-01-08 22:58:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:46,780 INFO L93 Difference]: Finished difference Result 455632 states and 493111 transitions. [2025-01-08 22:58:46,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:46,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 385 [2025-01-08 22:58:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:47,044 INFO L225 Difference]: With dead ends: 455632 [2025-01-08 22:58:47,044 INFO L226 Difference]: Without dead ends: 213658 [2025-01-08 22:58:47,152 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-01-08 22:58:47,153 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 167 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:47,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 350 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:58:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213658 states. [2025-01-08 22:58:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213658 to 187133. [2025-01-08 22:58:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187133 states, 187132 states have (on average 1.0528824573028663) internal successors, (197028), 187132 states have internal predecessors, (197028), 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-01-08 22:58:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187133 states to 187133 states and 197028 transitions. [2025-01-08 22:58:49,380 INFO L78 Accepts]: Start accepts. Automaton has 187133 states and 197028 transitions. Word has length 385 [2025-01-08 22:58:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:49,380 INFO L471 AbstractCegarLoop]: Abstraction has 187133 states and 197028 transitions. [2025-01-08 22:58:49,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-01-08 22:58:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 187133 states and 197028 transitions. [2025-01-08 22:58:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-01-08 22:58:49,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:49,399 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:49,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:58:49,400 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:49,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1561489965, now seen corresponding path program 1 times [2025-01-08 22:58:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:49,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353335596] [2025-01-08 22:58:49,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:49,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-01-08 22:58:49,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-01-08 22:58:49,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:49,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat