./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label12.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 8d17ef4c86a3b9aaad0f3756316af6b356203f50f5a16d9fd49cf45964daad71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:54:41,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:54:41,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:54:41,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:54:41,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:54:41,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:54:41,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:54:41,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:54:41,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:54:41,577 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:54:41,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:54:41,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:54:41,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:54:41,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:54:41,577 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:54:41,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:54:41,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:54:41,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:54:41,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:54:41,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:54:41,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:54:41,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:54:41,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:54:41,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:54:41,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:54:41,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:54:41,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:54:41,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:54:41,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:54:41,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:54:41,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:54:41,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:54:41,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:54:41,579 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 -> 8d17ef4c86a3b9aaad0f3756316af6b356203f50f5a16d9fd49cf45964daad71 [2025-01-08 22:54:41,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:54:41,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:54:41,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:54:41,777 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:54:41,777 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:54:41,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label12.c [2025-01-08 22:54:43,010 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29dc4155a/f009a4c55562474f9aa6689f19084cb0/FLAGc0d808b75 [2025-01-08 22:54:43,349 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:54:43,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label12.c [2025-01-08 22:54:43,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29dc4155a/f009a4c55562474f9aa6689f19084cb0/FLAGc0d808b75 [2025-01-08 22:54:43,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29dc4155a/f009a4c55562474f9aa6689f19084cb0 [2025-01-08 22:54:43,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:54:43,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:54:43,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:54:43,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:54:43,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:54:43,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:54:43" (1/1) ... [2025-01-08 22:54:43,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47308625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:43, skipping insertion in model container [2025-01-08 22:54:43,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:54:43" (1/1) ... [2025-01-08 22:54:43,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:54:43,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label12.c[56222,56235] [2025-01-08 22:54:43,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:54:43,926 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:54:44,032 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label12.c[56222,56235] [2025-01-08 22:54:44,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:54:44,061 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:54:44,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44 WrapperNode [2025-01-08 22:54:44,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:54:44,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:54:44,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:54:44,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:54:44,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,181 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-01-08 22:54:44,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:54:44,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:54:44,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:54:44,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:54:44,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,244 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:54:44,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,287 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:54:44,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:54:44,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:54:44,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:54:44,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (1/1) ... [2025-01-08 22:54:44,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:54:44,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:54:44,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:54:44,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:54:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:54:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:54:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:54:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:54:44,443 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:54:44,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:54:45,732 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-08 22:54:45,732 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:54:45,747 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:54:45,748 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:54:45,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:54:45 BoogieIcfgContainer [2025-01-08 22:54:45,748 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:54:45,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:54:45,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:54:45,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:54:45,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:54:43" (1/3) ... [2025-01-08 22:54:45,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75257de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:54:45, skipping insertion in model container [2025-01-08 22:54:45,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:54:44" (2/3) ... [2025-01-08 22:54:45,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75257de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:54:45, skipping insertion in model container [2025-01-08 22:54:45,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:54:45" (3/3) ... [2025-01-08 22:54:45,754 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label12.c [2025-01-08 22:54:45,764 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:54:45,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label12.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:54:45,804 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:54:45,811 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;@74eac051, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:54:45,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:54:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-08 22:54:45,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:45,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:45,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:45,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2000492962, now seen corresponding path program 1 times [2025-01-08 22:54:45,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:45,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100174962] [2025-01-08 22:54:45,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:45,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:46,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-08 22:54:46,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-08 22:54:46,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:46,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:46,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100174962] [2025-01-08 22:54:46,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100174962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:46,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:46,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:46,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003980924] [2025-01-08 22:54:46,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:46,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:46,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:46,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:46,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:46,594 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 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-08 22:54:47,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:47,396 INFO L93 Difference]: Finished difference Result 855 states and 1493 transitions. [2025-01-08 22:54:47,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:47,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 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 163 [2025-01-08 22:54:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:47,406 INFO L225 Difference]: With dead ends: 855 [2025-01-08 22:54:47,406 INFO L226 Difference]: Without dead ends: 460 [2025-01-08 22:54:47,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:47,411 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 133 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:47,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 174 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:54:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-08 22:54:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 459. [2025-01-08 22:54:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.5502183406113537) internal successors, (710), 458 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 710 transitions. [2025-01-08 22:54:47,454 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 710 transitions. Word has length 163 [2025-01-08 22:54:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:47,455 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 710 transitions. [2025-01-08 22:54:47,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 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-08 22:54:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 710 transitions. [2025-01-08 22:54:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-08 22:54:47,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:47,458 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:47,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:54:47,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:47,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:47,459 INFO L85 PathProgramCache]: Analyzing trace with hash 883031475, now seen corresponding path program 1 times [2025-01-08 22:54:47,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:47,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759155569] [2025-01-08 22:54:47,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:47,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:47,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-08 22:54:47,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-08 22:54:47,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:47,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:47,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:47,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759155569] [2025-01-08 22:54:47,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759155569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:47,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:47,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:47,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693586038] [2025-01-08 22:54:47,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:47,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:47,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:47,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:47,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:47,650 INFO L87 Difference]: Start difference. First operand 459 states and 710 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:47,847 INFO L93 Difference]: Finished difference Result 1369 states and 2122 transitions. [2025-01-08 22:54:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:47,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-01-08 22:54:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:47,851 INFO L225 Difference]: With dead ends: 1369 [2025-01-08 22:54:47,851 INFO L226 Difference]: Without dead ends: 912 [2025-01-08 22:54:47,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:47,853 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:47,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 600 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:54:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-08 22:54:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 909. [2025-01-08 22:54:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.551762114537445) internal successors, (1409), 908 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1409 transitions. [2025-01-08 22:54:47,881 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1409 transitions. Word has length 168 [2025-01-08 22:54:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:47,881 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1409 transitions. [2025-01-08 22:54:47,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1409 transitions. [2025-01-08 22:54:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-08 22:54:47,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:47,885 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:47,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:54:47,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:47,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:47,885 INFO L85 PathProgramCache]: Analyzing trace with hash 688240351, now seen corresponding path program 1 times [2025-01-08 22:54:47,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:47,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210331762] [2025-01-08 22:54:47,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:47,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:47,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-08 22:54:47,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-08 22:54:47,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:47,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:47,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:47,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210331762] [2025-01-08 22:54:47,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210331762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:47,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:47,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:47,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397861726] [2025-01-08 22:54:47,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:47,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:47,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:47,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:47,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:47,999 INFO L87 Difference]: Start difference. First operand 909 states and 1409 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:48,637 INFO L93 Difference]: Finished difference Result 2677 states and 4173 transitions. [2025-01-08 22:54:48,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:48,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-01-08 22:54:48,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:48,643 INFO L225 Difference]: With dead ends: 2677 [2025-01-08 22:54:48,644 INFO L226 Difference]: Without dead ends: 1770 [2025-01-08 22:54:48,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:48,645 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 237 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:48,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 154 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:48,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-01-08 22:54:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1734. [2025-01-08 22:54:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1733 states have (on average 1.5199076745527986) internal successors, (2634), 1733 states have internal predecessors, (2634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2634 transitions. [2025-01-08 22:54:48,676 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2634 transitions. Word has length 171 [2025-01-08 22:54:48,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:48,676 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2634 transitions. [2025-01-08 22:54:48,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2634 transitions. [2025-01-08 22:54:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-08 22:54:48,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:48,682 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:48,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:54:48,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:48,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1702413714, now seen corresponding path program 1 times [2025-01-08 22:54:48,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:48,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593202143] [2025-01-08 22:54:48,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:48,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:48,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-08 22:54:48,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-08 22:54:48,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:48,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:48,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:48,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593202143] [2025-01-08 22:54:48,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593202143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:48,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:48,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:48,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713473299] [2025-01-08 22:54:48,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:48,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:48,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:48,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:48,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:48,828 INFO L87 Difference]: Start difference. First operand 1734 states and 2634 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:49,463 INFO L93 Difference]: Finished difference Result 5118 states and 7792 transitions. [2025-01-08 22:54:49,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:49,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 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 177 [2025-01-08 22:54:49,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:49,474 INFO L225 Difference]: With dead ends: 5118 [2025-01-08 22:54:49,475 INFO L226 Difference]: Without dead ends: 3386 [2025-01-08 22:54:49,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:49,478 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 242 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:49,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 182 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-01-08 22:54:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3378. [2025-01-08 22:54:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3378 states, 3377 states have (on average 1.4394432928634884) internal successors, (4861), 3377 states have internal predecessors, (4861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 4861 transitions. [2025-01-08 22:54:49,547 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 4861 transitions. Word has length 177 [2025-01-08 22:54:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:49,547 INFO L471 AbstractCegarLoop]: Abstraction has 3378 states and 4861 transitions. [2025-01-08 22:54:49,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 4861 transitions. [2025-01-08 22:54:49,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-08 22:54:49,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:49,552 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:49,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:54:49,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:49,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:49,553 INFO L85 PathProgramCache]: Analyzing trace with hash -11601959, now seen corresponding path program 1 times [2025-01-08 22:54:49,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:49,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559020619] [2025-01-08 22:54:49,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:49,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:49,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-08 22:54:49,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-08 22:54:49,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:49,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:49,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:49,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559020619] [2025-01-08 22:54:49,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559020619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:49,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:49,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:49,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769106439] [2025-01-08 22:54:49,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:49,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:49,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:49,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:49,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:49,721 INFO L87 Difference]: Start difference. First operand 3378 states and 4861 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:50,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:50,383 INFO L93 Difference]: Finished difference Result 6752 states and 9717 transitions. [2025-01-08 22:54:50,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:50,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2025-01-08 22:54:50,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:50,393 INFO L225 Difference]: With dead ends: 6752 [2025-01-08 22:54:50,393 INFO L226 Difference]: Without dead ends: 3376 [2025-01-08 22:54:50,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:50,396 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 115 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:50,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 375 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2025-01-08 22:54:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3370. [2025-01-08 22:54:50,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3370 states, 3369 states have (on average 1.3535173642030276) internal successors, (4560), 3369 states have internal predecessors, (4560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4560 transitions. [2025-01-08 22:54:50,446 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4560 transitions. Word has length 178 [2025-01-08 22:54:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:50,446 INFO L471 AbstractCegarLoop]: Abstraction has 3370 states and 4560 transitions. [2025-01-08 22:54:50,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:50,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4560 transitions. [2025-01-08 22:54:50,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-08 22:54:50,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:50,451 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-01-08 22:54:50,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:54:50,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:50,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash -377771733, now seen corresponding path program 1 times [2025-01-08 22:54:50,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:50,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328175953] [2025-01-08 22:54:50,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:50,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:50,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-08 22:54:50,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-08 22:54:50,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:50,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:50,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:50,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328175953] [2025-01-08 22:54:50,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328175953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:50,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:50,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:50,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958542810] [2025-01-08 22:54:50,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:50,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:50,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:50,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:50,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:50,655 INFO L87 Difference]: Start difference. First operand 3370 states and 4560 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:51,331 INFO L93 Difference]: Finished difference Result 8392 states and 11326 transitions. [2025-01-08 22:54:51,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:51,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 184 [2025-01-08 22:54:51,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:51,346 INFO L225 Difference]: With dead ends: 8392 [2025-01-08 22:54:51,346 INFO L226 Difference]: Without dead ends: 5024 [2025-01-08 22:54:51,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:51,350 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 218 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:51,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 404 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2025-01-08 22:54:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 5014. [2025-01-08 22:54:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5014 states, 5013 states have (on average 1.3081986834230999) internal successors, (6558), 5013 states have internal predecessors, (6558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5014 states to 5014 states and 6558 transitions. [2025-01-08 22:54:51,423 INFO L78 Accepts]: Start accepts. Automaton has 5014 states and 6558 transitions. Word has length 184 [2025-01-08 22:54:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:51,423 INFO L471 AbstractCegarLoop]: Abstraction has 5014 states and 6558 transitions. [2025-01-08 22:54:51,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 5014 states and 6558 transitions. [2025-01-08 22:54:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-08 22:54:51,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:51,429 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:51,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:54:51,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:51,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:51,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1782882988, now seen corresponding path program 1 times [2025-01-08 22:54:51,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:51,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918847951] [2025-01-08 22:54:51,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:51,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:51,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-08 22:54:51,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-08 22:54:51,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:51,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:51,540 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:54:51,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:51,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918847951] [2025-01-08 22:54:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918847951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:51,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196413240] [2025-01-08 22:54:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:51,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:51,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:51,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:51,541 INFO L87 Difference]: Start difference. First operand 5014 states and 6558 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:51,859 INFO L93 Difference]: Finished difference Result 9950 states and 13010 transitions. [2025-01-08 22:54:51,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:51,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 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 191 [2025-01-08 22:54:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:51,871 INFO L225 Difference]: With dead ends: 9950 [2025-01-08 22:54:51,872 INFO L226 Difference]: Without dead ends: 4938 [2025-01-08 22:54:51,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:51,877 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:51,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:54:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2025-01-08 22:54:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4938. [2025-01-08 22:54:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4937 states have (on average 1.2833704678954831) internal successors, (6336), 4937 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 6336 transitions. [2025-01-08 22:54:51,982 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 6336 transitions. Word has length 191 [2025-01-08 22:54:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:51,982 INFO L471 AbstractCegarLoop]: Abstraction has 4938 states and 6336 transitions. [2025-01-08 22:54:51,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 6336 transitions. [2025-01-08 22:54:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-08 22:54:51,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:51,989 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:51,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:54:51,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:51,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:51,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1787664553, now seen corresponding path program 1 times [2025-01-08 22:54:51,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:51,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454343178] [2025-01-08 22:54:51,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:52,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-08 22:54:52,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-08 22:54:52,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:52,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:52,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:52,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454343178] [2025-01-08 22:54:52,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454343178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:52,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:52,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:52,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402189281] [2025-01-08 22:54:52,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:52,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:52,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:52,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:52,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:52,091 INFO L87 Difference]: Start difference. First operand 4938 states and 6336 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-08 22:54:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:52,331 INFO L93 Difference]: Finished difference Result 14781 states and 18966 transitions. [2025-01-08 22:54:52,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:52,332 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 192 [2025-01-08 22:54:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:52,358 INFO L225 Difference]: With dead ends: 14781 [2025-01-08 22:54:52,358 INFO L226 Difference]: Without dead ends: 9845 [2025-01-08 22:54:52,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:52,366 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 316 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:52,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 476 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:54:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9845 states. [2025-01-08 22:54:52,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9845 to 9843. [2025-01-08 22:54:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9843 states, 9842 states have (on average 1.2809388335704126) internal successors, (12607), 9842 states have internal predecessors, (12607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 12607 transitions. [2025-01-08 22:54:52,582 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 12607 transitions. Word has length 192 [2025-01-08 22:54:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:52,583 INFO L471 AbstractCegarLoop]: Abstraction has 9843 states and 12607 transitions. [2025-01-08 22:54:52,583 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-08 22:54:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 12607 transitions. [2025-01-08 22:54:52,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-08 22:54:52,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:52,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:52,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:54:52,594 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:52,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash 772660294, now seen corresponding path program 1 times [2025-01-08 22:54:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:52,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68543562] [2025-01-08 22:54:52,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:52,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:52,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-08 22:54:52,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-08 22:54:52,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:52,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:52,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:52,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68543562] [2025-01-08 22:54:52,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68543562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:52,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:52,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:52,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721953717] [2025-01-08 22:54:52,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:52,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:54:52,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:52,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:54:52,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:54:52,822 INFO L87 Difference]: Start difference. First operand 9843 states and 12607 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:53,815 INFO L93 Difference]: Finished difference Result 21756 states and 27924 transitions. [2025-01-08 22:54:53,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:54:53,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2025-01-08 22:54:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:53,832 INFO L225 Difference]: With dead ends: 21756 [2025-01-08 22:54:53,832 INFO L226 Difference]: Without dead ends: 11915 [2025-01-08 22:54:53,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:54:53,842 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 419 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:53,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 89 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 22:54:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11915 states. [2025-01-08 22:54:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11915 to 9843. [2025-01-08 22:54:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9843 states, 9842 states have (on average 1.2809388335704126) internal successors, (12607), 9842 states have internal predecessors, (12607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 12607 transitions. [2025-01-08 22:54:53,975 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 12607 transitions. Word has length 200 [2025-01-08 22:54:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:53,975 INFO L471 AbstractCegarLoop]: Abstraction has 9843 states and 12607 transitions. [2025-01-08 22:54:53,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 12607 transitions. [2025-01-08 22:54:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-08 22:54:53,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:53,985 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:53,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:54:53,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:53,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:53,987 INFO L85 PathProgramCache]: Analyzing trace with hash 254264594, now seen corresponding path program 1 times [2025-01-08 22:54:53,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:53,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138482066] [2025-01-08 22:54:53,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:53,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:54,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-08 22:54:54,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-08 22:54:54,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:54,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:54:54,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:54,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138482066] [2025-01-08 22:54:54,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138482066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:54,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:54,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:54,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399583254] [2025-01-08 22:54:54,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:54,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:54,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:54,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:54,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:54,139 INFO L87 Difference]: Start difference. First operand 9843 states and 12607 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:54,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:54,811 INFO L93 Difference]: Finished difference Result 26246 states and 33405 transitions. [2025-01-08 22:54:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:54,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 206 [2025-01-08 22:54:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:54,838 INFO L225 Difference]: With dead ends: 26246 [2025-01-08 22:54:54,838 INFO L226 Difference]: Without dead ends: 16405 [2025-01-08 22:54:54,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:54,850 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 205 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:54,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 108 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16405 states. [2025-01-08 22:54:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16405 to 16401. [2025-01-08 22:54:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16401 states, 16400 states have (on average 1.2650609756097562) internal successors, (20747), 16400 states have internal predecessors, (20747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16401 states to 16401 states and 20747 transitions. [2025-01-08 22:54:55,035 INFO L78 Accepts]: Start accepts. Automaton has 16401 states and 20747 transitions. Word has length 206 [2025-01-08 22:54:55,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:55,037 INFO L471 AbstractCegarLoop]: Abstraction has 16401 states and 20747 transitions. [2025-01-08 22:54:55,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 16401 states and 20747 transitions. [2025-01-08 22:54:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-08 22:54:55,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:55,050 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:55,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:54:55,050 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:55,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:55,051 INFO L85 PathProgramCache]: Analyzing trace with hash -605276788, now seen corresponding path program 1 times [2025-01-08 22:54:55,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:55,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68526015] [2025-01-08 22:54:55,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:55,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-08 22:54:55,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-08 22:54:55,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:55,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:54:55,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68526015] [2025-01-08 22:54:55,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68526015] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:54:55,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560656290] [2025-01-08 22:54:55,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:55,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:54:55,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:54:55,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:54:55,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:54:55,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-08 22:54:55,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-08 22:54:55,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:55,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:55,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:54:55,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:54:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:55,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:54:55,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560656290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:55,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:54:55,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:54:55,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53071936] [2025-01-08 22:54:55,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:55,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:55,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:55,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:55,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:54:55,495 INFO L87 Difference]: Start difference. First operand 16401 states and 20747 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:56,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:56,244 INFO L93 Difference]: Finished difference Result 48658 states and 61560 transitions. [2025-01-08 22:54:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:56,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 207 [2025-01-08 22:54:56,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:56,297 INFO L225 Difference]: With dead ends: 48658 [2025-01-08 22:54:56,297 INFO L226 Difference]: Without dead ends: 32259 [2025-01-08 22:54:56,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:54:56,315 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 214 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:56,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 376 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32259 states. [2025-01-08 22:54:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32259 to 32235. [2025-01-08 22:54:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32235 states, 32234 states have (on average 1.1689210150772475) internal successors, (37679), 32234 states have internal predecessors, (37679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32235 states to 32235 states and 37679 transitions. [2025-01-08 22:54:56,759 INFO L78 Accepts]: Start accepts. Automaton has 32235 states and 37679 transitions. Word has length 207 [2025-01-08 22:54:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:56,759 INFO L471 AbstractCegarLoop]: Abstraction has 32235 states and 37679 transitions. [2025-01-08 22:54:56,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 32235 states and 37679 transitions. [2025-01-08 22:54:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-08 22:54:56,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:56,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:56,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:54:56,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-08 22:54:56,982 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:56,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:56,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1918061920, now seen corresponding path program 1 times [2025-01-08 22:54:56,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:56,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956969111] [2025-01-08 22:54:56,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:56,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:57,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-08 22:54:57,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-08 22:54:57,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:57,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:54:57,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956969111] [2025-01-08 22:54:57,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956969111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:57,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:57,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:54:57,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511916865] [2025-01-08 22:54:57,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:57,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:57,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:57,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:57,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:57,189 INFO L87 Difference]: Start difference. First operand 32235 states and 37679 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:57,883 INFO L93 Difference]: Finished difference Result 76648 states and 91023 transitions. [2025-01-08 22:54:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:57,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2025-01-08 22:54:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:57,948 INFO L225 Difference]: With dead ends: 76648 [2025-01-08 22:54:57,948 INFO L226 Difference]: Without dead ends: 44415 [2025-01-08 22:54:57,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:57,978 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 172 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:57,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 150 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:54:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44415 states. [2025-01-08 22:54:58,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44415 to 44415. [2025-01-08 22:54:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44415 states, 44414 states have (on average 1.1413743414238753) internal successors, (50693), 44414 states have internal predecessors, (50693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44415 states to 44415 states and 50693 transitions. [2025-01-08 22:54:58,547 INFO L78 Accepts]: Start accepts. Automaton has 44415 states and 50693 transitions. Word has length 207 [2025-01-08 22:54:58,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:58,547 INFO L471 AbstractCegarLoop]: Abstraction has 44415 states and 50693 transitions. [2025-01-08 22:54:58,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 44415 states and 50693 transitions. [2025-01-08 22:54:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-08 22:54:58,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:58,566 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:54:58,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:54:58,566 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:58,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:58,567 INFO L85 PathProgramCache]: Analyzing trace with hash -872151077, now seen corresponding path program 1 times [2025-01-08 22:54:58,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:58,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072361230] [2025-01-08 22:54:58,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:58,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:58,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-08 22:54:58,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-08 22:54:58,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:58,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:54:58,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072361230] [2025-01-08 22:54:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072361230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:58,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:58,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:58,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850265805] [2025-01-08 22:54:58,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:58,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:58,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:58,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:58,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:58,728 INFO L87 Difference]: Start difference. First operand 44415 states and 50693 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-08 22:54:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:59,557 INFO L93 Difference]: Finished difference Result 111224 states and 127145 transitions. [2025-01-08 22:54:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:59,558 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 232 [2025-01-08 22:54:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:59,638 INFO L225 Difference]: With dead ends: 111224 [2025-01-08 22:54:59,638 INFO L226 Difference]: Without dead ends: 66811 [2025-01-08 22:54:59,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:59,675 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 167 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:59,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 324 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:54:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66811 states. [2025-01-08 22:55:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66811 to 65933. [2025-01-08 22:55:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65933 states, 65932 states have (on average 1.1233695322453436) internal successors, (74066), 65932 states have internal predecessors, (74066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65933 states to 65933 states and 74066 transitions. [2025-01-08 22:55:00,544 INFO L78 Accepts]: Start accepts. Automaton has 65933 states and 74066 transitions. Word has length 232 [2025-01-08 22:55:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:00,545 INFO L471 AbstractCegarLoop]: Abstraction has 65933 states and 74066 transitions. [2025-01-08 22:55:00,545 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-08 22:55:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 65933 states and 74066 transitions. [2025-01-08 22:55:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-08 22:55:00,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:00,565 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:00,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:55:00,565 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:00,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:00,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1682528899, now seen corresponding path program 1 times [2025-01-08 22:55:00,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:00,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13131506] [2025-01-08 22:55:00,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:00,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:00,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-08 22:55:00,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-08 22:55:00,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:00,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:55:01,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:01,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13131506] [2025-01-08 22:55:01,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13131506] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:55:01,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160709175] [2025-01-08 22:55:01,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:01,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:01,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:01,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:55:01,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:55:01,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-08 22:55:01,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-08 22:55:01,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:01,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:01,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:55:01,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:55:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:55:01,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:55:01,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160709175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:01,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:55:01,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:55:01,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128516935] [2025-01-08 22:55:01,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:01,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:01,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:01,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:01,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:01,188 INFO L87 Difference]: Start difference. First operand 65933 states and 74066 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:01,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:01,994 INFO L93 Difference]: Finished difference Result 144896 states and 163119 transitions. [2025-01-08 22:55:01,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:01,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 235 [2025-01-08 22:55:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:02,231 INFO L225 Difference]: With dead ends: 144896 [2025-01-08 22:55:02,231 INFO L226 Difference]: Without dead ends: 78965 [2025-01-08 22:55:02,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:02,262 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 190 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:02,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 375 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:55:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78965 states. [2025-01-08 22:55:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78965 to 75691. [2025-01-08 22:55:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75691 states, 75690 states have (on average 1.1234377064341392) internal successors, (85033), 75690 states have internal predecessors, (85033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75691 states to 75691 states and 85033 transitions. [2025-01-08 22:55:03,028 INFO L78 Accepts]: Start accepts. Automaton has 75691 states and 85033 transitions. Word has length 235 [2025-01-08 22:55:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:03,028 INFO L471 AbstractCegarLoop]: Abstraction has 75691 states and 85033 transitions. [2025-01-08 22:55:03,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 75691 states and 85033 transitions. [2025-01-08 22:55:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-08 22:55:03,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:03,045 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 22:55:03,051 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-08 22:55:03,246 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-08 22:55:03,246 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:03,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:03,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1103591670, now seen corresponding path program 1 times [2025-01-08 22:55:03,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:03,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002966260] [2025-01-08 22:55:03,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:03,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:03,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-08 22:55:03,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-08 22:55:03,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:03,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:03,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002966260] [2025-01-08 22:55:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002966260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:03,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:03,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419042798] [2025-01-08 22:55:03,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:03,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:03,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:03,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:03,414 INFO L87 Difference]: Start difference. First operand 75691 states and 85033 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:04,721 INFO L93 Difference]: Finished difference Result 153074 states and 172021 transitions. [2025-01-08 22:55:04,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:04,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2025-01-08 22:55:04,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:04,812 INFO L225 Difference]: With dead ends: 153074 [2025-01-08 22:55:04,812 INFO L226 Difference]: Without dead ends: 77385 [2025-01-08 22:55:04,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:04,844 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 393 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:04,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 85 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:55:04,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77385 states. [2025-01-08 22:55:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77385 to 74067. [2025-01-08 22:55:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74067 states, 74066 states have (on average 1.123457456862798) internal successors, (83210), 74066 states have internal predecessors, (83210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74067 states to 74067 states and 83210 transitions. [2025-01-08 22:55:05,855 INFO L78 Accepts]: Start accepts. Automaton has 74067 states and 83210 transitions. Word has length 248 [2025-01-08 22:55:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:05,855 INFO L471 AbstractCegarLoop]: Abstraction has 74067 states and 83210 transitions. [2025-01-08 22:55:05,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 74067 states and 83210 transitions. [2025-01-08 22:55:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-08 22:55:05,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:05,877 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:55:05,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:55:05,878 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:05,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:05,878 INFO L85 PathProgramCache]: Analyzing trace with hash -4756906, now seen corresponding path program 1 times [2025-01-08 22:55:05,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:05,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785876828] [2025-01-08 22:55:05,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:05,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-08 22:55:05,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-08 22:55:05,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:05,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:55:06,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:06,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785876828] [2025-01-08 22:55:06,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785876828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:06,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:06,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:06,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100045020] [2025-01-08 22:55:06,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:06,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:06,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:06,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:06,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:06,251 INFO L87 Difference]: Start difference. First operand 74067 states and 83210 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:06,954 INFO L93 Difference]: Finished difference Result 148944 states and 167266 transitions. [2025-01-08 22:55:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:06,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 251 [2025-01-08 22:55:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:07,025 INFO L225 Difference]: With dead ends: 148944 [2025-01-08 22:55:07,025 INFO L226 Difference]: Without dead ends: 70413 [2025-01-08 22:55:07,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:07,067 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 439 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:07,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 52 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:55:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70413 states. [2025-01-08 22:55:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70413 to 65947. [2025-01-08 22:55:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65947 states, 65946 states have (on average 1.0787007551633154) internal successors, (71136), 65946 states have internal predecessors, (71136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65947 states to 65947 states and 71136 transitions. [2025-01-08 22:55:08,027 INFO L78 Accepts]: Start accepts. Automaton has 65947 states and 71136 transitions. Word has length 251 [2025-01-08 22:55:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:08,027 INFO L471 AbstractCegarLoop]: Abstraction has 65947 states and 71136 transitions. [2025-01-08 22:55:08,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 65947 states and 71136 transitions. [2025-01-08 22:55:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-01-08 22:55:08,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:08,046 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 22:55:08,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:55:08,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:08,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash 835710524, now seen corresponding path program 1 times [2025-01-08 22:55:08,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:08,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834564153] [2025-01-08 22:55:08,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:08,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:08,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-08 22:55:08,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-08 22:55:08,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:08,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-08 22:55:08,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:08,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834564153] [2025-01-08 22:55:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834564153] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:55:08,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287794379] [2025-01-08 22:55:08,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:08,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:08,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:08,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:55:08,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:55:08,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-08 22:55:08,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-08 22:55:08,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:08,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:08,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:55:08,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:55:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-08 22:55:08,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:55:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287794379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:08,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:55:08,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:55:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088192371] [2025-01-08 22:55:08,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:08,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:08,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:08,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:55:08,657 INFO L87 Difference]: Start difference. First operand 65947 states and 71136 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:09,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:09,798 INFO L93 Difference]: Finished difference Result 187659 states and 202602 transitions. [2025-01-08 22:55:09,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:09,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 255 [2025-01-08 22:55:09,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:09,924 INFO L225 Difference]: With dead ends: 187659 [2025-01-08 22:55:09,924 INFO L226 Difference]: Without dead ends: 121714 [2025-01-08 22:55:09,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:55:09,972 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 499 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:09,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 448 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:55:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121714 states. [2025-01-08 22:55:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121714 to 84253. [2025-01-08 22:55:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84253 states, 84252 states have (on average 1.0816835208659734) internal successors, (91134), 84252 states have internal predecessors, (91134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84253 states to 84253 states and 91134 transitions. [2025-01-08 22:55:11,170 INFO L78 Accepts]: Start accepts. Automaton has 84253 states and 91134 transitions. Word has length 255 [2025-01-08 22:55:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:11,170 INFO L471 AbstractCegarLoop]: Abstraction has 84253 states and 91134 transitions. [2025-01-08 22:55:11,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 84253 states and 91134 transitions. [2025-01-08 22:55:11,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-08 22:55:11,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:11,182 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:11,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:55:11,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:11,387 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:11,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:11,387 INFO L85 PathProgramCache]: Analyzing trace with hash 482699267, now seen corresponding path program 1 times [2025-01-08 22:55:11,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:11,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656043180] [2025-01-08 22:55:11,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:11,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:11,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-08 22:55:11,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-08 22:55:11,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:11,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-08 22:55:11,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:11,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656043180] [2025-01-08 22:55:11,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656043180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:11,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:11,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419088395] [2025-01-08 22:55:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:11,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:11,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:11,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:11,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:11,511 INFO L87 Difference]: Start difference. First operand 84253 states and 91134 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:12,456 INFO L93 Difference]: Finished difference Result 186462 states and 201656 transitions. [2025-01-08 22:55:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:12,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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 278 [2025-01-08 22:55:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:12,585 INFO L225 Difference]: With dead ends: 186462 [2025-01-08 22:55:12,585 INFO L226 Difference]: Without dead ends: 102211 [2025-01-08 22:55:12,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:12,625 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 156 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:12,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 106 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:55:12,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102211 states. [2025-01-08 22:55:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102211 to 94224. [2025-01-08 22:55:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94224 states, 94223 states have (on average 1.082357810725619) internal successors, (101983), 94223 states have internal predecessors, (101983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:14,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94224 states to 94224 states and 101983 transitions. [2025-01-08 22:55:14,056 INFO L78 Accepts]: Start accepts. Automaton has 94224 states and 101983 transitions. Word has length 278 [2025-01-08 22:55:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:14,056 INFO L471 AbstractCegarLoop]: Abstraction has 94224 states and 101983 transitions. [2025-01-08 22:55:14,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 94224 states and 101983 transitions. [2025-01-08 22:55:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-01-08 22:55:14,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:14,069 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:14,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:55:14,069 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:14,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:14,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1000193067, now seen corresponding path program 1 times [2025-01-08 22:55:14,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:14,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892014462] [2025-01-08 22:55:14,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:14,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:14,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-08 22:55:14,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-08 22:55:14,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:14,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:14,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892014462] [2025-01-08 22:55:14,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892014462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:14,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:14,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950319715] [2025-01-08 22:55:14,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:14,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:14,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:14,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:14,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:14,259 INFO L87 Difference]: Start difference. First operand 94224 states and 101983 transitions. Second operand has 4 states, 4 states have (on average 78.25) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:15,408 INFO L93 Difference]: Finished difference Result 251655 states and 272530 transitions. [2025-01-08 22:55:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:15,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 313 [2025-01-08 22:55:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:15,582 INFO L225 Difference]: With dead ends: 251655 [2025-01-08 22:55:15,582 INFO L226 Difference]: Without dead ends: 157228 [2025-01-08 22:55:15,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:15,654 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 410 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:15,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 406 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:55:15,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157228 states. [2025-01-08 22:55:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157228 to 149904. [2025-01-08 22:55:17,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149904 states, 149903 states have (on average 1.078510770298126) internal successors, (161672), 149903 states have internal predecessors, (161672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149904 states to 149904 states and 161672 transitions. [2025-01-08 22:55:17,799 INFO L78 Accepts]: Start accepts. Automaton has 149904 states and 161672 transitions. Word has length 313 [2025-01-08 22:55:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:17,799 INFO L471 AbstractCegarLoop]: Abstraction has 149904 states and 161672 transitions. [2025-01-08 22:55:17,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 149904 states and 161672 transitions. [2025-01-08 22:55:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-01-08 22:55:17,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:17,811 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:17,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 22:55:17,812 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:17,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash 933416120, now seen corresponding path program 1 times [2025-01-08 22:55:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:17,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235324834] [2025-01-08 22:55:17,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:17,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-01-08 22:55:17,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-01-08 22:55:17,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:17,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:18,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235324834] [2025-01-08 22:55:18,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235324834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:18,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:18,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:18,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875507604] [2025-01-08 22:55:18,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:18,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:18,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:18,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:18,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:18,316 INFO L87 Difference]: Start difference. First operand 149904 states and 161672 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:19,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:19,488 INFO L93 Difference]: Finished difference Result 305497 states and 329440 transitions. [2025-01-08 22:55:19,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:19,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 331 [2025-01-08 22:55:19,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:19,682 INFO L225 Difference]: With dead ends: 305497 [2025-01-08 22:55:19,682 INFO L226 Difference]: Without dead ends: 155595 [2025-01-08 22:55:19,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:19,752 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 143 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:19,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 336 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:55:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155595 states. [2025-01-08 22:55:21,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155595 to 153551. [2025-01-08 22:55:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153551 states, 153550 states have (on average 1.0776685118853793) internal successors, (165476), 153550 states have internal predecessors, (165476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153551 states to 153551 states and 165476 transitions. [2025-01-08 22:55:21,764 INFO L78 Accepts]: Start accepts. Automaton has 153551 states and 165476 transitions. Word has length 331 [2025-01-08 22:55:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:21,764 INFO L471 AbstractCegarLoop]: Abstraction has 153551 states and 165476 transitions. [2025-01-08 22:55:21,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 153551 states and 165476 transitions. [2025-01-08 22:55:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-01-08 22:55:21,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:21,777 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:21,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 22:55:21,777 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:21,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1628679414, now seen corresponding path program 1 times [2025-01-08 22:55:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:21,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101572324] [2025-01-08 22:55:21,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:21,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:21,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-01-08 22:55:21,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-01-08 22:55:21,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:21,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:22,277 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-08 22:55:22,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:22,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101572324] [2025-01-08 22:55:22,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101572324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:22,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:22,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:22,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218178941] [2025-01-08 22:55:22,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:22,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:22,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:22,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:22,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:22,278 INFO L87 Difference]: Start difference. First operand 153551 states and 165476 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:23,543 INFO L93 Difference]: Finished difference Result 302859 states and 326628 transitions. [2025-01-08 22:55:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 344 [2025-01-08 22:55:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:23,740 INFO L225 Difference]: With dead ends: 302859 [2025-01-08 22:55:23,740 INFO L226 Difference]: Without dead ends: 149310 [2025-01-08 22:55:23,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:23,816 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 101 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:23,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 274 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:55:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149310 states. [2025-01-08 22:55:25,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149310 to 149288. [2025-01-08 22:55:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149288 states, 149287 states have (on average 1.076523742857717) internal successors, (160711), 149287 states have internal predecessors, (160711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149288 states to 149288 states and 160711 transitions. [2025-01-08 22:55:25,902 INFO L78 Accepts]: Start accepts. Automaton has 149288 states and 160711 transitions. Word has length 344 [2025-01-08 22:55:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:25,903 INFO L471 AbstractCegarLoop]: Abstraction has 149288 states and 160711 transitions. [2025-01-08 22:55:25,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:25,903 INFO L276 IsEmpty]: Start isEmpty. Operand 149288 states and 160711 transitions. [2025-01-08 22:55:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-01-08 22:55:25,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:25,923 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:55:25,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 22:55:25,924 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:25,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1946037642, now seen corresponding path program 1 times [2025-01-08 22:55:25,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:25,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051405126] [2025-01-08 22:55:25,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:25,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:25,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-01-08 22:55:25,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-01-08 22:55:25,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:25,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:55:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:26,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051405126] [2025-01-08 22:55:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051405126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:26,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:26,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:55:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270936257] [2025-01-08 22:55:26,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:26,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:26,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:26,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:26,473 INFO L87 Difference]: Start difference. First operand 149288 states and 160711 transitions. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:27,967 INFO L93 Difference]: Finished difference Result 314002 states and 338440 transitions. [2025-01-08 22:55:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:27,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 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 400 [2025-01-08 22:55:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:28,180 INFO L225 Difference]: With dead ends: 314002 [2025-01-08 22:55:28,180 INFO L226 Difference]: Without dead ends: 160250 [2025-01-08 22:55:28,224 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-08 22:55:28,230 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 274 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:28,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 105 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:55:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160250 states. [2025-01-08 22:55:29,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160250 to 153551. [2025-01-08 22:55:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153551 states, 153550 states have (on average 1.0713839140345165) internal successors, (164511), 153550 states have internal predecessors, (164511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153551 states to 153551 states and 164511 transitions. [2025-01-08 22:55:30,337 INFO L78 Accepts]: Start accepts. Automaton has 153551 states and 164511 transitions. Word has length 400 [2025-01-08 22:55:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:30,338 INFO L471 AbstractCegarLoop]: Abstraction has 153551 states and 164511 transitions. [2025-01-08 22:55:30,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 153551 states and 164511 transitions. [2025-01-08 22:55:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-08 22:55:30,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:30,358 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:55:30,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 22:55:30,358 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:30,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:30,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1721046465, now seen corresponding path program 1 times [2025-01-08 22:55:30,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:30,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845890157] [2025-01-08 22:55:30,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:30,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:30,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-08 22:55:30,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-08 22:55:30,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:30,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-08 22:55:30,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:30,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845890157] [2025-01-08 22:55:30,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845890157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:30,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:30,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:30,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521925189] [2025-01-08 22:55:30,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:30,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:30,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:30,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:30,566 INFO L87 Difference]: Start difference. First operand 153551 states and 164511 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:31,744 INFO L93 Difference]: Finished difference Result 451281 states and 483201 transitions. [2025-01-08 22:55:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:31,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 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 409 [2025-01-08 22:55:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:32,097 INFO L225 Difference]: With dead ends: 451281 [2025-01-08 22:55:32,097 INFO L226 Difference]: Without dead ends: 297732 [2025-01-08 22:55:32,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:32,191 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 181 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:32,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 479 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:55:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297732 states.