./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 163b1e4f0aac9bc589d5c69fa383b82ca836f7f4fc72d1577e6f9bf24923b682 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:43:24,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:43:24,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:43:24,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:43:24,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:43:24,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:43:24,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:43:24,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:43:24,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:43:24,321 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:43:24,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:43:24,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:43:24,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:43:24,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:43:24,321 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:43:24,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:43:24,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:43:24,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:43:24,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:43:24,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:43:24,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:43:24,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:43:24,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:43:24,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:43:24,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:43:24,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:43:24,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:43:24,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:43:24,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:43:24,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:43:24,323 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 -> 163b1e4f0aac9bc589d5c69fa383b82ca836f7f4fc72d1577e6f9bf24923b682 [2025-02-05 17:43:24,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:43:24,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:43:24,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:43:24,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:43:24,507 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:43:24,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-02-05 17:43:25,628 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf75c9bed/06c07e2878de4a0fb741e7af82f2dd2c/FLAG28341bae2 [2025-02-05 17:43:26,127 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:43:26,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-02-05 17:43:26,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf75c9bed/06c07e2878de4a0fb741e7af82f2dd2c/FLAG28341bae2 [2025-02-05 17:43:26,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf75c9bed/06c07e2878de4a0fb741e7af82f2dd2c [2025-02-05 17:43:26,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:43:26,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:43:26,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:43:26,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:43:26,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:43:26,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:43:26" (1/1) ... [2025-02-05 17:43:26,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f02431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:26, skipping insertion in model container [2025-02-05 17:43:26,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:43:26" (1/1) ... [2025-02-05 17:43:26,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:43:26,598 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[11742,11755] [2025-02-05 17:43:26,666 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[19490,19503] [2025-02-05 17:43:27,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:43:27,090 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:43:27,119 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[11742,11755] [2025-02-05 17:43:27,131 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/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c[19490,19503] [2025-02-05 17:43:27,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:43:27,397 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:43:27,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27 WrapperNode [2025-02-05 17:43:27,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:43:27,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:43:27,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:43:27,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:43:27,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (1/1) ... [2025-02-05 17:43:27,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (1/1) ... [2025-02-05 17:43:27,715 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5089 [2025-02-05 17:43:27,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:43:27,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:43:27,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:43:27,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:43:27,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (1/1) ... [2025-02-05 17:43:27,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (1/1) ... [2025-02-05 17:43:27,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (1/1) ... [2025-02-05 17:43:27,977 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-02-05 17:43:27,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (1/1) ... [2025-02-05 17:43:27,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (1/1) ... [2025-02-05 17:43:28,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (1/1) ... [2025-02-05 17:43:28,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (1/1) ... [2025-02-05 17:43:28,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (1/1) ... [2025-02-05 17:43:28,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (1/1) ... [2025-02-05 17:43:28,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:43:28,154 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:43:28,154 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:43:28,154 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:43:28,155 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (1/1) ... [2025-02-05 17:43:28,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:43:28,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:28,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:43:28,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:43:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:43:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:43:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:43:28,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:43:28,297 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:43:28,299 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:43:31,564 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2128: havoc calculate_output_#t~ret37#1; [2025-02-05 17:43:31,564 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3607: havoc calculate_output2_#t~ret38#1; [2025-02-05 17:43:31,564 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5097: havoc calculate_output3_#t~ret39#1; [2025-02-05 17:43:31,660 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-02-05 17:43:31,660 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:43:31,679 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:43:31,680 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:43:31,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:43:31 BoogieIcfgContainer [2025-02-05 17:43:31,680 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:43:31,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:43:31,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:43:31,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:43:31,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:43:26" (1/3) ... [2025-02-05 17:43:31,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31990dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:43:31, skipping insertion in model container [2025-02-05 17:43:31,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:43:27" (2/3) ... [2025-02-05 17:43:31,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31990dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:43:31, skipping insertion in model container [2025-02-05 17:43:31,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:43:31" (3/3) ... [2025-02-05 17:43:31,689 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c [2025-02-05 17:43:31,699 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:43:31,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label09.c that has 1 procedures, 898 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:43:31,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:43:31,780 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;@6115f20f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:43:31,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:43:31,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:43:31,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:31,790 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] [2025-02-05 17:43:31,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:31,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:31,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1170366575, now seen corresponding path program 1 times [2025-02-05 17:43:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872589548] [2025-02-05 17:43:31,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:31,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:43:31,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:43:31,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:31,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872589548] [2025-02-05 17:43:31,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872589548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:31,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:31,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:43:31,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499999053] [2025-02-05 17:43:31,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:31,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:43:31,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:31,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:43:31,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:43:31,970 INFO L87 Difference]: Start difference. First operand has 898 states, 895 states have (on average 1.9039106145251397) internal successors, (1704), 897 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:32,023 INFO L93 Difference]: Finished difference Result 1758 states and 3337 transitions. [2025-02-05 17:43:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:43:32,024 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-05 17:43:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:32,033 INFO L225 Difference]: With dead ends: 1758 [2025-02-05 17:43:32,033 INFO L226 Difference]: Without dead ends: 833 [2025-02-05 17:43:32,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:43:32,037 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:32,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:32,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-02-05 17:43:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-02-05 17:43:32,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8941034897713598) internal successors, (1574), 832 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1574 transitions. [2025-02-05 17:43:32,105 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1574 transitions. Word has length 24 [2025-02-05 17:43:32,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:32,105 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1574 transitions. [2025-02-05 17:43:32,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1574 transitions. [2025-02-05 17:43:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 17:43:32,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:32,106 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] [2025-02-05 17:43:32,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:43:32,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:32,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:32,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2127528368, now seen corresponding path program 1 times [2025-02-05 17:43:32,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:32,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099171948] [2025-02-05 17:43:32,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:32,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:32,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 17:43:32,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 17:43:32,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:32,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:32,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:32,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099171948] [2025-02-05 17:43:32,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099171948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:32,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:32,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:43:32,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033638230] [2025-02-05 17:43:32,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:32,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:43:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:32,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:43:32,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:43:32,361 INFO L87 Difference]: Start difference. First operand 833 states and 1574 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:32,502 INFO L93 Difference]: Finished difference Result 879 states and 1645 transitions. [2025-02-05 17:43:32,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:43:32,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-02-05 17:43:32,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:32,517 INFO L225 Difference]: With dead ends: 879 [2025-02-05 17:43:32,517 INFO L226 Difference]: Without dead ends: 833 [2025-02-05 17:43:32,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 17:43:32,518 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 0 mSDsluCounter, 4680 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6252 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:32,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6252 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-02-05 17:43:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 833. [2025-02-05 17:43:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 831 states have (on average 1.8567990373044525) internal successors, (1543), 832 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1543 transitions. [2025-02-05 17:43:32,548 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1543 transitions. Word has length 24 [2025-02-05 17:43:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:32,548 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1543 transitions. [2025-02-05 17:43:32,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1543 transitions. [2025-02-05 17:43:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:43:32,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:32,550 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] [2025-02-05 17:43:32,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:43:32,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:32,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:32,551 INFO L85 PathProgramCache]: Analyzing trace with hash -130168238, now seen corresponding path program 1 times [2025-02-05 17:43:32,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:32,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235315277] [2025-02-05 17:43:32,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:32,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:32,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:43:32,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:43:32,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:32,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:32,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:32,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235315277] [2025-02-05 17:43:32,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235315277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:32,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:32,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:32,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273341296] [2025-02-05 17:43:32,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:32,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:32,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:32,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:32,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:32,863 INFO L87 Difference]: Start difference. First operand 833 states and 1543 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:33,308 INFO L93 Difference]: Finished difference Result 1253 states and 2213 transitions. [2025-02-05 17:43:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:43:33,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-02-05 17:43:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:33,323 INFO L225 Difference]: With dead ends: 1253 [2025-02-05 17:43:33,323 INFO L226 Difference]: Without dead ends: 1211 [2025-02-05 17:43:33,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-05 17:43:33,326 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 7898 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7898 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:33,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7898 Valid, 2999 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:43:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-02-05 17:43:33,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 873. [2025-02-05 17:43:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8450057405281286) internal successors, (1607), 872 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1607 transitions. [2025-02-05 17:43:33,350 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1607 transitions. Word has length 54 [2025-02-05 17:43:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:33,351 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1607 transitions. [2025-02-05 17:43:33,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1607 transitions. [2025-02-05 17:43:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:43:33,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:33,355 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] [2025-02-05 17:43:33,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:43:33,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:33,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash 582728109, now seen corresponding path program 1 times [2025-02-05 17:43:33,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:33,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070845596] [2025-02-05 17:43:33,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:33,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:33,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:43:33,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:43:33,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:33,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:33,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:33,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070845596] [2025-02-05 17:43:33,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070845596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:33,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:33,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:33,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683391501] [2025-02-05 17:43:33,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:33,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:33,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:33,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:33,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:33,455 INFO L87 Difference]: Start difference. First operand 873 states and 1607 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:33,478 INFO L93 Difference]: Finished difference Result 1026 states and 1850 transitions. [2025-02-05 17:43:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 17:43:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:33,482 INFO L225 Difference]: With dead ends: 1026 [2025-02-05 17:43:33,483 INFO L226 Difference]: Without dead ends: 944 [2025-02-05 17:43:33,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:33,486 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 1482 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:33,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1603 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:33,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-05 17:43:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-02-05 17:43:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 1.824468085106383) internal successors, (1715), 941 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1715 transitions. [2025-02-05 17:43:33,506 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1715 transitions. Word has length 56 [2025-02-05 17:43:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:33,507 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1715 transitions. [2025-02-05 17:43:33,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1715 transitions. [2025-02-05 17:43:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:43:33,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:33,510 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] [2025-02-05 17:43:33,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:43:33,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:33,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash 615051344, now seen corresponding path program 1 times [2025-02-05 17:43:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:33,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302426338] [2025-02-05 17:43:33,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:33,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:43:33,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:43:33,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:33,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:33,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:33,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:33,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302426338] [2025-02-05 17:43:33,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302426338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:33,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:33,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:33,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772246173] [2025-02-05 17:43:33,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:33,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:33,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:33,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:33,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:33,814 INFO L87 Difference]: Start difference. First operand 942 states and 1715 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:33,956 INFO L93 Difference]: Finished difference Result 1095 states and 1955 transitions. [2025-02-05 17:43:33,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:43:33,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 17:43:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:33,959 INFO L225 Difference]: With dead ends: 1095 [2025-02-05 17:43:33,960 INFO L226 Difference]: Without dead ends: 944 [2025-02-05 17:43:33,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:43:33,961 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 7449 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7449 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:33,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7449 Valid, 1789 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-05 17:43:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-02-05 17:43:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 940 states have (on average 1.8223404255319149) internal successors, (1713), 941 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1713 transitions. [2025-02-05 17:43:33,979 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1713 transitions. Word has length 56 [2025-02-05 17:43:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:33,980 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1713 transitions. [2025-02-05 17:43:33,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1713 transitions. [2025-02-05 17:43:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 17:43:33,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:33,981 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] [2025-02-05 17:43:33,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:43:33,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:33,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:33,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1917260214, now seen corresponding path program 1 times [2025-02-05 17:43:33,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:33,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268864193] [2025-02-05 17:43:33,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:33,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:33,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 17:43:34,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 17:43:34,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:34,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:34,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:34,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268864193] [2025-02-05 17:43:34,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268864193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:34,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:34,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:43:34,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544698989] [2025-02-05 17:43:34,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:34,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:43:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:34,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:43:34,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:43:34,370 INFO L87 Difference]: Start difference. First operand 942 states and 1713 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:34,469 INFO L93 Difference]: Finished difference Result 950 states and 1722 transitions. [2025-02-05 17:43:34,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:43:34,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-02-05 17:43:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:34,478 INFO L225 Difference]: With dead ends: 950 [2025-02-05 17:43:34,478 INFO L226 Difference]: Without dead ends: 948 [2025-02-05 17:43:34,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:43:34,482 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 0 mSDsluCounter, 9209 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10746 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:34,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10746 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:34,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-02-05 17:43:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2025-02-05 17:43:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 946 states have (on average 1.8160676532769555) internal successors, (1718), 947 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1718 transitions. [2025-02-05 17:43:34,518 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1718 transitions. Word has length 57 [2025-02-05 17:43:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:34,518 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1718 transitions. [2025-02-05 17:43:34,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1718 transitions. [2025-02-05 17:43:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:43:34,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:34,519 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] [2025-02-05 17:43:34,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:43:34,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:34,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1309029714, now seen corresponding path program 1 times [2025-02-05 17:43:34,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:34,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408998090] [2025-02-05 17:43:34,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:34,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:34,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:43:34,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:43:34,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:34,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:34,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:34,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:34,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408998090] [2025-02-05 17:43:34,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408998090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:34,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:34,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:34,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24383513] [2025-02-05 17:43:34,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:34,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:34,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:34,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:34,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:34,619 INFO L87 Difference]: Start difference. First operand 948 states and 1718 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:34,641 INFO L93 Difference]: Finished difference Result 1118 states and 1979 transitions. [2025-02-05 17:43:34,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:34,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:43:34,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:34,645 INFO L225 Difference]: With dead ends: 1118 [2025-02-05 17:43:34,645 INFO L226 Difference]: Without dead ends: 1030 [2025-02-05 17:43:34,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:34,646 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1496 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:34,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1663 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-02-05 17:43:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1028. [2025-02-05 17:43:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1026 states have (on average 1.7923976608187135) internal successors, (1839), 1027 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1839 transitions. [2025-02-05 17:43:34,665 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1839 transitions. Word has length 58 [2025-02-05 17:43:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:34,665 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1839 transitions. [2025-02-05 17:43:34,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1839 transitions. [2025-02-05 17:43:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:43:34,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:34,667 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] [2025-02-05 17:43:34,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:43:34,667 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:34,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2007007086, now seen corresponding path program 1 times [2025-02-05 17:43:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809304708] [2025-02-05 17:43:34,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:34,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:34,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:43:34,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:43:34,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:34,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:34,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:34,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809304708] [2025-02-05 17:43:34,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809304708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:34,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:34,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:34,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822387633] [2025-02-05 17:43:34,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:34,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:34,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:34,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:34,715 INFO L87 Difference]: Start difference. First operand 1028 states and 1839 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:34,735 INFO L93 Difference]: Finished difference Result 1474 states and 2519 transitions. [2025-02-05 17:43:34,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:34,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:43:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:34,740 INFO L225 Difference]: With dead ends: 1474 [2025-02-05 17:43:34,740 INFO L226 Difference]: Without dead ends: 1239 [2025-02-05 17:43:34,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:34,741 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 1494 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:34,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1669 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-02-05 17:43:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1237. [2025-02-05 17:43:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1235 states have (on average 1.7417004048582996) internal successors, (2151), 1236 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2151 transitions. [2025-02-05 17:43:34,763 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2151 transitions. Word has length 58 [2025-02-05 17:43:34,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:34,763 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 2151 transitions. [2025-02-05 17:43:34,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2151 transitions. [2025-02-05 17:43:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:43:34,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:34,764 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] [2025-02-05 17:43:34,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:43:34,764 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:34,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:34,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1559061550, now seen corresponding path program 1 times [2025-02-05 17:43:34,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:34,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404247734] [2025-02-05 17:43:34,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:34,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:34,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:43:34,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:43:34,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:34,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:34,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:34,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404247734] [2025-02-05 17:43:34,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404247734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:34,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:34,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:34,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107645870] [2025-02-05 17:43:34,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:34,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:34,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:34,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:34,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:34,807 INFO L87 Difference]: Start difference. First operand 1237 states and 2151 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:34,830 INFO L93 Difference]: Finished difference Result 2077 states and 3413 transitions. [2025-02-05 17:43:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:34,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:43:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:34,835 INFO L225 Difference]: With dead ends: 2077 [2025-02-05 17:43:34,835 INFO L226 Difference]: Without dead ends: 1633 [2025-02-05 17:43:34,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:34,837 INFO L435 NwaCegarLoop]: 1595 mSDtfsCounter, 1492 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:34,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1671 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2025-02-05 17:43:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1631. [2025-02-05 17:43:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.6740331491712708) internal successors, (2727), 1630 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2727 transitions. [2025-02-05 17:43:34,863 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2727 transitions. Word has length 58 [2025-02-05 17:43:34,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:34,863 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2727 transitions. [2025-02-05 17:43:34,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2727 transitions. [2025-02-05 17:43:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:43:34,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:34,864 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] [2025-02-05 17:43:34,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:43:34,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:34,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:34,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1974237422, now seen corresponding path program 1 times [2025-02-05 17:43:34,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:34,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254519668] [2025-02-05 17:43:34,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:34,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:34,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:43:34,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:43:34,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:34,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:34,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:34,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254519668] [2025-02-05 17:43:34,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254519668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:34,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:34,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:34,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042481896] [2025-02-05 17:43:34,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:34,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:34,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:34,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:34,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:34,906 INFO L87 Difference]: Start difference. First operand 1631 states and 2727 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:34,935 INFO L93 Difference]: Finished difference Result 3211 states and 5057 transitions. [2025-02-05 17:43:34,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:34,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:43:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:34,942 INFO L225 Difference]: With dead ends: 3211 [2025-02-05 17:43:34,942 INFO L226 Difference]: Without dead ends: 2373 [2025-02-05 17:43:34,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:34,943 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 1490 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:34,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1673 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-02-05 17:43:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2371. [2025-02-05 17:43:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2369 states have (on average 1.5968763191219923) internal successors, (3783), 2370 states have internal predecessors, (3783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3783 transitions. [2025-02-05 17:43:34,981 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3783 transitions. Word has length 58 [2025-02-05 17:43:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:34,981 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3783 transitions. [2025-02-05 17:43:34,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3783 transitions. [2025-02-05 17:43:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 17:43:34,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:34,982 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] [2025-02-05 17:43:34,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:43:34,982 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:34,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1487519150, now seen corresponding path program 1 times [2025-02-05 17:43:34,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:34,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809765286] [2025-02-05 17:43:34,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:34,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:34,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 17:43:35,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 17:43:35,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:35,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809765286] [2025-02-05 17:43:35,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809765286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:35,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:35,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:35,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776267387] [2025-02-05 17:43:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:35,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:35,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:35,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:35,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:35,090 INFO L87 Difference]: Start difference. First operand 2371 states and 3783 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:35,134 INFO L93 Difference]: Finished difference Result 5335 states and 8057 transitions. [2025-02-05 17:43:35,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:35,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 17:43:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:35,143 INFO L225 Difference]: With dead ends: 5335 [2025-02-05 17:43:35,143 INFO L226 Difference]: Without dead ends: 3757 [2025-02-05 17:43:35,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:35,145 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 1488 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:35,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1675 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:35,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2025-02-05 17:43:35,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3755. [2025-02-05 17:43:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3753 states have (on average 1.5195843325339728) internal successors, (5703), 3754 states have internal predecessors, (5703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 5703 transitions. [2025-02-05 17:43:35,210 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 5703 transitions. Word has length 58 [2025-02-05 17:43:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:35,210 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 5703 transitions. [2025-02-05 17:43:35,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 5703 transitions. [2025-02-05 17:43:35,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:43:35,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:35,211 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] [2025-02-05 17:43:35,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:43:35,211 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:35,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash 254351375, now seen corresponding path program 1 times [2025-02-05 17:43:35,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:35,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284970244] [2025-02-05 17:43:35,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:35,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:35,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:43:35,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:43:35,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:35,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:35,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:35,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284970244] [2025-02-05 17:43:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284970244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:35,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:35,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:35,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737163593] [2025-02-05 17:43:35,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:35,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:43:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:35,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:43:35,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:43:35,305 INFO L87 Difference]: Start difference. First operand 3755 states and 5703 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:40,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:40,333 INFO L93 Difference]: Finished difference Result 6010 states and 10012 transitions. [2025-02-05 17:43:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:43:40,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-02-05 17:43:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:40,352 INFO L225 Difference]: With dead ends: 6010 [2025-02-05 17:43:40,353 INFO L226 Difference]: Without dead ends: 5257 [2025-02-05 17:43:40,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:43:40,356 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 2387 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2387 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:40,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2387 Valid, 797 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-02-05 17:43:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2025-02-05 17:43:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 5257. [2025-02-05 17:43:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5255 states have (on average 1.487535680304472) internal successors, (7817), 5256 states have internal predecessors, (7817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 7817 transitions. [2025-02-05 17:43:40,486 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 7817 transitions. Word has length 67 [2025-02-05 17:43:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:40,487 INFO L471 AbstractCegarLoop]: Abstraction has 5257 states and 7817 transitions. [2025-02-05 17:43:40,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 7817 transitions. [2025-02-05 17:43:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:43:40,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:40,490 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] [2025-02-05 17:43:40,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:43:40,490 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:40,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:40,490 INFO L85 PathProgramCache]: Analyzing trace with hash -926993275, now seen corresponding path program 1 times [2025-02-05 17:43:40,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:40,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023192010] [2025-02-05 17:43:40,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:40,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:40,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:43:40,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:43:40,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:40,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:43:40,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:40,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023192010] [2025-02-05 17:43:40,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023192010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:40,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:40,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:40,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064980018] [2025-02-05 17:43:40,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:40,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:40,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:40,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:40,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:40,625 INFO L87 Difference]: Start difference. First operand 5257 states and 7817 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:40,890 INFO L93 Difference]: Finished difference Result 19861 states and 28623 transitions. [2025-02-05 17:43:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:43:40,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 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 77 [2025-02-05 17:43:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:40,934 INFO L225 Difference]: With dead ends: 19861 [2025-02-05 17:43:40,935 INFO L226 Difference]: Without dead ends: 17747 [2025-02-05 17:43:40,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:43:40,944 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 6305 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6305 SdHoareTripleChecker+Valid, 3716 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:40,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6305 Valid, 3716 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17747 states. [2025-02-05 17:43:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17747 to 7801. [2025-02-05 17:43:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7801 states, 7799 states have (on average 1.4618540838569047) internal successors, (11401), 7800 states have internal predecessors, (11401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7801 states to 7801 states and 11401 transitions. [2025-02-05 17:43:41,168 INFO L78 Accepts]: Start accepts. Automaton has 7801 states and 11401 transitions. Word has length 77 [2025-02-05 17:43:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:41,169 INFO L471 AbstractCegarLoop]: Abstraction has 7801 states and 11401 transitions. [2025-02-05 17:43:41,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 7801 states and 11401 transitions. [2025-02-05 17:43:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:43:41,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:41,171 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] [2025-02-05 17:43:41,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:43:41,171 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:41,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:41,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1905923771, now seen corresponding path program 1 times [2025-02-05 17:43:41,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:41,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297956192] [2025-02-05 17:43:41,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:41,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:41,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:43:41,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:43:41,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:41,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:43:41,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:41,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297956192] [2025-02-05 17:43:41,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297956192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:41,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:41,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:41,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081829502] [2025-02-05 17:43:41,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:41,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:41,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:41,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:41,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:41,287 INFO L87 Difference]: Start difference. First operand 7801 states and 11401 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:41,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:41,685 INFO L93 Difference]: Finished difference Result 22821 states and 32815 transitions. [2025-02-05 17:43:41,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:43:41,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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 77 [2025-02-05 17:43:41,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:41,719 INFO L225 Difference]: With dead ends: 22821 [2025-02-05 17:43:41,719 INFO L226 Difference]: Without dead ends: 19859 [2025-02-05 17:43:41,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:43:41,726 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 6309 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6309 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:41,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6309 Valid, 3665 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19859 states. [2025-02-05 17:43:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19859 to 11817. [2025-02-05 17:43:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11817 states, 11815 states have (on average 1.4429961912822682) internal successors, (17049), 11816 states have internal predecessors, (17049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11817 states to 11817 states and 17049 transitions. [2025-02-05 17:43:41,964 INFO L78 Accepts]: Start accepts. Automaton has 11817 states and 17049 transitions. Word has length 77 [2025-02-05 17:43:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:41,964 INFO L471 AbstractCegarLoop]: Abstraction has 11817 states and 17049 transitions. [2025-02-05 17:43:41,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 11817 states and 17049 transitions. [2025-02-05 17:43:41,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:43:41,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:41,966 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] [2025-02-05 17:43:41,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:43:41,966 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:41,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1941097989, now seen corresponding path program 1 times [2025-02-05 17:43:41,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:41,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614464871] [2025-02-05 17:43:41,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:41,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:41,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:43:41,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:43:41,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:41,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:43:42,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:42,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614464871] [2025-02-05 17:43:42,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614464871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:42,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:42,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:42,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013272998] [2025-02-05 17:43:42,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:42,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:42,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:42,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:42,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:42,089 INFO L87 Difference]: Start difference. First operand 11817 states and 17049 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:42,486 INFO L93 Difference]: Finished difference Result 25781 states and 36991 transitions. [2025-02-05 17:43:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:43:42,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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 77 [2025-02-05 17:43:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:42,515 INFO L225 Difference]: With dead ends: 25781 [2025-02-05 17:43:42,516 INFO L226 Difference]: Without dead ends: 22819 [2025-02-05 17:43:42,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:43:42,523 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 6331 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6331 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:42,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6331 Valid, 3633 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22819 states. [2025-02-05 17:43:42,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22819 to 14777. [2025-02-05 17:43:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14777 states, 14775 states have (on average 1.4365482233502538) internal successors, (21225), 14776 states have internal predecessors, (21225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14777 states to 14777 states and 21225 transitions. [2025-02-05 17:43:42,981 INFO L78 Accepts]: Start accepts. Automaton has 14777 states and 21225 transitions. Word has length 77 [2025-02-05 17:43:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:42,981 INFO L471 AbstractCegarLoop]: Abstraction has 14777 states and 21225 transitions. [2025-02-05 17:43:42,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 14777 states and 21225 transitions. [2025-02-05 17:43:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:43:42,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:42,984 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] [2025-02-05 17:43:42,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:43:42,984 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:42,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1938693435, now seen corresponding path program 1 times [2025-02-05 17:43:42,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844847923] [2025-02-05 17:43:42,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:42,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:43,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:43:43,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:43:43,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:43,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 17:43:43,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:43,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844847923] [2025-02-05 17:43:43,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844847923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:43,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:43,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:43,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56936208] [2025-02-05 17:43:43,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:43,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:43,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:43,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:43,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:43,138 INFO L87 Difference]: Start difference. First operand 14777 states and 21225 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:43,586 INFO L93 Difference]: Finished difference Result 28741 states and 41167 transitions. [2025-02-05 17:43:43,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:43:43,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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 77 [2025-02-05 17:43:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:43,626 INFO L225 Difference]: With dead ends: 28741 [2025-02-05 17:43:43,626 INFO L226 Difference]: Without dead ends: 25779 [2025-02-05 17:43:43,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:43:43,635 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 6369 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6369 SdHoareTripleChecker+Valid, 3626 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:43,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6369 Valid, 3626 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25779 states. [2025-02-05 17:43:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25779 to 17737. [2025-02-05 17:43:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17737 states, 17735 states have (on average 1.4322526078376092) internal successors, (25401), 17736 states have internal predecessors, (25401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17737 states to 17737 states and 25401 transitions. [2025-02-05 17:43:44,025 INFO L78 Accepts]: Start accepts. Automaton has 17737 states and 25401 transitions. Word has length 77 [2025-02-05 17:43:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:44,026 INFO L471 AbstractCegarLoop]: Abstraction has 17737 states and 25401 transitions. [2025-02-05 17:43:44,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand 17737 states and 25401 transitions. [2025-02-05 17:43:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 17:43:44,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:44,029 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] [2025-02-05 17:43:44,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:43:44,029 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:44,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:44,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1869555589, now seen corresponding path program 1 times [2025-02-05 17:43:44,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:44,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651862872] [2025-02-05 17:43:44,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:44,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:44,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 17:43:44,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 17:43:44,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:44,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 17:43:44,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:44,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651862872] [2025-02-05 17:43:44,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651862872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:44,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:44,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 17:43:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478996798] [2025-02-05 17:43:44,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:44,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 17:43:44,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:44,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 17:43:44,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:43:44,310 INFO L87 Difference]: Start difference. First operand 17737 states and 25401 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:44,984 INFO L93 Difference]: Finished difference Result 31701 states and 45343 transitions. [2025-02-05 17:43:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:43:44,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 77 [2025-02-05 17:43:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:45,023 INFO L225 Difference]: With dead ends: 31701 [2025-02-05 17:43:45,024 INFO L226 Difference]: Without dead ends: 28739 [2025-02-05 17:43:45,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 17:43:45,033 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 6325 mSDsluCounter, 2085 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6325 SdHoareTripleChecker+Valid, 3686 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:45,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6325 Valid, 3686 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:43:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28739 states. [2025-02-05 17:43:45,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28739 to 20697. [2025-02-05 17:43:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20697 states, 20695 states have (on average 1.4291857936699686) internal successors, (29577), 20696 states have internal predecessors, (29577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20697 states to 20697 states and 29577 transitions. [2025-02-05 17:43:45,456 INFO L78 Accepts]: Start accepts. Automaton has 20697 states and 29577 transitions. Word has length 77 [2025-02-05 17:43:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:45,457 INFO L471 AbstractCegarLoop]: Abstraction has 20697 states and 29577 transitions. [2025-02-05 17:43:45,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20697 states and 29577 transitions. [2025-02-05 17:43:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 17:43:45,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:45,461 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 17:43:45,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:43:45,461 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:45,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:45,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1735618441, now seen corresponding path program 1 times [2025-02-05 17:43:45,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:45,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773767707] [2025-02-05 17:43:45,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:45,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:45,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 17:43:45,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 17:43:45,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:45,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:45,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:45,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773767707] [2025-02-05 17:43:45,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773767707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:45,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:45,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:45,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3491499] [2025-02-05 17:43:45,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:45,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:45,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:45,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:45,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:45,694 INFO L87 Difference]: Start difference. First operand 20697 states and 29577 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:46,203 INFO L93 Difference]: Finished difference Result 39101 states and 55563 transitions. [2025-02-05 17:43:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 17:43:46,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:46,226 INFO L225 Difference]: With dead ends: 39101 [2025-02-05 17:43:46,226 INFO L226 Difference]: Without dead ends: 20699 [2025-02-05 17:43:46,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:46,242 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 45 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:46,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20699 states. [2025-02-05 17:43:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20699 to 20697. [2025-02-05 17:43:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20697 states, 20695 states have (on average 1.4148828219376661) internal successors, (29281), 20696 states have internal predecessors, (29281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20697 states to 20697 states and 29281 transitions. [2025-02-05 17:43:46,660 INFO L78 Accepts]: Start accepts. Automaton has 20697 states and 29281 transitions. Word has length 78 [2025-02-05 17:43:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:46,660 INFO L471 AbstractCegarLoop]: Abstraction has 20697 states and 29281 transitions. [2025-02-05 17:43:46,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 20697 states and 29281 transitions. [2025-02-05 17:43:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:43:46,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:46,662 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:43:46,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:43:46,662 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:46,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash -783999357, now seen corresponding path program 1 times [2025-02-05 17:43:46,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:46,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263657096] [2025-02-05 17:43:46,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:46,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:46,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:43:46,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:43:46,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:46,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:46,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:46,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263657096] [2025-02-05 17:43:46,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263657096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:46,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:46,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:46,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567432459] [2025-02-05 17:43:46,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:46,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:46,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:46,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:46,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:46,762 INFO L87 Difference]: Start difference. First operand 20697 states and 29281 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:46,877 INFO L93 Difference]: Finished difference Result 27584 states and 38975 transitions. [2025-02-05 17:43:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:46,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-02-05 17:43:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:46,888 INFO L225 Difference]: With dead ends: 27584 [2025-02-05 17:43:46,888 INFO L226 Difference]: Without dead ends: 9182 [2025-02-05 17:43:46,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:46,900 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 39 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:46,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3105 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9182 states. [2025-02-05 17:43:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9182 to 9174. [2025-02-05 17:43:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9174 states, 9172 states have (on average 1.4363279546445704) internal successors, (13174), 9173 states have internal predecessors, (13174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9174 states to 9174 states and 13174 transitions. [2025-02-05 17:43:47,025 INFO L78 Accepts]: Start accepts. Automaton has 9174 states and 13174 transitions. Word has length 79 [2025-02-05 17:43:47,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:47,025 INFO L471 AbstractCegarLoop]: Abstraction has 9174 states and 13174 transitions. [2025-02-05 17:43:47,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 9174 states and 13174 transitions. [2025-02-05 17:43:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:43:47,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:47,027 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] [2025-02-05 17:43:47,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:43:47,028 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:47,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:47,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1691147440, now seen corresponding path program 1 times [2025-02-05 17:43:47,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:47,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552580365] [2025-02-05 17:43:47,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:47,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:47,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:43:47,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:43:47,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:47,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:47,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:47,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552580365] [2025-02-05 17:43:47,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552580365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:47,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:47,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:47,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218185083] [2025-02-05 17:43:47,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:47,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:47,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:47,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:47,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:47,091 INFO L87 Difference]: Start difference. First operand 9174 states and 13174 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:47,215 INFO L93 Difference]: Finished difference Result 12610 states and 17960 transitions. [2025-02-05 17:43:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:47,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-02-05 17:43:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:47,228 INFO L225 Difference]: With dead ends: 12610 [2025-02-05 17:43:47,228 INFO L226 Difference]: Without dead ends: 5744 [2025-02-05 17:43:47,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:47,242 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 41 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:47,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3084 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2025-02-05 17:43:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 5742. [2025-02-05 17:43:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5742 states, 5740 states have (on average 1.4526132404181185) internal successors, (8338), 5741 states have internal predecessors, (8338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5742 states to 5742 states and 8338 transitions. [2025-02-05 17:43:47,436 INFO L78 Accepts]: Start accepts. Automaton has 5742 states and 8338 transitions. Word has length 80 [2025-02-05 17:43:47,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:47,436 INFO L471 AbstractCegarLoop]: Abstraction has 5742 states and 8338 transitions. [2025-02-05 17:43:47,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 5742 states and 8338 transitions. [2025-02-05 17:43:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 17:43:47,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:47,437 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:47,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:43:47,439 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:47,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:47,439 INFO L85 PathProgramCache]: Analyzing trace with hash 234523383, now seen corresponding path program 1 times [2025-02-05 17:43:47,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:47,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948704649] [2025-02-05 17:43:47,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:47,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:47,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 17:43:47,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 17:43:47,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:47,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:47,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:47,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948704649] [2025-02-05 17:43:47,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948704649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:47,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:47,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:47,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109970454] [2025-02-05 17:43:47,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:47,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:47,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:47,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:47,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:47,495 INFO L87 Difference]: Start difference. First operand 5742 states and 8338 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:47,533 INFO L93 Difference]: Finished difference Result 7462 states and 10706 transitions. [2025-02-05 17:43:47,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:47,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-05 17:43:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:47,538 INFO L225 Difference]: With dead ends: 7462 [2025-02-05 17:43:47,538 INFO L226 Difference]: Without dead ends: 4028 [2025-02-05 17:43:47,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:47,542 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 38 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:47,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3069 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2025-02-05 17:43:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 4026. [2025-02-05 17:43:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4026 states, 4024 states have (on average 1.4776341948310139) internal successors, (5946), 4025 states have internal predecessors, (5946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4026 states to 4026 states and 5946 transitions. [2025-02-05 17:43:47,586 INFO L78 Accepts]: Start accepts. Automaton has 4026 states and 5946 transitions. Word has length 82 [2025-02-05 17:43:47,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:47,586 INFO L471 AbstractCegarLoop]: Abstraction has 4026 states and 5946 transitions. [2025-02-05 17:43:47,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 4026 states and 5946 transitions. [2025-02-05 17:43:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:43:47,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:47,588 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:43:47,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:43:47,588 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:47,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1533089186, now seen corresponding path program 1 times [2025-02-05 17:43:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157681565] [2025-02-05 17:43:47,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:47,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:47,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:43:47,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:43:47,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:47,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:47,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:47,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157681565] [2025-02-05 17:43:47,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157681565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:43:47,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:43:47,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:43:47,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568859967] [2025-02-05 17:43:47,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:43:47,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:43:47,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:47,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:43:47,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:47,644 INFO L87 Difference]: Start difference. First operand 4026 states and 5946 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:47,670 INFO L93 Difference]: Finished difference Result 4888 states and 7118 transitions. [2025-02-05 17:43:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:43:47,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-02-05 17:43:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:47,676 INFO L225 Difference]: With dead ends: 4888 [2025-02-05 17:43:47,677 INFO L226 Difference]: Without dead ends: 3170 [2025-02-05 17:43:47,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:43:47,680 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 35 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3054 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:47,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3054 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:43:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2025-02-05 17:43:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3168. [2025-02-05 17:43:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3168 states, 3166 states have (on average 1.5044219835754895) internal successors, (4763), 3167 states have internal predecessors, (4763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 4763 transitions. [2025-02-05 17:43:47,714 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 4763 transitions. Word has length 84 [2025-02-05 17:43:47,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:47,715 INFO L471 AbstractCegarLoop]: Abstraction has 3168 states and 4763 transitions. [2025-02-05 17:43:47,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 4763 transitions. [2025-02-05 17:43:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 17:43:47,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:47,716 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:43:47,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:43:47,717 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:47,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:47,717 INFO L85 PathProgramCache]: Analyzing trace with hash 296643301, now seen corresponding path program 1 times [2025-02-05 17:43:47,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:47,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530585632] [2025-02-05 17:43:47,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:47,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:47,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 17:43:47,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 17:43:47,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:47,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:48,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:48,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530585632] [2025-02-05 17:43:48,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530585632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:43:48,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791541795] [2025-02-05 17:43:48,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:48,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:48,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:48,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:43:48,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:43:48,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 17:43:48,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 17:43:48,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:48,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:48,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:43:48,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:48,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:49,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791541795] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:49,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:49,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-02-05 17:43:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576422518] [2025-02-05 17:43:49,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:49,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 17:43:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:49,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 17:43:49,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-02-05 17:43:49,608 INFO L87 Difference]: Start difference. First operand 3168 states and 4763 transitions. Second operand has 28 states, 28 states have (on average 8.0) internal successors, (224), 27 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:52,086 INFO L93 Difference]: Finished difference Result 7498 states and 10646 transitions. [2025-02-05 17:43:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-05 17:43:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.0) internal successors, (224), 27 states have internal predecessors, (224), 0 states have call successors, (0), 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 86 [2025-02-05 17:43:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:52,094 INFO L225 Difference]: With dead ends: 7498 [2025-02-05 17:43:52,095 INFO L226 Difference]: Without dead ends: 6638 [2025-02-05 17:43:52,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=986, Invalid=4270, Unknown=0, NotChecked=0, Total=5256 [2025-02-05 17:43:52,097 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 19137 mSDsluCounter, 5295 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19137 SdHoareTripleChecker+Valid, 6803 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:52,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19137 Valid, 6803 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:43:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2025-02-05 17:43:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6522. [2025-02-05 17:43:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6522 states, 6520 states have (on average 1.4124233128834356) internal successors, (9209), 6521 states have internal predecessors, (9209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6522 states to 6522 states and 9209 transitions. [2025-02-05 17:43:52,212 INFO L78 Accepts]: Start accepts. Automaton has 6522 states and 9209 transitions. Word has length 86 [2025-02-05 17:43:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:52,212 INFO L471 AbstractCegarLoop]: Abstraction has 6522 states and 9209 transitions. [2025-02-05 17:43:52,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.0) internal successors, (224), 27 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 6522 states and 9209 transitions. [2025-02-05 17:43:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 17:43:52,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:52,213 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:52,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:43:52,417 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,SelfDestructingSolverStorable22 [2025-02-05 17:43:52,418 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:52,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:52,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1562871412, now seen corresponding path program 1 times [2025-02-05 17:43:52,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:52,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341504516] [2025-02-05 17:43:52,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:52,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:52,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 17:43:52,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 17:43:52,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:52,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:52,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:52,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341504516] [2025-02-05 17:43:52,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341504516] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:43:52,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358163688] [2025-02-05 17:43:52,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:52,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:52,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:52,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:43:52,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:43:52,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 17:43:52,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 17:43:52,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:52,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:52,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 17:43:52,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:53,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358163688] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:54,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:54,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 31 [2025-02-05 17:43:54,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377511947] [2025-02-05 17:43:54,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:54,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 17:43:54,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:54,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 17:43:54,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2025-02-05 17:43:54,010 INFO L87 Difference]: Start difference. First operand 6522 states and 9209 transitions. Second operand has 32 states, 32 states have (on average 7.34375) internal successors, (235), 31 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:55,475 INFO L93 Difference]: Finished difference Result 19952 states and 27117 transitions. [2025-02-05 17:43:55,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-05 17:43:55,476 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.34375) internal successors, (235), 31 states have internal predecessors, (235), 0 states have call successors, (0), 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 87 [2025-02-05 17:43:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:55,489 INFO L225 Difference]: With dead ends: 19952 [2025-02-05 17:43:55,489 INFO L226 Difference]: Without dead ends: 15738 [2025-02-05 17:43:55,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=877, Invalid=3155, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 17:43:55,494 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 20563 mSDsluCounter, 8185 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20563 SdHoareTripleChecker+Valid, 9721 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:55,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20563 Valid, 9721 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:43:55,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15738 states. [2025-02-05 17:43:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15738 to 15648. [2025-02-05 17:43:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15648 states, 15646 states have (on average 1.3397034385785505) internal successors, (20961), 15647 states have internal predecessors, (20961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15648 states to 15648 states and 20961 transitions. [2025-02-05 17:43:55,869 INFO L78 Accepts]: Start accepts. Automaton has 15648 states and 20961 transitions. Word has length 87 [2025-02-05 17:43:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:55,869 INFO L471 AbstractCegarLoop]: Abstraction has 15648 states and 20961 transitions. [2025-02-05 17:43:55,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.34375) internal successors, (235), 31 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 15648 states and 20961 transitions. [2025-02-05 17:43:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 17:43:55,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:55,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:55,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 17:43:56,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:56,072 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:56,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1347305649, now seen corresponding path program 1 times [2025-02-05 17:43:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:56,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490976219] [2025-02-05 17:43:56,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:56,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:56,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:43:56,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:43:56,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:56,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:56,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:56,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:56,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490976219] [2025-02-05 17:43:56,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490976219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:43:56,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209865234] [2025-02-05 17:43:56,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:56,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:56,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:56,295 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:43:56,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:43:56,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:43:56,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:43:56,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:56,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:56,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:43:56,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:56,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209865234] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:57,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:57,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-02-05 17:43:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319689888] [2025-02-05 17:43:57,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:57,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 17:43:57,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:57,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 17:43:57,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-02-05 17:43:57,449 INFO L87 Difference]: Start difference. First operand 15648 states and 20961 transitions. Second operand has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 22 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:43:58,242 INFO L93 Difference]: Finished difference Result 29460 states and 39021 transitions. [2025-02-05 17:43:58,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 17:43:58,243 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 22 states have internal predecessors, (217), 0 states have call successors, (0), 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 89 [2025-02-05 17:43:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:43:58,256 INFO L225 Difference]: With dead ends: 29460 [2025-02-05 17:43:58,256 INFO L226 Difference]: Without dead ends: 16120 [2025-02-05 17:43:58,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 17:43:58,261 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 10607 mSDsluCounter, 6380 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10607 SdHoareTripleChecker+Valid, 7897 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:43:58,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10607 Valid, 7897 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:43:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16120 states. [2025-02-05 17:43:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16120 to 13698. [2025-02-05 17:43:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13698 states, 13696 states have (on average 1.3377628504672898) internal successors, (18322), 13697 states have internal predecessors, (18322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13698 states to 13698 states and 18322 transitions. [2025-02-05 17:43:58,544 INFO L78 Accepts]: Start accepts. Automaton has 13698 states and 18322 transitions. Word has length 89 [2025-02-05 17:43:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:43:58,544 INFO L471 AbstractCegarLoop]: Abstraction has 13698 states and 18322 transitions. [2025-02-05 17:43:58,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 22 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:43:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 13698 states and 18322 transitions. [2025-02-05 17:43:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 17:43:58,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:43:58,546 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:43:58,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 17:43:58,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:58,750 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:43:58,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:43:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1256237073, now seen corresponding path program 1 times [2025-02-05 17:43:58,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:43:58,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161768206] [2025-02-05 17:43:58,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:43:58,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:43:58,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:43:58,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:58,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:58,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:43:58,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161768206] [2025-02-05 17:43:58,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161768206] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:43:58,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637646255] [2025-02-05 17:43:58,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:43:58,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:43:58,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:43:58,969 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:43:58,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 17:43:59,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 17:43:59,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 17:43:59,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:43:59,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:43:59,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:43:59,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:43:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:59,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:43:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:43:59,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637646255] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:43:59,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:43:59,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-02-05 17:43:59,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653461258] [2025-02-05 17:43:59,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:43:59,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 17:43:59,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:43:59,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 17:43:59,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-02-05 17:43:59,972 INFO L87 Difference]: Start difference. First operand 13698 states and 18322 transitions. Second operand has 22 states, 22 states have (on average 8.5) internal successors, (187), 21 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-02-05 17:44:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:00,717 INFO L93 Difference]: Finished difference Result 36480 states and 47757 transitions. [2025-02-05 17:44:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 17:44:00,717 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.5) internal successors, (187), 21 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 89 [2025-02-05 17:44:00,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:00,739 INFO L225 Difference]: With dead ends: 36480 [2025-02-05 17:44:00,739 INFO L226 Difference]: Without dead ends: 25090 [2025-02-05 17:44:00,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2025-02-05 17:44:00,746 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 15279 mSDsluCounter, 4817 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15279 SdHoareTripleChecker+Valid, 6331 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:00,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15279 Valid, 6331 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:44:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25090 states. [2025-02-05 17:44:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25090 to 25086. [2025-02-05 17:44:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25086 states, 25084 states have (on average 1.3108754584595759) internal successors, (32882), 25085 states have internal predecessors, (32882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25086 states to 25086 states and 32882 transitions. [2025-02-05 17:44:01,384 INFO L78 Accepts]: Start accepts. Automaton has 25086 states and 32882 transitions. Word has length 89 [2025-02-05 17:44:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:01,385 INFO L471 AbstractCegarLoop]: Abstraction has 25086 states and 32882 transitions. [2025-02-05 17:44:01,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.5) internal successors, (187), 21 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-02-05 17:44:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 25086 states and 32882 transitions. [2025-02-05 17:44:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:44:01,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:01,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:01,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 17:44:01,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 17:44:01,588 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:01,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1917138110, now seen corresponding path program 1 times [2025-02-05 17:44:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735962456] [2025-02-05 17:44:01,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:01,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:44:01,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:44:01,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:01,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:02,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:02,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735962456] [2025-02-05 17:44:02,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735962456] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:44:02,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603697509] [2025-02-05 17:44:02,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:02,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:44:02,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:44:02,147 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:44:02,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 17:44:02,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:44:02,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:44:02,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:02,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:02,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 17:44:02,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:44:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:02,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:44:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603697509] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:44:04,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:44:04,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-02-05 17:44:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584727968] [2025-02-05 17:44:04,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:44:04,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 17:44:04,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:04,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 17:44:04,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 17:44:04,054 INFO L87 Difference]: Start difference. First operand 25086 states and 32882 transitions. Second operand has 36 states, 36 states have (on average 7.055555555555555) internal successors, (254), 36 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:10,613 INFO L93 Difference]: Finished difference Result 70066 states and 89975 transitions. [2025-02-05 17:44:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-02-05 17:44:10,614 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 7.055555555555555) internal successors, (254), 36 states have internal predecessors, (254), 0 states have call successors, (0), 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 90 [2025-02-05 17:44:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:10,667 INFO L225 Difference]: With dead ends: 70066 [2025-02-05 17:44:10,667 INFO L226 Difference]: Without dead ends: 59552 [2025-02-05 17:44:10,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1793, Invalid=7713, Unknown=0, NotChecked=0, Total=9506 [2025-02-05 17:44:10,679 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 16820 mSDsluCounter, 25146 mSDsCounter, 0 mSdLazyCounter, 2483 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16820 SdHoareTripleChecker+Valid, 26683 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:10,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16820 Valid, 26683 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2483 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 17:44:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59552 states. [2025-02-05 17:44:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59552 to 36702. [2025-02-05 17:44:11,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36702 states, 36700 states have (on average 1.2909536784741145) internal successors, (47378), 36701 states have internal predecessors, (47378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36702 states to 36702 states and 47378 transitions. [2025-02-05 17:44:12,023 INFO L78 Accepts]: Start accepts. Automaton has 36702 states and 47378 transitions. Word has length 90 [2025-02-05 17:44:12,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:12,024 INFO L471 AbstractCegarLoop]: Abstraction has 36702 states and 47378 transitions. [2025-02-05 17:44:12,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.055555555555555) internal successors, (254), 36 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 36702 states and 47378 transitions. [2025-02-05 17:44:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:44:12,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:12,026 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:44:12,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 17:44:12,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-05 17:44:12,227 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:12,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1370659710, now seen corresponding path program 1 times [2025-02-05 17:44:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056403095] [2025-02-05 17:44:12,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:12,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:12,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:44:12,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:44:12,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:12,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:12,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:12,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056403095] [2025-02-05 17:44:12,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056403095] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:44:12,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136732313] [2025-02-05 17:44:12,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:12,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:44:12,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:44:12,771 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:44:12,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 17:44:12,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:44:12,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:44:12,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:12,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:12,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 17:44:12,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:44:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:13,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:44:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:14,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136732313] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:44:14,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:44:14,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-02-05 17:44:14,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670931147] [2025-02-05 17:44:14,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:44:14,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 17:44:14,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:14,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 17:44:14,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 17:44:14,459 INFO L87 Difference]: Start difference. First operand 36702 states and 47378 transitions. Second operand has 35 states, 35 states have (on average 6.514285714285714) internal successors, (228), 35 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:44:21,034 INFO L93 Difference]: Finished difference Result 99716 states and 127859 transitions. [2025-02-05 17:44:21,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-02-05 17:44:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.514285714285714) internal successors, (228), 35 states have internal predecessors, (228), 0 states have call successors, (0), 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 90 [2025-02-05 17:44:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:44:21,106 INFO L225 Difference]: With dead ends: 99716 [2025-02-05 17:44:21,107 INFO L226 Difference]: Without dead ends: 81138 [2025-02-05 17:44:21,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2358 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1721, Invalid=7021, Unknown=0, NotChecked=0, Total=8742 [2025-02-05 17:44:21,140 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 16116 mSDsluCounter, 26876 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16116 SdHoareTripleChecker+Valid, 28443 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:44:21,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16116 Valid, 28443 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 17:44:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81138 states. [2025-02-05 17:44:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81138 to 30982. [2025-02-05 17:44:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30982 states, 30980 states have (on average 1.289864428663654) internal successors, (39960), 30981 states have internal predecessors, (39960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30982 states to 30982 states and 39960 transitions. [2025-02-05 17:44:22,589 INFO L78 Accepts]: Start accepts. Automaton has 30982 states and 39960 transitions. Word has length 90 [2025-02-05 17:44:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:44:22,590 INFO L471 AbstractCegarLoop]: Abstraction has 30982 states and 39960 transitions. [2025-02-05 17:44:22,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.514285714285714) internal successors, (228), 35 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:44:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 30982 states and 39960 transitions. [2025-02-05 17:44:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:44:22,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:44:22,592 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:44:22,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 17:44:22,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-05 17:44:22,792 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:44:22,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:44:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1148870158, now seen corresponding path program 1 times [2025-02-05 17:44:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:44:22,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717567519] [2025-02-05 17:44:22,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:22,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:44:22,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:44:22,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:44:22,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:22,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:44:24,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:44:24,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717567519] [2025-02-05 17:44:24,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717567519] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:44:24,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730632493] [2025-02-05 17:44:24,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:44:24,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:44:24,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:44:24,697 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:44:24,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 17:44:24,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:44:24,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:44:24,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:44:24,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:44:24,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:44:24,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:44:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:44:24,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:44:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:44:25,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730632493] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:44:25,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:44:25,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 6, 4] total 35 [2025-02-05 17:44:25,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757306306] [2025-02-05 17:44:25,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:44:25,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 17:44:25,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:44:25,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 17:44:25,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 17:44:25,146 INFO L87 Difference]: Start difference. First operand 30982 states and 39960 transitions. Second operand has 35 states, 35 states have (on average 7.314285714285714) internal successors, (256), 35 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)