./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label09.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_label09.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 7e1c4d2c7e091760d0cfd2192761696664946c8a36300f0a25d92c3977c93680 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:10:21,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:10:21,119 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:10:21,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:10:21,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:10:21,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:10:21,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:10:21,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:10:21,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:10:21,139 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:10:21,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:10:21,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:10:21,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:10:21,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:10:21,140 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:10:21,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:10:21,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:10:21,140 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:10:21,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:10:21,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:10:21,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:10:21,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:10:21,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:10:21,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:10:21,141 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:10:21,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:10:21,141 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:10:21,141 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:10:21,141 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:10:21,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:10:21,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:10:21,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:10:21,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:10:21,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:10:21,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:10:21,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:10:21,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:10:21,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:10:21,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:10:21,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:10:21,143 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:10:21,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:10:21,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:10:21,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:10:21,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:10:21,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:10:21,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:10:21,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:10:21,143 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 -> 7e1c4d2c7e091760d0cfd2192761696664946c8a36300f0a25d92c3977c93680 [2025-01-09 00:10:21,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:10:21,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:10:21,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:10:21,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:10:21,365 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:10:21,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label09.c [2025-01-09 00:10:22,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/625caccf1/e2781ccb113e4541b740851cac962268/FLAGad7d4feab [2025-01-09 00:10:22,999 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:10:23,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label09.c [2025-01-09 00:10:23,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/625caccf1/e2781ccb113e4541b740851cac962268/FLAGad7d4feab [2025-01-09 00:10:23,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/625caccf1/e2781ccb113e4541b740851cac962268 [2025-01-09 00:10:23,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:10:23,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:10:23,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:10:23,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:10:23,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:10:23,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:10:23" (1/1) ... [2025-01-09 00:10:23,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c4f609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:23, skipping insertion in model container [2025-01-09 00:10:23,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:10:23" (1/1) ... [2025-01-09 00:10:23,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:10:23,548 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_label09.c[1938,1951] [2025-01-09 00:10:24,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:10:24,251 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:10:24,260 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_label09.c[1938,1951] [2025-01-09 00:10:24,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:10:24,503 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:10:24,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24 WrapperNode [2025-01-09 00:10:24,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:10:24,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:10:24,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:10:24,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:10:24,513 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:10:24" (1/1) ... [2025-01-09 00:10:24,559 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:10:24" (1/1) ... [2025-01-09 00:10:24,750 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:10:24,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:10:24,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:10:24,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:10:24,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:10:24,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24" (1/1) ... [2025-01-09 00:10:24,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24" (1/1) ... [2025-01-09 00:10:24,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24" (1/1) ... [2025-01-09 00:10:25,007 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:10:25,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24" (1/1) ... [2025-01-09 00:10:25,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24" (1/1) ... [2025-01-09 00:10:25,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24" (1/1) ... [2025-01-09 00:10:25,148 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24" (1/1) ... [2025-01-09 00:10:25,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24" (1/1) ... [2025-01-09 00:10:25,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24" (1/1) ... [2025-01-09 00:10:25,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24" (1/1) ... [2025-01-09 00:10:25,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:10:25,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:10:25,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:10:25,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:10:25,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24" (1/1) ... [2025-01-09 00:10:25,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:10:25,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:10:25,379 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:10:25,390 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:10:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:10:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:10:25,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:10:25,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:10:25,523 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:10:25,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:10:29,113 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:10:29,113 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:10:29,157 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:10:29,158 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:10:29,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:10:29 BoogieIcfgContainer [2025-01-09 00:10:29,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:10:29,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:10:29,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:10:29,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:10:29,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:10:23" (1/3) ... [2025-01-09 00:10:29,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150fe573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:10:29, skipping insertion in model container [2025-01-09 00:10:29,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:10:24" (2/3) ... [2025-01-09 00:10:29,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150fe573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:10:29, skipping insertion in model container [2025-01-09 00:10:29,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:10:29" (3/3) ... [2025-01-09 00:10:29,175 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label09.c [2025-01-09 00:10:29,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:10:29,198 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label09.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:10:29,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:10:29,261 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;@74134ed8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:10:29,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:10:29,265 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:10:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 00:10:29,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:29,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:29,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:29,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash 446251106, now seen corresponding path program 1 times [2025-01-09 00:10:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:29,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744254373] [2025-01-09 00:10:29,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:29,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:29,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 00:10:29,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 00:10:29,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:29,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:29,415 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:10:29,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:29,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744254373] [2025-01-09 00:10:29,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744254373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:29,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:29,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:10:29,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190605472] [2025-01-09 00:10:29,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:29,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:29,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:29,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:29,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:29,458 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:31,515 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-01-09 00:10:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:31,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 00:10:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:31,563 INFO L225 Difference]: With dead ends: 1642 [2025-01-09 00:10:31,564 INFO L226 Difference]: Without dead ends: 975 [2025-01-09 00:10:31,568 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:10:31,570 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 478 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 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, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:31,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 550 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:10:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-01-09 00:10:31,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-01-09 00:10:31,639 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:10:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-01-09 00:10:31,645 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 12 [2025-01-09 00:10:31,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:31,645 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-01-09 00:10:31,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-01-09 00:10:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 00:10:31,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:31,647 INFO L218 NwaCegarLoop]: trace histogram [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:10:31,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:10:31,647 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:31,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash -319072658, now seen corresponding path program 1 times [2025-01-09 00:10:31,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:31,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647276721] [2025-01-09 00:10:31,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:31,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:31,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 00:10:31,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 00:10:31,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:31,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:10:31,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:31,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647276721] [2025-01-09 00:10:31,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647276721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:31,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:31,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:31,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249145828] [2025-01-09 00:10:31,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:31,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:31,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:31,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:31,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:31,979 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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:10:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:33,965 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2025-01-09 00:10:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:33,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-01-09 00:10:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:33,971 INFO L225 Difference]: With dead ends: 2814 [2025-01-09 00:10:33,971 INFO L226 Difference]: Without dead ends: 1844 [2025-01-09 00:10:33,972 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:10:33,973 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 479 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 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.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:33,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 920 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:10:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-01-09 00:10:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2025-01-09 00:10:33,994 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:10:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2025-01-09 00:10:33,998 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 82 [2025-01-09 00:10:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:33,999 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2025-01-09 00:10:33,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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:10:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2025-01-09 00:10:34,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 00:10:34,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:34,005 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:10:34,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:10:34,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:34,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2064738063, now seen corresponding path program 1 times [2025-01-09 00:10:34,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:34,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937737191] [2025-01-09 00:10:34,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:34,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:34,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 00:10:34,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 00:10:34,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:34,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:10:34,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937737191] [2025-01-09 00:10:34,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937737191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:34,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:34,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:10:34,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389776812] [2025-01-09 00:10:34,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:34,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:34,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:34,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:34,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:34,186 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 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:10:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:36,835 INFO L93 Difference]: Finished difference Result 5445 states and 7408 transitions. [2025-01-09 00:10:36,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:36,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 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:10:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:36,860 INFO L225 Difference]: With dead ends: 5445 [2025-01-09 00:10:36,863 INFO L226 Difference]: Without dead ends: 3605 [2025-01-09 00:10:36,866 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:10:36,870 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 440 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:36,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 272 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:10:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3605 states. [2025-01-09 00:10:36,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3605 to 3583. [2025-01-09 00:10:36,968 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:10:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4785 transitions. [2025-01-09 00:10:36,978 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4785 transitions. Word has length 104 [2025-01-09 00:10:36,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:36,978 INFO L471 AbstractCegarLoop]: Abstraction has 3583 states and 4785 transitions. [2025-01-09 00:10:36,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 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:10:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4785 transitions. [2025-01-09 00:10:36,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 00:10:36,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:36,990 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:10:36,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:10:36,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:36,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:36,993 INFO L85 PathProgramCache]: Analyzing trace with hash 849175151, now seen corresponding path program 1 times [2025-01-09 00:10:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:36,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337940667] [2025-01-09 00:10:36,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:36,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:37,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 00:10:37,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 00:10:37,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:37,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:10:37,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:37,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337940667] [2025-01-09 00:10:37,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337940667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:37,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:37,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:10:37,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381053483] [2025-01-09 00:10:37,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:37,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:37,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:37,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:37,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:37,468 INFO L87 Difference]: Start difference. First operand 3583 states and 4785 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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:10:39,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:39,327 INFO L93 Difference]: Finished difference Result 8893 states and 11846 transitions. [2025-01-09 00:10:39,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:39,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2025-01-09 00:10:39,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:39,342 INFO L225 Difference]: With dead ends: 8893 [2025-01-09 00:10:39,343 INFO L226 Difference]: Without dead ends: 5312 [2025-01-09 00:10:39,348 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:10:39,348 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 352 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:39,348 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.8s Time] [2025-01-09 00:10:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2025-01-09 00:10:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 5292. [2025-01-09 00:10:39,451 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:10:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 6771 transitions. [2025-01-09 00:10:39,460 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 6771 transitions. Word has length 117 [2025-01-09 00:10:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:39,460 INFO L471 AbstractCegarLoop]: Abstraction has 5292 states and 6771 transitions. [2025-01-09 00:10:39,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 0 states have call successors, (0), 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:10:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 6771 transitions. [2025-01-09 00:10:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 00:10:39,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:39,462 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:10:39,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:10:39,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:39,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:39,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1002189728, now seen corresponding path program 1 times [2025-01-09 00:10:39,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:39,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133668300] [2025-01-09 00:10:39,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:39,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:39,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 00:10:39,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 00:10:39,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:39,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:10:39,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:39,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133668300] [2025-01-09 00:10:39,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133668300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:39,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:39,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:10:39,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873494977] [2025-01-09 00:10:39,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:39,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:39,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:39,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:39,663 INFO L87 Difference]: Start difference. First operand 5292 states and 6771 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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:10:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:41,300 INFO L93 Difference]: Finished difference Result 12705 states and 16558 transitions. [2025-01-09 00:10:41,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:41,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-01-09 00:10:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:41,326 INFO L225 Difference]: With dead ends: 12705 [2025-01-09 00:10:41,330 INFO L226 Difference]: Without dead ends: 5711 [2025-01-09 00:10:41,339 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:10:41,340 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:41,344 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.6s Time] [2025-01-09 00:10:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2025-01-09 00:10:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 4427. [2025-01-09 00:10:41,449 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:10:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 5351 transitions. [2025-01-09 00:10:41,467 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 5351 transitions. Word has length 123 [2025-01-09 00:10:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:41,467 INFO L471 AbstractCegarLoop]: Abstraction has 4427 states and 5351 transitions. [2025-01-09 00:10:41,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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:10:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 5351 transitions. [2025-01-09 00:10:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 00:10:41,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:41,468 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:41,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:10:41,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash 79223941, now seen corresponding path program 1 times [2025-01-09 00:10:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231884248] [2025-01-09 00:10:41,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:41,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 00:10:41,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 00:10:41,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:41,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:10:41,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:41,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231884248] [2025-01-09 00:10:41,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231884248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:41,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:41,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381563699] [2025-01-09 00:10:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:41,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:41,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:41,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:41,621 INFO L87 Difference]: Start difference. First operand 4427 states and 5351 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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:10:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:43,078 INFO L93 Difference]: Finished difference Result 11399 states and 13997 transitions. [2025-01-09 00:10:43,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:43,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-01-09 00:10:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:43,095 INFO L225 Difference]: With dead ends: 11399 [2025-01-09 00:10:43,095 INFO L226 Difference]: Without dead ends: 6974 [2025-01-09 00:10:43,099 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:10:43,101 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:43,101 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.4s Time] [2025-01-09 00:10:43,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2025-01-09 00:10:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6974. [2025-01-09 00:10:43,181 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:10:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8252 transitions. [2025-01-09 00:10:43,194 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8252 transitions. Word has length 164 [2025-01-09 00:10:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:43,195 INFO L471 AbstractCegarLoop]: Abstraction has 6974 states and 8252 transitions. [2025-01-09 00:10:43,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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:10:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8252 transitions. [2025-01-09 00:10:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 00:10:43,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:43,196 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:43,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:10:43,196 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:43,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:43,197 INFO L85 PathProgramCache]: Analyzing trace with hash 161467872, now seen corresponding path program 1 times [2025-01-09 00:10:43,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:43,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767098499] [2025-01-09 00:10:43,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:43,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:43,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 00:10:43,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 00:10:43,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:43,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:10:43,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:43,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767098499] [2025-01-09 00:10:43,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767098499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:43,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:43,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:43,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507299962] [2025-01-09 00:10:43,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:43,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:43,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:43,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:43,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:43,378 INFO L87 Difference]: Start difference. First operand 6974 states and 8252 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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:10:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:44,989 INFO L93 Difference]: Finished difference Result 16914 states and 20159 transitions. [2025-01-09 00:10:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:44,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 166 [2025-01-09 00:10:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:45,009 INFO L225 Difference]: With dead ends: 16914 [2025-01-09 00:10:45,010 INFO L226 Difference]: Without dead ends: 9941 [2025-01-09 00:10:45,017 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:10:45,018 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 439 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 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.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:45,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:10:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9941 states. [2025-01-09 00:10:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9941 to 7373. [2025-01-09 00:10:45,137 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:10:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 8696 transitions. [2025-01-09 00:10:45,145 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 8696 transitions. Word has length 166 [2025-01-09 00:10:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:45,145 INFO L471 AbstractCegarLoop]: Abstraction has 7373 states and 8696 transitions. [2025-01-09 00:10:45,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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:10:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 8696 transitions. [2025-01-09 00:10:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-09 00:10:45,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:45,148 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:45,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:10:45,148 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:45,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash -600175354, now seen corresponding path program 1 times [2025-01-09 00:10:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:45,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902972780] [2025-01-09 00:10:45,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:45,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:45,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 00:10:45,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 00:10:45,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:45,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:10:45,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:45,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902972780] [2025-01-09 00:10:45,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902972780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:45,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:45,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:45,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906679588] [2025-01-09 00:10:45,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:45,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:45,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:45,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:45,298 INFO L87 Difference]: Start difference. First operand 7373 states and 8696 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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:10:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:46,750 INFO L93 Difference]: Finished difference Result 16027 states and 18850 transitions. [2025-01-09 00:10:46,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:46,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 232 [2025-01-09 00:10:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:46,763 INFO L225 Difference]: With dead ends: 16027 [2025-01-09 00:10:46,764 INFO L226 Difference]: Without dead ends: 8656 [2025-01-09 00:10:46,769 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:10:46,770 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 424 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:46,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 894 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:10:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2025-01-09 00:10:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 8225. [2025-01-09 00:10:46,837 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:10:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8225 states to 8225 states and 9641 transitions. [2025-01-09 00:10:46,848 INFO L78 Accepts]: Start accepts. Automaton has 8225 states and 9641 transitions. Word has length 232 [2025-01-09 00:10:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:46,848 INFO L471 AbstractCegarLoop]: Abstraction has 8225 states and 9641 transitions. [2025-01-09 00:10:46,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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:10:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 8225 states and 9641 transitions. [2025-01-09 00:10:46,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-01-09 00:10:46,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:46,855 INFO L218 NwaCegarLoop]: trace histogram [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, 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:10:46,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:10:46,855 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:46,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash -654189213, now seen corresponding path program 1 times [2025-01-09 00:10:46,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:46,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713352223] [2025-01-09 00:10:46,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:46,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-09 00:10:46,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-09 00:10:46,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:46,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:10:47,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:47,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713352223] [2025-01-09 00:10:47,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713352223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:47,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:47,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:47,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604301491] [2025-01-09 00:10:47,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:47,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:47,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:47,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:47,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:47,226 INFO L87 Difference]: Start difference. First operand 8225 states and 9641 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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:10:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:48,845 INFO L93 Difference]: Finished difference Result 20309 states and 24031 transitions. [2025-01-09 00:10:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 244 [2025-01-09 00:10:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:48,880 INFO L225 Difference]: With dead ends: 20309 [2025-01-09 00:10:48,886 INFO L226 Difference]: Without dead ends: 11658 [2025-01-09 00:10:48,896 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:10:48,897 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 494 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:48,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 633 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:10:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11658 states. [2025-01-09 00:10:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11658 to 10801. [2025-01-09 00:10:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10801 states, 10800 states have (on average 1.1797222222222221) internal successors, (12741), 10800 states have internal predecessors, (12741), 0 states have call successors, (0), 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:10:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10801 states to 10801 states and 12741 transitions. [2025-01-09 00:10:49,010 INFO L78 Accepts]: Start accepts. Automaton has 10801 states and 12741 transitions. Word has length 244 [2025-01-09 00:10:49,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:49,011 INFO L471 AbstractCegarLoop]: Abstraction has 10801 states and 12741 transitions. [2025-01-09 00:10:49,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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:10:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 10801 states and 12741 transitions. [2025-01-09 00:10:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-09 00:10:49,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:49,013 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:49,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:10:49,014 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:49,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash -108341413, now seen corresponding path program 1 times [2025-01-09 00:10:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:49,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265403515] [2025-01-09 00:10:49,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:49,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:49,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-09 00:10:49,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-09 00:10:49,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:49,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:10:49,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:49,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265403515] [2025-01-09 00:10:49,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265403515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:49,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:49,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:49,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452124400] [2025-01-09 00:10:49,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:49,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:49,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:49,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:49,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:49,196 INFO L87 Difference]: Start difference. First operand 10801 states and 12741 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:50,718 INFO L93 Difference]: Finished difference Result 27125 states and 32440 transitions. [2025-01-09 00:10:50,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:50,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2025-01-09 00:10:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:50,754 INFO L225 Difference]: With dead ends: 27125 [2025-01-09 00:10:50,754 INFO L226 Difference]: Without dead ends: 16326 [2025-01-09 00:10:50,765 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:10:50,766 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 379 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:50,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 840 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:10:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16326 states. [2025-01-09 00:10:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16326 to 15476. [2025-01-09 00:10:50,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15476 states, 15475 states have (on average 1.149919224555735) internal successors, (17795), 15475 states have internal predecessors, (17795), 0 states have call successors, (0), 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:10:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15476 states to 15476 states and 17795 transitions. [2025-01-09 00:10:51,019 INFO L78 Accepts]: Start accepts. Automaton has 15476 states and 17795 transitions. Word has length 249 [2025-01-09 00:10:51,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:51,023 INFO L471 AbstractCegarLoop]: Abstraction has 15476 states and 17795 transitions. [2025-01-09 00:10:51,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 15476 states and 17795 transitions. [2025-01-09 00:10:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-01-09 00:10:51,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:51,041 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:10:51,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:10:51,041 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:51,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:51,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1307806067, now seen corresponding path program 1 times [2025-01-09 00:10:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:51,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579272508] [2025-01-09 00:10:51,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:51,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:51,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 00:10:51,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 00:10:51,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:51,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:10:51,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:51,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579272508] [2025-01-09 00:10:51,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579272508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:51,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:51,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:10:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427869285] [2025-01-09 00:10:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:51,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:51,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:51,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:51,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:10:51,362 INFO L87 Difference]: Start difference. First operand 15476 states and 17795 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:10:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:52,852 INFO L93 Difference]: Finished difference Result 36068 states and 41683 transitions. [2025-01-09 00:10:52,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:52,853 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 267 [2025-01-09 00:10:52,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:52,896 INFO L225 Difference]: With dead ends: 36068 [2025-01-09 00:10:52,897 INFO L226 Difference]: Without dead ends: 20162 [2025-01-09 00:10:52,920 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:10:52,922 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 430 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:52,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 349 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:10:52,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20162 states. [2025-01-09 00:10:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20162 to 19305. [2025-01-09 00:10:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19305 states, 19304 states have (on average 1.1543721508495648) internal successors, (22284), 19304 states have internal predecessors, (22284), 0 states have call successors, (0), 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:10:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19305 states to 19305 states and 22284 transitions. [2025-01-09 00:10:53,290 INFO L78 Accepts]: Start accepts. Automaton has 19305 states and 22284 transitions. Word has length 267 [2025-01-09 00:10:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:53,291 INFO L471 AbstractCegarLoop]: Abstraction has 19305 states and 22284 transitions. [2025-01-09 00:10:53,291 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:10:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 19305 states and 22284 transitions. [2025-01-09 00:10:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 00:10:53,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:53,294 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:10:53,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:10:53,294 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:53,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:53,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1877854901, now seen corresponding path program 1 times [2025-01-09 00:10:53,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:53,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579758119] [2025-01-09 00:10:53,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:53,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:53,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 00:10:53,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 00:10:53,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:53,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:10:53,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:53,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579758119] [2025-01-09 00:10:53,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579758119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:53,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:53,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:10:53,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877559401] [2025-01-09 00:10:53,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:53,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:10:53,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:53,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:10:53,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:10:53,578 INFO L87 Difference]: Start difference. First operand 19305 states and 22284 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 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:10:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:56,261 INFO L93 Difference]: Finished difference Result 61248 states and 70663 transitions. [2025-01-09 00:10:56,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:10:56,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 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 272 [2025-01-09 00:10:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:56,321 INFO L225 Difference]: With dead ends: 61248 [2025-01-09 00:10:56,325 INFO L226 Difference]: Without dead ends: 40664 [2025-01-09 00:10:56,351 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:10:56,352 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 909 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2781 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 2781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:56,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 326 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 2781 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 00:10:56,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40664 states. [2025-01-09 00:10:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40664 to 40185. [2025-01-09 00:10:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40185 states, 40184 states have (on average 1.1385377264582919) internal successors, (45751), 40184 states have internal predecessors, (45751), 0 states have call successors, (0), 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:10:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40185 states to 40185 states and 45751 transitions. [2025-01-09 00:10:56,840 INFO L78 Accepts]: Start accepts. Automaton has 40185 states and 45751 transitions. Word has length 272 [2025-01-09 00:10:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:56,840 INFO L471 AbstractCegarLoop]: Abstraction has 40185 states and 45751 transitions. [2025-01-09 00:10:56,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 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:10:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 40185 states and 45751 transitions. [2025-01-09 00:10:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-09 00:10:56,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:56,844 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:56,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:10:56,844 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:56,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:56,845 INFO L85 PathProgramCache]: Analyzing trace with hash 945554854, now seen corresponding path program 1 times [2025-01-09 00:10:56,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:56,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585897942] [2025-01-09 00:10:56,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:56,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:56,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 00:10:56,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 00:10:56,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:56,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:10:57,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:57,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585897942] [2025-01-09 00:10:57,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585897942] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:10:57,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250955893] [2025-01-09 00:10:57,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:57,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:10:57,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:10:57,282 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:10:57,284 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:10:57,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 00:10:57,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 00:10:57,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:57,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:57,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:10:57,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:10:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 19 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:10:57,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:10:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:10:58,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250955893] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:10:58,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:10:58,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:10:58,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301986113] [2025-01-09 00:10:58,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:58,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:10:58,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:58,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:10:58,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:10:58,142 INFO L87 Difference]: Start difference. First operand 40185 states and 45751 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:11:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:00,552 INFO L93 Difference]: Finished difference Result 100382 states and 114289 transitions. [2025-01-09 00:11:00,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:11:00,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 301 [2025-01-09 00:11:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:00,613 INFO L225 Difference]: With dead ends: 100382 [2025-01-09 00:11:00,613 INFO L226 Difference]: Without dead ends: 59334 [2025-01-09 00:11:00,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:11:00,641 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 871 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:00,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 149 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:11:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59334 states. [2025-01-09 00:11:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59334 to 57622. [2025-01-09 00:11:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57622 states, 57621 states have (on average 1.1240867045000955) internal successors, (64771), 57621 states have internal predecessors, (64771), 0 states have call successors, (0), 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:11:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57622 states to 57622 states and 64771 transitions. [2025-01-09 00:11:01,738 INFO L78 Accepts]: Start accepts. Automaton has 57622 states and 64771 transitions. Word has length 301 [2025-01-09 00:11:01,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:01,739 INFO L471 AbstractCegarLoop]: Abstraction has 57622 states and 64771 transitions. [2025-01-09 00:11:01,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:11:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 57622 states and 64771 transitions. [2025-01-09 00:11:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 00:11:01,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:01,742 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-09 00:11:01,750 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:11:01,942 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,SelfDestructingSolverStorable12 [2025-01-09 00:11:01,943 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:01,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:01,943 INFO L85 PathProgramCache]: Analyzing trace with hash -189751160, now seen corresponding path program 1 times [2025-01-09 00:11:01,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:01,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021830876] [2025-01-09 00:11:01,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:01,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:01,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 00:11:01,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 00:11:01,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:01,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 193 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:11:02,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:02,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021830876] [2025-01-09 00:11:02,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021830876] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:11:02,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350336792] [2025-01-09 00:11:02,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:02,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:11:02,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:11:02,412 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:11:02,415 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:11:02,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 00:11:02,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 00:11:02,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:02,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:02,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:11:02,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:11:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 206 proven. 82 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 00:11:02,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:11:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 206 proven. 82 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 00:11:03,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350336792] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:11:03,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:11:03,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-01-09 00:11:03,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201159925] [2025-01-09 00:11:03,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:11:03,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:11:03,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:03,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:11:03,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:11:03,819 INFO L87 Difference]: Start difference. First operand 57622 states and 64771 transitions. Second operand has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 0 states have call successors, (0), 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:11:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:13,785 INFO L93 Difference]: Finished difference Result 209888 states and 234493 transitions. [2025-01-09 00:11:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 00:11:13,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 0 states have call successors, (0), 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 307 [2025-01-09 00:11:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:13,968 INFO L225 Difference]: With dead ends: 209888 [2025-01-09 00:11:13,969 INFO L226 Difference]: Without dead ends: 148437 [2025-01-09 00:11:14,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2025-01-09 00:11:14,037 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 11504 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 11797 mSolverCounterSat, 2395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11504 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 14192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2395 IncrementalHoareTripleChecker+Valid, 11797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:14,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11504 Valid, 502 Invalid, 14192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2395 Valid, 11797 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2025-01-09 00:11:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148437 states. [2025-01-09 00:11:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148437 to 113872. [2025-01-09 00:11:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113872 states, 113871 states have (on average 1.117659456753695) internal successors, (127269), 113871 states have internal predecessors, (127269), 0 states have call successors, (0), 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:11:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113872 states to 113872 states and 127269 transitions. [2025-01-09 00:11:15,896 INFO L78 Accepts]: Start accepts. Automaton has 113872 states and 127269 transitions. Word has length 307 [2025-01-09 00:11:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:15,896 INFO L471 AbstractCegarLoop]: Abstraction has 113872 states and 127269 transitions. [2025-01-09 00:11:15,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.11111111111111) internal successors, (793), 9 states have internal predecessors, (793), 0 states have call successors, (0), 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:11:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 113872 states and 127269 transitions. [2025-01-09 00:11:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-01-09 00:11:15,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:15,907 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:15,916 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:11:16,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:11:16,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:16,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:16,108 INFO L85 PathProgramCache]: Analyzing trace with hash -887915991, now seen corresponding path program 1 times [2025-01-09 00:11:16,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:16,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115687480] [2025-01-09 00:11:16,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:16,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:16,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-09 00:11:16,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-09 00:11:16,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:16,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-01-09 00:11:16,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:16,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115687480] [2025-01-09 00:11:16,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115687480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:16,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:16,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:11:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856752021] [2025-01-09 00:11:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:16,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:16,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:16,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:16,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:16,396 INFO L87 Difference]: Start difference. First operand 113872 states and 127269 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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:11:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:18,178 INFO L93 Difference]: Finished difference Result 238376 states and 266237 transitions. [2025-01-09 00:11:18,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:18,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 359 [2025-01-09 00:11:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:18,340 INFO L225 Difference]: With dead ends: 238376 [2025-01-09 00:11:18,340 INFO L226 Difference]: Without dead ends: 124502 [2025-01-09 00:11:18,381 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:11:18,381 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 491 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:18,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 691 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:11:18,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124502 states. [2025-01-09 00:11:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124502 to 122370. [2025-01-09 00:11:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122370 states, 122369 states have (on average 1.1065956247088724) internal successors, (135413), 122369 states have internal predecessors, (135413), 0 states have call successors, (0), 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:11:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122370 states to 122370 states and 135413 transitions. [2025-01-09 00:11:20,157 INFO L78 Accepts]: Start accepts. Automaton has 122370 states and 135413 transitions. Word has length 359 [2025-01-09 00:11:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:20,158 INFO L471 AbstractCegarLoop]: Abstraction has 122370 states and 135413 transitions. [2025-01-09 00:11:20,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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:11:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 122370 states and 135413 transitions. [2025-01-09 00:11:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 00:11:20,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:20,166 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-01-09 00:11:20,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:11:20,167 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:20,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:20,167 INFO L85 PathProgramCache]: Analyzing trace with hash -363436430, now seen corresponding path program 1 times [2025-01-09 00:11:20,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:20,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43561661] [2025-01-09 00:11:20,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:20,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:20,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 00:11:20,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 00:11:20,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:20,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2025-01-09 00:11:20,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:20,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43561661] [2025-01-09 00:11:20,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43561661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:20,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:20,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:11:20,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277722093] [2025-01-09 00:11:20,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:20,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:20,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:20,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:20,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:20,416 INFO L87 Difference]: Start difference. First operand 122370 states and 135413 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:21,650 INFO L93 Difference]: Finished difference Result 239622 states and 264785 transitions. [2025-01-09 00:11:21,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:21,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 441 [2025-01-09 00:11:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:21,773 INFO L225 Difference]: With dead ends: 239622 [2025-01-09 00:11:21,773 INFO L226 Difference]: Without dead ends: 117678 [2025-01-09 00:11:21,823 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:11:21,824 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 605 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:21,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 101 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:11:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117678 states. [2025-01-09 00:11:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117678 to 117232. [2025-01-09 00:11:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117232 states, 117231 states have (on average 1.1023790635582738) internal successors, (129233), 117231 states have internal predecessors, (129233), 0 states have call successors, (0), 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:11:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117232 states to 117232 states and 129233 transitions. [2025-01-09 00:11:23,112 INFO L78 Accepts]: Start accepts. Automaton has 117232 states and 129233 transitions. Word has length 441 [2025-01-09 00:11:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:23,113 INFO L471 AbstractCegarLoop]: Abstraction has 117232 states and 129233 transitions. [2025-01-09 00:11:23,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:23,113 INFO L276 IsEmpty]: Start isEmpty. Operand 117232 states and 129233 transitions. [2025-01-09 00:11:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-01-09 00:11:23,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:23,122 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-09 00:11:23,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:11:23,122 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:23,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2111023601, now seen corresponding path program 1 times [2025-01-09 00:11:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084362856] [2025-01-09 00:11:23,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:23,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-01-09 00:11:23,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-01-09 00:11:23,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:23,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 00:11:23,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:23,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084362856] [2025-01-09 00:11:23,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084362856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:23,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:23,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:11:23,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742140369] [2025-01-09 00:11:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:23,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:23,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:23,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:23,636 INFO L87 Difference]: Start difference. First operand 117232 states and 129233 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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:11:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:25,308 INFO L93 Difference]: Finished difference Result 219539 states and 241901 transitions. [2025-01-09 00:11:25,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:25,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 455 [2025-01-09 00:11:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:25,414 INFO L225 Difference]: With dead ends: 219539 [2025-01-09 00:11:25,414 INFO L226 Difference]: Without dead ends: 102733 [2025-01-09 00:11:25,472 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:11:25,472 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 481 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:25,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 701 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:11:25,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102733 states. [2025-01-09 00:11:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102733 to 99750. [2025-01-09 00:11:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99750 states, 99749 states have (on average 1.0842715215190126) internal successors, (108155), 99749 states have internal predecessors, (108155), 0 states have call successors, (0), 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:11:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99750 states to 99750 states and 108155 transitions. [2025-01-09 00:11:26,800 INFO L78 Accepts]: Start accepts. Automaton has 99750 states and 108155 transitions. Word has length 455 [2025-01-09 00:11:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:26,800 INFO L471 AbstractCegarLoop]: Abstraction has 99750 states and 108155 transitions. [2025-01-09 00:11:26,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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:11:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 99750 states and 108155 transitions. [2025-01-09 00:11:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-01-09 00:11:26,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:26,807 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:11:26,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:11:26,811 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:26,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:26,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1878196484, now seen corresponding path program 1 times [2025-01-09 00:11:26,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:26,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310870306] [2025-01-09 00:11:26,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:26,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:26,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-09 00:11:26,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-09 00:11:26,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:26,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-01-09 00:11:26,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:26,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310870306] [2025-01-09 00:11:26,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310870306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:26,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:26,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:11:26,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008373872] [2025-01-09 00:11:26,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:26,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:26,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:26,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:26,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:26,962 INFO L87 Difference]: Start difference. First operand 99750 states and 108155 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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:11:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:28,732 INFO L93 Difference]: Finished difference Result 209728 states and 227283 transitions. [2025-01-09 00:11:28,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:28,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 461 [2025-01-09 00:11:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:28,885 INFO L225 Difference]: With dead ends: 209728 [2025-01-09 00:11:28,885 INFO L226 Difference]: Without dead ends: 108699 [2025-01-09 00:11:28,937 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:11:28,938 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 439 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:28,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 778 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:11:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108699 states. [2025-01-09 00:11:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108699 to 104844. [2025-01-09 00:11:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104844 states, 104843 states have (on average 1.079909960607766) internal successors, (113221), 104843 states have internal predecessors, (113221), 0 states have call successors, (0), 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:11:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104844 states to 104844 states and 113221 transitions. [2025-01-09 00:11:30,379 INFO L78 Accepts]: Start accepts. Automaton has 104844 states and 113221 transitions. Word has length 461 [2025-01-09 00:11:30,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:30,379 INFO L471 AbstractCegarLoop]: Abstraction has 104844 states and 113221 transitions. [2025-01-09 00:11:30,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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:11:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 104844 states and 113221 transitions. [2025-01-09 00:11:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 00:11:30,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:30,386 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:30,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:11:30,387 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:30,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash 534461133, now seen corresponding path program 1 times [2025-01-09 00:11:30,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:30,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750635763] [2025-01-09 00:11:30,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:30,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 00:11:30,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 00:11:30,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:30,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 373 proven. 82 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 00:11:31,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750635763] [2025-01-09 00:11:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750635763] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:11:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811447242] [2025-01-09 00:11:31,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:31,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:11:31,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:11:31,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:11:31,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:11:31,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 00:11:31,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 00:11:31,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:31,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:31,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 00:11:31,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:11:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 373 proven. 82 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 00:11:32,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:11:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 454 proven. 1 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 00:11:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811447242] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:11:32,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:11:32,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-01-09 00:11:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867555265] [2025-01-09 00:11:32,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:11:32,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 00:11:32,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:32,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 00:11:32,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:11:32,950 INFO L87 Difference]: Start difference. First operand 104844 states and 113221 transitions. Second operand has 10 states, 10 states have (on average 75.0) internal successors, (750), 9 states have internal predecessors, (750), 0 states have call successors, (0), 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:11:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:38,668 INFO L93 Difference]: Finished difference Result 223142 states and 240919 transitions. [2025-01-09 00:11:38,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 00:11:38,668 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 75.0) internal successors, (750), 9 states have internal predecessors, (750), 0 states have call successors, (0), 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 500 [2025-01-09 00:11:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:38,779 INFO L225 Difference]: With dead ends: 223142 [2025-01-09 00:11:38,779 INFO L226 Difference]: Without dead ends: 118725 [2025-01-09 00:11:38,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 995 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:11:38,806 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 2537 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 7780 mSolverCounterSat, 732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2537 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 8512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 7780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:38,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2537 Valid, 453 Invalid, 8512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 7780 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 00:11:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118725 states. [2025-01-09 00:11:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118725 to 105689. [2025-01-09 00:11:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105689 states, 105688 states have (on average 1.0776530921202028) internal successors, (113895), 105688 states have internal predecessors, (113895), 0 states have call successors, (0), 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:11:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105689 states to 105689 states and 113895 transitions. [2025-01-09 00:11:39,962 INFO L78 Accepts]: Start accepts. Automaton has 105689 states and 113895 transitions. Word has length 500 [2025-01-09 00:11:39,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:39,962 INFO L471 AbstractCegarLoop]: Abstraction has 105689 states and 113895 transitions. [2025-01-09 00:11:39,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 75.0) internal successors, (750), 9 states have internal predecessors, (750), 0 states have call successors, (0), 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:11:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 105689 states and 113895 transitions. [2025-01-09 00:11:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-01-09 00:11:39,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:39,970 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-09 00:11:39,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:11:40,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:11:40,171 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:40,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1990977135, now seen corresponding path program 1 times [2025-01-09 00:11:40,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:40,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814735088] [2025-01-09 00:11:40,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:40,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-01-09 00:11:40,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-01-09 00:11:40,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:40,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 350 proven. 10 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:11:40,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:40,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814735088] [2025-01-09 00:11:40,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814735088] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:11:40,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814735183] [2025-01-09 00:11:40,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:40,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:11:40,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:11:40,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:11:40,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:11:41,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-01-09 00:11:41,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-01-09 00:11:41,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:41,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:41,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:11:41,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:11:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2025-01-09 00:11:41,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:11:41,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814735183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:41,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:11:41,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-01-09 00:11:41,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738458103] [2025-01-09 00:11:41,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:41,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:41,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:41,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:41,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:11:41,174 INFO L87 Difference]: Start difference. First operand 105689 states and 113895 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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:11:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:43,012 INFO L93 Difference]: Finished difference Result 106975 states and 115226 transitions. [2025-01-09 00:11:43,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:43,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 528 [2025-01-09 00:11:43,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:43,111 INFO L225 Difference]: With dead ends: 106975 [2025-01-09 00:11:43,111 INFO L226 Difference]: Without dead ends: 106548 [2025-01-09 00:11:43,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 529 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:11:43,128 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 464 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:43,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 302 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:11:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106548 states. [2025-01-09 00:11:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106548 to 105689. [2025-01-09 00:11:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105689 states, 105688 states have (on average 1.0769813034592386) internal successors, (113824), 105688 states have internal predecessors, (113824), 0 states have call successors, (0), 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:11:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105689 states to 105689 states and 113824 transitions. [2025-01-09 00:11:44,132 INFO L78 Accepts]: Start accepts. Automaton has 105689 states and 113824 transitions. Word has length 528 [2025-01-09 00:11:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:44,132 INFO L471 AbstractCegarLoop]: Abstraction has 105689 states and 113824 transitions. [2025-01-09 00:11:44,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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:11:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 105689 states and 113824 transitions. [2025-01-09 00:11:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-01-09 00:11:44,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:44,141 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:44,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 00:11:44,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:11:44,342 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:44,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:44,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1175081987, now seen corresponding path program 1 times [2025-01-09 00:11:44,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:44,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838590242] [2025-01-09 00:11:44,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:44,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:44,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-01-09 00:11:44,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-01-09 00:11:44,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:44,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-01-09 00:11:44,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:44,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838590242] [2025-01-09 00:11:44,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838590242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:44,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:44,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:11:44,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966460128] [2025-01-09 00:11:44,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:44,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:44,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:44,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:44,820 INFO L87 Difference]: Start difference. First operand 105689 states and 113824 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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:11:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:46,439 INFO L93 Difference]: Finished difference Result 218184 states and 234942 transitions. [2025-01-09 00:11:46,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:46,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 560 [2025-01-09 00:11:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:46,806 INFO L225 Difference]: With dead ends: 218184 [2025-01-09 00:11:46,806 INFO L226 Difference]: Without dead ends: 112922 [2025-01-09 00:11:46,842 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:11:46,844 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 389 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:46,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 341 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:11:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112922 states. [2025-01-09 00:11:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112922 to 111637. [2025-01-09 00:11:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111637 states, 111636 states have (on average 1.074635422265219) internal successors, (119968), 111636 states have internal predecessors, (119968), 0 states have call successors, (0), 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:11:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111637 states to 111637 states and 119968 transitions. [2025-01-09 00:11:48,297 INFO L78 Accepts]: Start accepts. Automaton has 111637 states and 119968 transitions. Word has length 560 [2025-01-09 00:11:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:48,298 INFO L471 AbstractCegarLoop]: Abstraction has 111637 states and 119968 transitions. [2025-01-09 00:11:48,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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:11:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 111637 states and 119968 transitions. [2025-01-09 00:11:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 00:11:48,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:48,308 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-01-09 00:11:48,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:11:48,308 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:48,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash 677299019, now seen corresponding path program 1 times [2025-01-09 00:11:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:48,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653188791] [2025-01-09 00:11:48,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:48,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 00:11:48,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 00:11:48,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:48,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 907 trivial. 0 not checked. [2025-01-09 00:11:48,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653188791] [2025-01-09 00:11:48,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653188791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:48,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:48,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:11:48,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823678153] [2025-01-09 00:11:48,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:48,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:48,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:48,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:48,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:48,519 INFO L87 Difference]: Start difference. First operand 111637 states and 119968 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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:11:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:50,416 INFO L93 Difference]: Finished difference Result 231799 states and 249348 transitions. [2025-01-09 00:11:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:50,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 576 [2025-01-09 00:11:50,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:50,568 INFO L225 Difference]: With dead ends: 231799 [2025-01-09 00:11:50,568 INFO L226 Difference]: Without dead ends: 120159 [2025-01-09 00:11:50,632 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:11:50,633 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 487 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:50,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 219 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:11:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120159 states. [2025-01-09 00:11:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120159 to 113340. [2025-01-09 00:11:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113340 states, 113339 states have (on average 1.0734080943011672) internal successors, (121659), 113339 states have internal predecessors, (121659), 0 states have call successors, (0), 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:11:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113340 states to 113340 states and 121659 transitions. [2025-01-09 00:11:52,198 INFO L78 Accepts]: Start accepts. Automaton has 113340 states and 121659 transitions. Word has length 576 [2025-01-09 00:11:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:52,199 INFO L471 AbstractCegarLoop]: Abstraction has 113340 states and 121659 transitions. [2025-01-09 00:11:52,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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:11:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 113340 states and 121659 transitions. [2025-01-09 00:11:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-01-09 00:11:52,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:52,213 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-01-09 00:11:52,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:11:52,214 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:52,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:52,215 INFO L85 PathProgramCache]: Analyzing trace with hash -213345638, now seen corresponding path program 1 times [2025-01-09 00:11:52,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:52,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321283521] [2025-01-09 00:11:52,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:52,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:52,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-01-09 00:11:52,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-01-09 00:11:52,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:52,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat