./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label41.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/Problem17_label41.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 f21db4ac76946ee444b77ff65c558a63b1f97c46b1265b72698e02c79e47e23e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:14:11,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:14:11,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:14:11,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:14:11,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:14:11,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:14:11,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:14:11,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:14:11,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:14:11,222 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:14:11,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:14:11,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:14:11,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:14:11,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:14:11,223 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:14:11,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:14:11,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:14:11,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:14:11,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:14:11,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:14:11,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:14:11,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:14:11,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:14:11,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:14:11,224 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:14:11,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:14:11,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:14:11,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:14:11,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:14:11,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:14:11,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:14:11,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:14:11,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:11,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:14:11,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:14:11,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:14:11,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:14:11,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:11,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:14:11,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:14:11,226 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:14:11,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:14:11,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:14:11,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:14:11,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:14:11,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:14:11,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:14:11,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:14:11,226 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 -> f21db4ac76946ee444b77ff65c558a63b1f97c46b1265b72698e02c79e47e23e [2025-01-09 00:14:11,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:14:11,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:14:11,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:14:11,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:14:11,471 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:14:11,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label41.c [2025-01-09 00:14:12,597 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2a29972b/6592807e864f45708ad0775ed428ae07/FLAG9af987484 [2025-01-09 00:14:13,023 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:14:13,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label41.c [2025-01-09 00:14:13,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2a29972b/6592807e864f45708ad0775ed428ae07/FLAG9af987484 [2025-01-09 00:14:13,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2a29972b/6592807e864f45708ad0775ed428ae07 [2025-01-09 00:14:13,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:14:13,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:14:13,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:14:13,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:14:13,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:14:13,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:13,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d49933d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13, skipping insertion in model container [2025-01-09 00:14:13,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:13,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:14:13,398 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/Problem17_label41.c[5202,5215] [2025-01-09 00:14:13,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:14:13,709 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:14:13,724 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/Problem17_label41.c[5202,5215] [2025-01-09 00:14:13,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:14:13,927 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:14:13,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13 WrapperNode [2025-01-09 00:14:13,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:14:13,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:14:13,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:14:13,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:14:13,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:13,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:14,171 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:14:14,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:14:14,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:14:14,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:14:14,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:14:14,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:14,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:14,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:14,385 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-09 00:14:14,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:14,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:14,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:14,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:14,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:14,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:14,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:14,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:14:14,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:14:14,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:14:14,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:14:14,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (1/1) ... [2025-01-09 00:14:14,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:14:14,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:14:14,587 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-09 00:14:14,590 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-09 00:14:14,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:14:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:14:14,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:14:14,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:14:14,660 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:14:14,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:14:17,358 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:14:17,358 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:14:17,376 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:14:17,377 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:14:17,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:14:17 BoogieIcfgContainer [2025-01-09 00:14:17,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:14:17,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:14:17,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:14:17,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:14:17,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:14:13" (1/3) ... [2025-01-09 00:14:17,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d97442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:14:17, skipping insertion in model container [2025-01-09 00:14:17,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:14:13" (2/3) ... [2025-01-09 00:14:17,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d97442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:14:17, skipping insertion in model container [2025-01-09 00:14:17,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:14:17" (3/3) ... [2025-01-09 00:14:17,385 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label41.c [2025-01-09 00:14:17,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:14:17,399 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label41.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:14:17,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:14:17,489 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;@2b848412, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:14:17,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:14:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 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-09 00:14:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 00:14:17,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:17,498 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] [2025-01-09 00:14:17,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:17,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:17,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1410235526, now seen corresponding path program 1 times [2025-01-09 00:14:17,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:17,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169578855] [2025-01-09 00:14:17,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:17,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 00:14:17,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 00:14:17,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:17,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:17,738 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-09 00:14:17,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169578855] [2025-01-09 00:14:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169578855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:17,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:17,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:17,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054132059] [2025-01-09 00:14:17,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:17,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:17,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:17,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:17,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:17,763 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 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 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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-09 00:14:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:19,648 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-01-09 00:14:19,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:19,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-01-09 00:14:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:19,659 INFO L225 Difference]: With dead ends: 1642 [2025-01-09 00:14:19,660 INFO L226 Difference]: Without dead ends: 975 [2025-01-09 00:14:19,663 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-09 00:14:19,666 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 456 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:19,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 550 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:14:19,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-01-09 00:14:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-01-09 00:14:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 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-09 00:14:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-01-09 00:14:19,748 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 34 [2025-01-09 00:14:19,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:19,748 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-01-09 00:14:19,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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-09 00:14:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-01-09 00:14:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 00:14:19,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:19,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:19,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:14:19,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:19,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1487347930, now seen corresponding path program 1 times [2025-01-09 00:14:19,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:19,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277815342] [2025-01-09 00:14:19,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:19,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:19,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 00:14:19,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 00:14:19,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:19,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:20,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277815342] [2025-01-09 00:14:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277815342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:20,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:20,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:20,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284525009] [2025-01-09 00:14:20,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:20,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:20,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:20,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:20,031 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-09 00:14:21,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:21,722 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2025-01-09 00:14:21,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:21,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2025-01-09 00:14:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:21,728 INFO L225 Difference]: With dead ends: 2814 [2025-01-09 00:14:21,729 INFO L226 Difference]: Without dead ends: 1844 [2025-01-09 00:14:21,731 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-09 00:14:21,735 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 457 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:21,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 920 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:14:21,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-01-09 00:14:21,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2025-01-09 00:14:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 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-09 00:14:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2025-01-09 00:14:21,767 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 104 [2025-01-09 00:14:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:21,769 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2025-01-09 00:14:21,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-09 00:14:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2025-01-09 00:14:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 00:14:21,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:21,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:21,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:14:21,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:21,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2117817705, now seen corresponding path program 1 times [2025-01-09 00:14:21,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:21,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369146717] [2025-01-09 00:14:21,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:21,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:21,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 00:14:21,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 00:14:21,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:21,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:21,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:21,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369146717] [2025-01-09 00:14:21,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369146717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:21,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783446565] [2025-01-09 00:14:21,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:21,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:21,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:21,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:21,936 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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-09 00:14:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:23,698 INFO L93 Difference]: Finished difference Result 5445 states and 7408 transitions. [2025-01-09 00:14:23,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:23,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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 126 [2025-01-09 00:14:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:23,709 INFO L225 Difference]: With dead ends: 5445 [2025-01-09 00:14:23,709 INFO L226 Difference]: Without dead ends: 3605 [2025-01-09 00:14:23,711 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-09 00:14:23,712 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 440 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:23,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 272 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:14:23,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3605 states. [2025-01-09 00:14:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3605 to 3583. [2025-01-09 00:14:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 3582 states have (on average 1.3358458961474038) internal successors, (4785), 3582 states have internal predecessors, (4785), 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-09 00:14:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4785 transitions. [2025-01-09 00:14:23,767 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4785 transitions. Word has length 126 [2025-01-09 00:14:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:23,769 INFO L471 AbstractCegarLoop]: Abstraction has 3583 states and 4785 transitions. [2025-01-09 00:14:23,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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-09 00:14:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4785 transitions. [2025-01-09 00:14:23,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 00:14:23,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:23,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:23,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:14:23,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:23,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1483091161, now seen corresponding path program 1 times [2025-01-09 00:14:23,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:23,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019729116] [2025-01-09 00:14:23,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:23,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:23,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 00:14:23,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 00:14:23,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:23,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:24,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:24,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019729116] [2025-01-09 00:14:24,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019729116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:24,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:24,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:24,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822967579] [2025-01-09 00:14:24,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:24,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:24,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:24,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:24,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:24,110 INFO L87 Difference]: Start difference. First operand 3583 states and 4785 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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-09 00:14:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:25,757 INFO L93 Difference]: Finished difference Result 8893 states and 11846 transitions. [2025-01-09 00:14:25,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:25,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 139 [2025-01-09 00:14:25,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:25,772 INFO L225 Difference]: With dead ends: 8893 [2025-01-09 00:14:25,773 INFO L226 Difference]: Without dead ends: 5312 [2025-01-09 00:14:25,777 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-09 00:14:25,778 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 352 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:25,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 537 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:14:25,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2025-01-09 00:14:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 5292. [2025-01-09 00:14:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5292 states, 5291 states have (on average 1.2797202797202798) internal successors, (6771), 5291 states have internal predecessors, (6771), 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-09 00:14:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 6771 transitions. [2025-01-09 00:14:25,922 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 6771 transitions. Word has length 139 [2025-01-09 00:14:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:25,923 INFO L471 AbstractCegarLoop]: Abstraction has 5292 states and 6771 transitions. [2025-01-09 00:14:25,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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-09 00:14:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 6771 transitions. [2025-01-09 00:14:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 00:14:25,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:25,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:25,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:14:25,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:25,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2116727192, now seen corresponding path program 1 times [2025-01-09 00:14:25,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:25,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617610989] [2025-01-09 00:14:25,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:25,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 00:14:25,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 00:14:25,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:25,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:26,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:26,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617610989] [2025-01-09 00:14:26,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617610989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:26,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:26,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:14:26,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453420309] [2025-01-09 00:14:26,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:26,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:26,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:26,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:26,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:26,133 INFO L87 Difference]: Start difference. First operand 5292 states and 6771 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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-09 00:14:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:27,576 INFO L93 Difference]: Finished difference Result 12705 states and 16558 transitions. [2025-01-09 00:14:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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 145 [2025-01-09 00:14:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:27,591 INFO L225 Difference]: With dead ends: 12705 [2025-01-09 00:14:27,592 INFO L226 Difference]: Without dead ends: 5711 [2025-01-09 00:14:27,596 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-09 00:14:27,597 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:27,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:14:27,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2025-01-09 00:14:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 4427. [2025-01-09 00:14:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4427 states, 4426 states have (on average 1.208992318120199) internal successors, (5351), 4426 states have internal predecessors, (5351), 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-09 00:14:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 5351 transitions. [2025-01-09 00:14:27,666 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 5351 transitions. Word has length 145 [2025-01-09 00:14:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:27,666 INFO L471 AbstractCegarLoop]: Abstraction has 4427 states and 5351 transitions. [2025-01-09 00:14:27,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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-09 00:14:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 5351 transitions. [2025-01-09 00:14:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 00:14:27,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:27,669 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:27,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:14:27,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:27,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash -335718563, now seen corresponding path program 1 times [2025-01-09 00:14:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:27,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074743344] [2025-01-09 00:14:27,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:27,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:27,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 00:14:27,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 00:14:27,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:27,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074743344] [2025-01-09 00:14:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074743344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:27,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:27,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972795763] [2025-01-09 00:14:27,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:27,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:27,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:27,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:27,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:27,880 INFO L87 Difference]: Start difference. First operand 4427 states and 5351 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-09 00:14:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:29,177 INFO L93 Difference]: Finished difference Result 11399 states and 13997 transitions. [2025-01-09 00:14:29,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:29,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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 186 [2025-01-09 00:14:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:29,193 INFO L225 Difference]: With dead ends: 11399 [2025-01-09 00:14:29,193 INFO L226 Difference]: Without dead ends: 6974 [2025-01-09 00:14:29,196 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-09 00:14:29,197 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:29,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:14:29,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2025-01-09 00:14:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6974. [2025-01-09 00:14:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6974 states, 6973 states have (on average 1.1834217696830633) internal successors, (8252), 6973 states have internal predecessors, (8252), 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-09 00:14:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8252 transitions. [2025-01-09 00:14:29,275 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8252 transitions. Word has length 186 [2025-01-09 00:14:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:29,276 INFO L471 AbstractCegarLoop]: Abstraction has 6974 states and 8252 transitions. [2025-01-09 00:14:29,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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-09 00:14:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8252 transitions. [2025-01-09 00:14:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-09 00:14:29,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:29,277 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:29,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:14:29,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:29,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:29,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1980367480, now seen corresponding path program 1 times [2025-01-09 00:14:29,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:29,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434576565] [2025-01-09 00:14:29,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:29,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:29,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 00:14:29,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 00:14:29,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:29,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:14:29,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:29,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434576565] [2025-01-09 00:14:29,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434576565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:29,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:29,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:29,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102507428] [2025-01-09 00:14:29,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:29,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:29,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:29,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:29,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:29,372 INFO L87 Difference]: Start difference. First operand 6974 states and 8252 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-09 00:14:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:30,687 INFO L93 Difference]: Finished difference Result 16914 states and 20159 transitions. [2025-01-09 00:14:30,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 188 [2025-01-09 00:14:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:30,708 INFO L225 Difference]: With dead ends: 16914 [2025-01-09 00:14:30,709 INFO L226 Difference]: Without dead ends: 9941 [2025-01-09 00:14:30,715 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-09 00:14:30,716 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 417 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:30,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:14:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9941 states. [2025-01-09 00:14:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9941 to 7373. [2025-01-09 00:14:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7373 states, 7372 states have (on average 1.1795984807379274) internal successors, (8696), 7372 states have internal predecessors, (8696), 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-09 00:14:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 8696 transitions. [2025-01-09 00:14:30,816 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 8696 transitions. Word has length 188 [2025-01-09 00:14:30,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:30,817 INFO L471 AbstractCegarLoop]: Abstraction has 7373 states and 8696 transitions. [2025-01-09 00:14:30,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-09 00:14:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 8696 transitions. [2025-01-09 00:14:30,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-01-09 00:14:30,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:30,824 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:30,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:14:30,824 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:30,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:30,824 INFO L85 PathProgramCache]: Analyzing trace with hash 639025438, now seen corresponding path program 1 times [2025-01-09 00:14:30,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:30,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793018260] [2025-01-09 00:14:30,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:30,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:30,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-09 00:14:30,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-09 00:14:30,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:30,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:14:31,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:31,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793018260] [2025-01-09 00:14:31,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793018260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:31,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:31,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537034896] [2025-01-09 00:14:31,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:31,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:31,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:31,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:31,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:31,008 INFO L87 Difference]: Start difference. First operand 7373 states and 8696 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-09 00:14:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:32,252 INFO L93 Difference]: Finished difference Result 16027 states and 18850 transitions. [2025-01-09 00:14:32,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:32,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-09 00:14:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:32,270 INFO L225 Difference]: With dead ends: 16027 [2025-01-09 00:14:32,271 INFO L226 Difference]: Without dead ends: 8656 [2025-01-09 00:14:32,276 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-09 00:14:32,276 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 402 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:32,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 894 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:14:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2025-01-09 00:14:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 8225. [2025-01-09 00:14:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8225 states, 8224 states have (on average 1.1723005836575875) internal successors, (9641), 8224 states have internal predecessors, (9641), 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-09 00:14:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8225 states to 8225 states and 9641 transitions. [2025-01-09 00:14:32,354 INFO L78 Accepts]: Start accepts. Automaton has 8225 states and 9641 transitions. Word has length 254 [2025-01-09 00:14:32,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:32,355 INFO L471 AbstractCegarLoop]: Abstraction has 8225 states and 9641 transitions. [2025-01-09 00:14:32,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-09 00:14:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 8225 states and 9641 transitions. [2025-01-09 00:14:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-01-09 00:14:32,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:32,358 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:32,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:14:32,359 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:32,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:32,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1297929445, now seen corresponding path program 1 times [2025-01-09 00:14:32,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:32,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463752998] [2025-01-09 00:14:32,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:32,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:32,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-09 00:14:32,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-09 00:14:32,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:32,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 00:14:32,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:32,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463752998] [2025-01-09 00:14:32,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463752998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:32,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:32,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:32,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420878994] [2025-01-09 00:14:32,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:32,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:32,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:32,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:32,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:32,498 INFO L87 Difference]: Start difference. First operand 8225 states and 9641 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-09 00:14:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:33,952 INFO L93 Difference]: Finished difference Result 19849 states and 23600 transitions. [2025-01-09 00:14:33,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:33,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 266 [2025-01-09 00:14:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:33,971 INFO L225 Difference]: With dead ends: 19849 [2025-01-09 00:14:33,971 INFO L226 Difference]: Without dead ends: 11201 [2025-01-09 00:14:33,978 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-09 00:14:33,979 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:33,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 846 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:14:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11201 states. [2025-01-09 00:14:34,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11201 to 11201. [2025-01-09 00:14:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11201 states, 11200 states have (on average 1.1403571428571428) internal successors, (12772), 11200 states have internal predecessors, (12772), 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-09 00:14:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11201 states to 11201 states and 12772 transitions. [2025-01-09 00:14:34,068 INFO L78 Accepts]: Start accepts. Automaton has 11201 states and 12772 transitions. Word has length 266 [2025-01-09 00:14:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:34,069 INFO L471 AbstractCegarLoop]: Abstraction has 11201 states and 12772 transitions. [2025-01-09 00:14:34,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-09 00:14:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 11201 states and 12772 transitions. [2025-01-09 00:14:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-01-09 00:14:34,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:34,073 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 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-09 00:14:34,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:14:34,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:34,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash 648579326, now seen corresponding path program 1 times [2025-01-09 00:14:34,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:34,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24901885] [2025-01-09 00:14:34,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:34,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 00:14:34,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 00:14:34,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:34,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-01-09 00:14:34,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:34,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24901885] [2025-01-09 00:14:34,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24901885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:34,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:34,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:34,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079079501] [2025-01-09 00:14:34,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:34,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:34,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:34,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:34,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:34,283 INFO L87 Difference]: Start difference. First operand 11201 states and 12772 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-09 00:14:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:35,601 INFO L93 Difference]: Finished difference Result 27972 states and 31901 transitions. [2025-01-09 00:14:35,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:35,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 306 [2025-01-09 00:14:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:35,626 INFO L225 Difference]: With dead ends: 27972 [2025-01-09 00:14:35,626 INFO L226 Difference]: Without dead ends: 16773 [2025-01-09 00:14:35,635 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-09 00:14:35,636 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 476 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:35,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 290 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:14:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16773 states. [2025-01-09 00:14:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16773 to 16326. [2025-01-09 00:14:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16326 states, 16325 states have (on average 1.1319448698315466) internal successors, (18479), 16325 states have internal predecessors, (18479), 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-09 00:14:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16326 states to 16326 states and 18479 transitions. [2025-01-09 00:14:35,789 INFO L78 Accepts]: Start accepts. Automaton has 16326 states and 18479 transitions. Word has length 306 [2025-01-09 00:14:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:35,789 INFO L471 AbstractCegarLoop]: Abstraction has 16326 states and 18479 transitions. [2025-01-09 00:14:35,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-09 00:14:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 16326 states and 18479 transitions. [2025-01-09 00:14:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-09 00:14:35,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:35,794 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:35,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:14:35,794 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:35,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:35,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1186625982, now seen corresponding path program 1 times [2025-01-09 00:14:35,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:35,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303515558] [2025-01-09 00:14:35,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:35,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:35,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 00:14:35,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 00:14:35,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:35,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 63 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:36,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:36,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303515558] [2025-01-09 00:14:36,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303515558] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:14:36,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162291911] [2025-01-09 00:14:36,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:36,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:14:36,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:14:36,257 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-09 00:14:36,259 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-09 00:14:36,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 00:14:36,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 00:14:36,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:36,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:36,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:14:36,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:14:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 32 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:36,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:14:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:37,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162291911] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:14:37,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:14:37,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2025-01-09 00:14:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933683790] [2025-01-09 00:14:37,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:37,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:14:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:37,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:14:37,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:14:37,078 INFO L87 Difference]: Start difference. First operand 16326 states and 18479 transitions. Second operand has 5 states, 5 states have (on average 64.6) internal successors, (323), 4 states have internal predecessors, (323), 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-09 00:14:40,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:40,100 INFO L93 Difference]: Finished difference Result 54851 states and 62648 transitions. [2025-01-09 00:14:40,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:14:40,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 64.6) internal successors, (323), 4 states have internal predecessors, (323), 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 323 [2025-01-09 00:14:40,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:40,147 INFO L225 Difference]: With dead ends: 54851 [2025-01-09 00:14:40,147 INFO L226 Difference]: Without dead ends: 37242 [2025-01-09 00:14:40,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:14:40,161 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1665 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2782 mSolverCounterSat, 1269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 4051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1269 IncrementalHoareTripleChecker+Valid, 2782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:40,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 234 Invalid, 4051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1269 Valid, 2782 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 00:14:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37242 states. [2025-01-09 00:14:40,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37242 to 37233. [2025-01-09 00:14:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37233 states, 37232 states have (on average 1.1239256553502364) internal successors, (41846), 37232 states have internal predecessors, (41846), 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-09 00:14:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37233 states to 37233 states and 41846 transitions. [2025-01-09 00:14:40,551 INFO L78 Accepts]: Start accepts. Automaton has 37233 states and 41846 transitions. Word has length 323 [2025-01-09 00:14:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:40,551 INFO L471 AbstractCegarLoop]: Abstraction has 37233 states and 41846 transitions. [2025-01-09 00:14:40,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.6) internal successors, (323), 4 states have internal predecessors, (323), 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-09 00:14:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 37233 states and 41846 transitions. [2025-01-09 00:14:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-01-09 00:14:40,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:40,559 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-01-09 00:14:40,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:14:40,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 00:14:40,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:40,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:40,761 INFO L85 PathProgramCache]: Analyzing trace with hash 229187448, now seen corresponding path program 1 times [2025-01-09 00:14:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:40,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608303168] [2025-01-09 00:14:40,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:40,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:40,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 00:14:40,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 00:14:40,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:40,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-01-09 00:14:41,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:41,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608303168] [2025-01-09 00:14:41,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608303168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:41,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:41,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:41,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856334008] [2025-01-09 00:14:41,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:41,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:41,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:41,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:41,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:41,040 INFO L87 Difference]: Start difference. First operand 37233 states and 41846 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-09 00:14:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:42,291 INFO L93 Difference]: Finished difference Result 80419 states and 90576 transitions. [2025-01-09 00:14:42,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:42,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 448 [2025-01-09 00:14:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:42,334 INFO L225 Difference]: With dead ends: 80419 [2025-01-09 00:14:42,334 INFO L226 Difference]: Without dead ends: 43188 [2025-01-09 00:14:42,359 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-09 00:14:42,362 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 407 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:42,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 862 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:14:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43188 states. [2025-01-09 00:14:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43188 to 42762. [2025-01-09 00:14:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42762 states, 42761 states have (on average 1.1157363017703048) internal successors, (47710), 42761 states have internal predecessors, (47710), 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-09 00:14:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42762 states to 42762 states and 47710 transitions. [2025-01-09 00:14:42,856 INFO L78 Accepts]: Start accepts. Automaton has 42762 states and 47710 transitions. Word has length 448 [2025-01-09 00:14:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:42,858 INFO L471 AbstractCegarLoop]: Abstraction has 42762 states and 47710 transitions. [2025-01-09 00:14:42,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-09 00:14:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 42762 states and 47710 transitions. [2025-01-09 00:14:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-01-09 00:14:42,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:42,971 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:14:42,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:14:42,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:42,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:42,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1012475780, now seen corresponding path program 1 times [2025-01-09 00:14:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:42,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239718599] [2025-01-09 00:14:42,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:43,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-01-09 00:14:43,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-01-09 00:14:43,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:43,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 332 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:43,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:43,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239718599] [2025-01-09 00:14:43,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239718599] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:14:43,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869152287] [2025-01-09 00:14:43,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:43,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:14:43,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:14:43,743 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-09 00:14:43,745 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-09 00:14:43,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-01-09 00:14:43,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-01-09 00:14:43,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:43,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:43,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:14:43,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:14:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 00:14:44,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:14:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 00:14:44,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869152287] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:14:44,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:14:44,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-01-09 00:14:44,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076464989] [2025-01-09 00:14:44,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:14:44,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:14:44,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:44,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:14:44,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:14:44,953 INFO L87 Difference]: Start difference. First operand 42762 states and 47710 transitions. Second operand has 9 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 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-09 00:14:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:53,419 INFO L93 Difference]: Finished difference Result 170365 states and 190174 transitions. [2025-01-09 00:14:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 00:14:53,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 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 469 [2025-01-09 00:14:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:53,551 INFO L225 Difference]: With dead ends: 170365 [2025-01-09 00:14:53,551 INFO L226 Difference]: Without dead ends: 126330 [2025-01-09 00:14:53,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 944 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 00:14:53,577 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 7929 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 11438 mSolverCounterSat, 2189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7929 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 13627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2189 IncrementalHoareTripleChecker+Valid, 11438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:53,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7929 Valid, 474 Invalid, 13627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2189 Valid, 11438 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-01-09 00:14:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126330 states. [2025-01-09 00:14:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126330 to 112275. [2025-01-09 00:14:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112275 states, 112274 states have (on average 1.0952580294636336) internal successors, (122969), 112274 states have internal predecessors, (122969), 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-09 00:14:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112275 states to 112275 states and 122969 transitions. [2025-01-09 00:14:54,796 INFO L78 Accepts]: Start accepts. Automaton has 112275 states and 122969 transitions. Word has length 469 [2025-01-09 00:14:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:54,797 INFO L471 AbstractCegarLoop]: Abstraction has 112275 states and 122969 transitions. [2025-01-09 00:14:54,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 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-09 00:14:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 112275 states and 122969 transitions. [2025-01-09 00:14:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-01-09 00:14:54,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:54,807 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-01-09 00:14:54,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:14:55,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:14:55,008 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:55,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:55,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1859513147, now seen corresponding path program 1 times [2025-01-09 00:14:55,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:55,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866042798] [2025-01-09 00:14:55,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:55,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:55,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-01-09 00:14:55,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-01-09 00:14:55,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:55,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:14:55,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:55,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866042798] [2025-01-09 00:14:55,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866042798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:55,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:55,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:14:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844189410] [2025-01-09 00:14:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:55,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:14:55,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:55,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:14:55,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:14:55,593 INFO L87 Difference]: Start difference. First operand 112275 states and 122969 transitions. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 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-09 00:14:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:58,315 INFO L93 Difference]: Finished difference Result 256506 states and 281881 transitions. [2025-01-09 00:14:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:14:58,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 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 512 [2025-01-09 00:14:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:58,469 INFO L225 Difference]: With dead ends: 256506 [2025-01-09 00:14:58,469 INFO L226 Difference]: Without dead ends: 133575 [2025-01-09 00:14:58,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:14:58,518 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 706 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:58,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 784 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:14:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133575 states. [2025-01-09 00:14:59,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133575 to 131820. [2025-01-09 00:14:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131820 states, 131819 states have (on average 1.0950697547394534) internal successors, (144351), 131819 states have internal predecessors, (144351), 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-09 00:15:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131820 states to 131820 states and 144351 transitions. [2025-01-09 00:15:00,363 INFO L78 Accepts]: Start accepts. Automaton has 131820 states and 144351 transitions. Word has length 512 [2025-01-09 00:15:00,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:00,363 INFO L471 AbstractCegarLoop]: Abstraction has 131820 states and 144351 transitions. [2025-01-09 00:15:00,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 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-09 00:15:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 131820 states and 144351 transitions. [2025-01-09 00:15:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-01-09 00:15:00,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:00,379 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:15:00,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:15:00,379 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:00,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1099743096, now seen corresponding path program 1 times [2025-01-09 00:15:00,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:00,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930367491] [2025-01-09 00:15:00,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:00,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:00,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-01-09 00:15:00,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-01-09 00:15:00,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:00,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:15:01,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:01,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930367491] [2025-01-09 00:15:01,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930367491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:01,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:01,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:01,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472375944] [2025-01-09 00:15:01,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:01,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:01,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:01,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:01,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:01,040 INFO L87 Difference]: Start difference. First operand 131820 states and 144351 transitions. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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-09 00:15:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:02,285 INFO L93 Difference]: Finished difference Result 263211 states and 288271 transitions. [2025-01-09 00:15:02,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:02,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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 601 [2025-01-09 00:15:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:02,416 INFO L225 Difference]: With dead ends: 263211 [2025-01-09 00:15:02,416 INFO L226 Difference]: Without dead ends: 131818 [2025-01-09 00:15:02,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-09 00:15:02,492 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 593 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:02,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 568 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:15:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131818 states. [2025-01-09 00:15:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131818 to 131818. [2025-01-09 00:15:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131818 states, 131817 states have (on average 1.0949118854169038) internal successors, (144328), 131817 states have internal predecessors, (144328), 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-09 00:15:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131818 states to 131818 states and 144328 transitions. [2025-01-09 00:15:04,248 INFO L78 Accepts]: Start accepts. Automaton has 131818 states and 144328 transitions. Word has length 601 [2025-01-09 00:15:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:04,249 INFO L471 AbstractCegarLoop]: Abstraction has 131818 states and 144328 transitions. [2025-01-09 00:15:04,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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-09 00:15:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 131818 states and 144328 transitions. [2025-01-09 00:15:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-01-09 00:15:04,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:04,272 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:15:04,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:15:04,272 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:04,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash 2099904520, now seen corresponding path program 1 times [2025-01-09 00:15:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:04,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448822273] [2025-01-09 00:15:04,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:04,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-01-09 00:15:04,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-01-09 00:15:04,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:04,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:15:04,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448822273] [2025-01-09 00:15:04,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448822273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:04,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:04,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:04,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936853597] [2025-01-09 00:15:04,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:04,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:04,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:04,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:04,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:04,848 INFO L87 Difference]: Start difference. First operand 131818 states and 144328 transitions. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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-09 00:15:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:06,382 INFO L93 Difference]: Finished difference Result 273421 states and 299130 transitions. [2025-01-09 00:15:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:06,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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 603 [2025-01-09 00:15:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:06,526 INFO L225 Difference]: With dead ends: 273421 [2025-01-09 00:15:06,526 INFO L226 Difference]: Without dead ends: 142030 [2025-01-09 00:15:06,590 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-09 00:15:06,591 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 232 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:06,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 328 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:15:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142030 states. [2025-01-09 00:15:08,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142030 to 137768. [2025-01-09 00:15:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137768 states, 137767 states have (on average 1.091473284603715) internal successors, (150369), 137767 states have internal predecessors, (150369), 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-09 00:15:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137768 states to 137768 states and 150369 transitions. [2025-01-09 00:15:08,456 INFO L78 Accepts]: Start accepts. Automaton has 137768 states and 150369 transitions. Word has length 603 [2025-01-09 00:15:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:08,456 INFO L471 AbstractCegarLoop]: Abstraction has 137768 states and 150369 transitions. [2025-01-09 00:15:08,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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-09 00:15:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 137768 states and 150369 transitions. [2025-01-09 00:15:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-01-09 00:15:08,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:08,478 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:15:08,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:15:08,478 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:08,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:08,479 INFO L85 PathProgramCache]: Analyzing trace with hash -732560940, now seen corresponding path program 1 times [2025-01-09 00:15:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:08,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415290945] [2025-01-09 00:15:08,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:08,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:08,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-01-09 00:15:08,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-01-09 00:15:08,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:08,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2025-01-09 00:15:08,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415290945] [2025-01-09 00:15:08,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415290945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:08,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:08,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:08,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578327521] [2025-01-09 00:15:08,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:08,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:08,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:08,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:08,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:08,944 INFO L87 Difference]: Start difference. First operand 137768 states and 150369 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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-09 00:15:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:10,528 INFO L93 Difference]: Finished difference Result 271271 states and 295998 transitions. [2025-01-09 00:15:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:10,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 611 [2025-01-09 00:15:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:10,666 INFO L225 Difference]: With dead ends: 271271 [2025-01-09 00:15:10,666 INFO L226 Difference]: Without dead ends: 133500 [2025-01-09 00:15:10,719 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-09 00:15:10,719 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 459 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:10,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 725 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:15:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133500 states. [2025-01-09 00:15:12,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133500 to 127537. [2025-01-09 00:15:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127537 states, 127536 states have (on average 1.084258562288295) internal successors, (138282), 127536 states have internal predecessors, (138282), 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-09 00:15:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127537 states to 127537 states and 138282 transitions. [2025-01-09 00:15:12,288 INFO L78 Accepts]: Start accepts. Automaton has 127537 states and 138282 transitions. Word has length 611 [2025-01-09 00:15:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:12,289 INFO L471 AbstractCegarLoop]: Abstraction has 127537 states and 138282 transitions. [2025-01-09 00:15:12,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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-09 00:15:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 127537 states and 138282 transitions. [2025-01-09 00:15:12,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-01-09 00:15:12,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:12,310 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:15:12,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:15:12,311 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:12,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1434858335, now seen corresponding path program 1 times [2025-01-09 00:15:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:12,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678379933] [2025-01-09 00:15:12,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:12,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:12,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-01-09 00:15:12,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-01-09 00:15:12,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:12,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2025-01-09 00:15:12,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:12,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678379933] [2025-01-09 00:15:12,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678379933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:12,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:12,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:12,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175682021] [2025-01-09 00:15:12,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:12,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:12,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:12,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:12,874 INFO L87 Difference]: Start difference. First operand 127537 states and 138282 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 2 states have internal predecessors, (341), 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-09 00:15:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:13,840 INFO L93 Difference]: Finished difference Result 227310 states and 246112 transitions. [2025-01-09 00:15:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:13,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 2 states have internal predecessors, (341), 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 631 [2025-01-09 00:15:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:13,949 INFO L225 Difference]: With dead ends: 227310 [2025-01-09 00:15:13,949 INFO L226 Difference]: Without dead ends: 100199 [2025-01-09 00:15:14,020 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-09 00:15:14,020 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 569 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:14,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 76 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:15:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100199 states. [2025-01-09 00:15:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100199 to 95094. [2025-01-09 00:15:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95094 states, 95093 states have (on average 1.0813940037647356) internal successors, (102833), 95093 states have internal predecessors, (102833), 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-09 00:15:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95094 states to 95094 states and 102833 transitions. [2025-01-09 00:15:15,139 INFO L78 Accepts]: Start accepts. Automaton has 95094 states and 102833 transitions. Word has length 631 [2025-01-09 00:15:15,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:15,139 INFO L471 AbstractCegarLoop]: Abstraction has 95094 states and 102833 transitions. [2025-01-09 00:15:15,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 2 states have internal predecessors, (341), 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-09 00:15:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 95094 states and 102833 transitions. [2025-01-09 00:15:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2025-01-09 00:15:15,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:15,157 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:15:15,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:15:15,157 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:15,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 752698470, now seen corresponding path program 1 times [2025-01-09 00:15:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163479639] [2025-01-09 00:15:15,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:15,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-01-09 00:15:15,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-01-09 00:15:15,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:15,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 598 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-01-09 00:15:15,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:15,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163479639] [2025-01-09 00:15:15,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163479639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:15,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581021403] [2025-01-09 00:15:15,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:15,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:15,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:15,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:15,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:15,644 INFO L87 Difference]: Start difference. First operand 95094 states and 102833 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-09 00:15:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:17,152 INFO L93 Difference]: Finished difference Result 199109 states and 214997 transitions. [2025-01-09 00:15:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:17,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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 682 [2025-01-09 00:15:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:17,495 INFO L225 Difference]: With dead ends: 199109 [2025-01-09 00:15:17,495 INFO L226 Difference]: Without dead ends: 104442 [2025-01-09 00:15:17,540 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-09 00:15:17,540 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 266 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:17,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 239 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:15:17,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104442 states. [2025-01-09 00:15:18,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104442 to 93813. [2025-01-09 00:15:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93813 states, 93812 states have (on average 1.0743081908497847) internal successors, (100783), 93812 states have internal predecessors, (100783), 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-09 00:15:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93813 states to 93813 states and 100783 transitions. [2025-01-09 00:15:18,529 INFO L78 Accepts]: Start accepts. Automaton has 93813 states and 100783 transitions. Word has length 682 [2025-01-09 00:15:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:18,529 INFO L471 AbstractCegarLoop]: Abstraction has 93813 states and 100783 transitions. [2025-01-09 00:15:18,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-09 00:15:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 93813 states and 100783 transitions. [2025-01-09 00:15:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2025-01-09 00:15:18,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:18,549 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 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-09 00:15:18,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:15:18,549 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:18,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash -503581432, now seen corresponding path program 1 times [2025-01-09 00:15:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:18,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541382470] [2025-01-09 00:15:18,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:18,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:18,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 719 statements into 1 equivalence classes. [2025-01-09 00:15:18,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 719 of 719 statements. [2025-01-09 00:15:18,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:18,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2025-01-09 00:15:18,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:18,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541382470] [2025-01-09 00:15:18,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541382470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:18,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:18,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:18,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558301948] [2025-01-09 00:15:18,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:18,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:18,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:18,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:18,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:18,768 INFO L87 Difference]: Start difference. First operand 93813 states and 100783 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-09 00:15:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:20,181 INFO L93 Difference]: Finished difference Result 194853 states and 209395 transitions. [2025-01-09 00:15:20,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:20,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 719 [2025-01-09 00:15:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:20,285 INFO L225 Difference]: With dead ends: 194853 [2025-01-09 00:15:20,285 INFO L226 Difference]: Without dead ends: 101467 [2025-01-09 00:15:20,338 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-09 00:15:20,338 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 467 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:20,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 190 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:15:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101467 states. [2025-01-09 00:15:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101467 to 94196. [2025-01-09 00:15:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94196 states, 94195 states have (on average 1.0728594936036944) internal successors, (101058), 94195 states have internal predecessors, (101058), 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-09 00:15:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94196 states to 94196 states and 101058 transitions. [2025-01-09 00:15:21,866 INFO L78 Accepts]: Start accepts. Automaton has 94196 states and 101058 transitions. Word has length 719 [2025-01-09 00:15:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:21,866 INFO L471 AbstractCegarLoop]: Abstraction has 94196 states and 101058 transitions. [2025-01-09 00:15:21,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-09 00:15:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 94196 states and 101058 transitions. [2025-01-09 00:15:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2025-01-09 00:15:21,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:21,888 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:15:21,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:15:21,889 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:21,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash 750160966, now seen corresponding path program 1 times [2025-01-09 00:15:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723618932] [2025-01-09 00:15:21,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:21,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 749 statements into 1 equivalence classes. [2025-01-09 00:15:21,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 749 of 749 statements. [2025-01-09 00:15:21,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:21,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 658 proven. 0 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-01-09 00:15:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:22,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723618932] [2025-01-09 00:15:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723618932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:22,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:22,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:15:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932488391] [2025-01-09 00:15:22,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:22,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:22,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:22,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:22,544 INFO L87 Difference]: Start difference. First operand 94196 states and 101058 transitions. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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-09 00:15:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:24,172 INFO L93 Difference]: Finished difference Result 189665 states and 203485 transitions. [2025-01-09 00:15:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:24,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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 749 [2025-01-09 00:15:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:24,262 INFO L225 Difference]: With dead ends: 189665 [2025-01-09 00:15:24,262 INFO L226 Difference]: Without dead ends: 95896 [2025-01-09 00:15:24,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:24,314 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 676 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:24,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 713 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:15:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95896 states. [2025-01-09 00:15:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95896 to 95889. [2025-01-09 00:15:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95889 states, 95888 states have (on average 1.0714896545970298) internal successors, (102743), 95888 states have internal predecessors, (102743), 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-09 00:15:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95889 states to 95889 states and 102743 transitions. [2025-01-09 00:15:25,413 INFO L78 Accepts]: Start accepts. Automaton has 95889 states and 102743 transitions. Word has length 749 [2025-01-09 00:15:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:25,413 INFO L471 AbstractCegarLoop]: Abstraction has 95889 states and 102743 transitions. [2025-01-09 00:15:25,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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-09 00:15:25,413 INFO L276 IsEmpty]: Start isEmpty. Operand 95889 states and 102743 transitions. [2025-01-09 00:15:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 845 [2025-01-09 00:15:25,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:25,444 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:15:25,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:15:25,444 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:25,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1036145570, now seen corresponding path program 1 times [2025-01-09 00:15:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:25,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854820187] [2025-01-09 00:15:25,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:25,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 844 statements into 1 equivalence classes. [2025-01-09 00:15:25,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 844 of 844 statements. [2025-01-09 00:15:25,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:25,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1756 backedges. 1197 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-01-09 00:15:26,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854820187] [2025-01-09 00:15:26,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854820187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:26,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:26,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:15:26,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790874304] [2025-01-09 00:15:26,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:26,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:15:26,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:26,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:15:26,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:26,224 INFO L87 Difference]: Start difference. First operand 95889 states and 102743 transitions. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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-09 00:15:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:28,504 INFO L93 Difference]: Finished difference Result 199867 states and 214041 transitions. [2025-01-09 00:15:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:15:28,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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 844 [2025-01-09 00:15:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:28,618 INFO L225 Difference]: With dead ends: 199867 [2025-01-09 00:15:28,618 INFO L226 Difference]: Without dead ends: 104830 [2025-01-09 00:15:28,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:15:28,648 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 760 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:28,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 293 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:15:28,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104830 states. [2025-01-09 00:15:29,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104830 to 94624. [2025-01-09 00:15:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94624 states, 94623 states have (on average 1.069549686651237) internal successors, (101204), 94623 states have internal predecessors, (101204), 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-09 00:15:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94624 states to 94624 states and 101204 transitions. [2025-01-09 00:15:29,651 INFO L78 Accepts]: Start accepts. Automaton has 94624 states and 101204 transitions. Word has length 844 [2025-01-09 00:15:29,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:29,651 INFO L471 AbstractCegarLoop]: Abstraction has 94624 states and 101204 transitions. [2025-01-09 00:15:29,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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-09 00:15:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 94624 states and 101204 transitions. [2025-01-09 00:15:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 863 [2025-01-09 00:15:29,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:29,680 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:15:29,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:15:29,681 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:29,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1315698465, now seen corresponding path program 1 times [2025-01-09 00:15:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630445920] [2025-01-09 00:15:29,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:29,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 862 statements into 1 equivalence classes. [2025-01-09 00:15:29,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 862 of 862 statements. [2025-01-09 00:15:29,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:29,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-01-09 00:15:29,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:29,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630445920] [2025-01-09 00:15:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630445920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:29,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:29,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:29,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648732589] [2025-01-09 00:15:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:29,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:29,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:29,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:29,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:29,973 INFO L87 Difference]: Start difference. First operand 94624 states and 101204 transitions. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-09 00:15:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:31,374 INFO L93 Difference]: Finished difference Result 193922 states and 207197 transitions. [2025-01-09 00:15:31,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:31,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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 862 [2025-01-09 00:15:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:31,468 INFO L225 Difference]: With dead ends: 193922 [2025-01-09 00:15:31,468 INFO L226 Difference]: Without dead ends: 98025 [2025-01-09 00:15:31,520 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-09 00:15:31,521 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 450 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:31,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 696 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:15:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98025 states. [2025-01-09 00:15:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98025 to 95046. [2025-01-09 00:15:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95046 states, 95045 states have (on average 1.063717186595823) internal successors, (101101), 95045 states have internal predecessors, (101101), 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-09 00:15:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95046 states to 95046 states and 101101 transitions. [2025-01-09 00:15:32,481 INFO L78 Accepts]: Start accepts. Automaton has 95046 states and 101101 transitions. Word has length 862 [2025-01-09 00:15:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:32,481 INFO L471 AbstractCegarLoop]: Abstraction has 95046 states and 101101 transitions. [2025-01-09 00:15:32,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-09 00:15:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 95046 states and 101101 transitions. [2025-01-09 00:15:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 986 [2025-01-09 00:15:32,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:32,514 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:15:32,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:15:32,514 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:32,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1383135301, now seen corresponding path program 1 times [2025-01-09 00:15:32,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:32,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374279831] [2025-01-09 00:15:32,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:32,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 985 statements into 1 equivalence classes. [2025-01-09 00:15:32,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 985 of 985 statements. [2025-01-09 00:15:32,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:32,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat