./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label13.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/eca-rers2012/Problem12_label13.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 152d7fbf05854462a33897c88f7cf73fa78514058a292c6dd4eaf2d74f1b44e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:35:58,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:35:58,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:35:58,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:35:58,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:35:58,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:35:58,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:35:58,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:35:58,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:35:58,597 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:35:58,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:35:58,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:35:58,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:35:58,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:35:58,598 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:35:58,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:35:58,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:35:58,599 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:35:58,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:35:58,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:35:58,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:35:58,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:35:58,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:35:58,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:35:58,600 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:35:58,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:35:58,600 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:35:58,600 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:35:58,600 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:35:58,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:35:58,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:35:58,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:35:58,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:35:58,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:35:58,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:35:58,601 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:35:58,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:35:58,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:35:58,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:35:58,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:35:58,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:35:58,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:35:58,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:35:58,602 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 -> 152d7fbf05854462a33897c88f7cf73fa78514058a292c6dd4eaf2d74f1b44e9 [2025-02-05 11:35:58,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:35:58,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:35:58,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:35:58,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:35:58,909 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:35:58,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label13.c [2025-02-05 11:36:00,234 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35fae297f/333ef4bb55be4f5a80df73c1f0943c25/FLAG32a5dde99 [2025-02-05 11:36:00,839 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:36:00,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label13.c [2025-02-05 11:36:00,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35fae297f/333ef4bb55be4f5a80df73c1f0943c25/FLAG32a5dde99 [2025-02-05 11:36:00,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35fae297f/333ef4bb55be4f5a80df73c1f0943c25 [2025-02-05 11:36:00,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:36:00,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:36:00,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:36:00,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:36:00,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:36:00,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:36:00" (1/1) ... [2025-02-05 11:36:00,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f1b6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:00, skipping insertion in model container [2025-02-05 11:36:00,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:36:00" (1/1) ... [2025-02-05 11:36:01,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:36:01,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label13.c[3765,3778] [2025-02-05 11:36:01,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:36:01,828 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:36:01,845 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label13.c[3765,3778] [2025-02-05 11:36:02,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:36:02,167 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:36:02,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02 WrapperNode [2025-02-05 11:36:02,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:36:02,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:36:02,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:36:02,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:36:02,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (1/1) ... [2025-02-05 11:36:02,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (1/1) ... [2025-02-05 11:36:02,550 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-02-05 11:36:02,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:36:02,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:36:02,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:36:02,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:36:02,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (1/1) ... [2025-02-05 11:36:02,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (1/1) ... [2025-02-05 11:36:02,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (1/1) ... [2025-02-05 11:36:02,767 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 11:36:02,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (1/1) ... [2025-02-05 11:36:02,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (1/1) ... [2025-02-05 11:36:02,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (1/1) ... [2025-02-05 11:36:03,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (1/1) ... [2025-02-05 11:36:03,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (1/1) ... [2025-02-05 11:36:03,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (1/1) ... [2025-02-05 11:36:03,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:36:03,113 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:36:03,114 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:36:03,114 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:36:03,116 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (1/1) ... [2025-02-05 11:36:03,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:36:03,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:36:03,150 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 11:36:03,154 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 11:36:03,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:36:03,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:36:03,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:36:03,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:36:03,250 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:36:03,252 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:36:07,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:36:07,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-02-05 11:36:07,862 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:36:08,104 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-02-05 11:36:08,105 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:36:08,139 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:36:08,140 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:36:08,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:08 BoogieIcfgContainer [2025-02-05 11:36:08,140 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:36:08,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:36:08,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:36:08,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:36:08,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:36:00" (1/3) ... [2025-02-05 11:36:08,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5b521d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:36:08, skipping insertion in model container [2025-02-05 11:36:08,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:36:02" (2/3) ... [2025-02-05 11:36:08,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5b521d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:36:08, skipping insertion in model container [2025-02-05 11:36:08,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:36:08" (3/3) ... [2025-02-05 11:36:08,150 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label13.c [2025-02-05 11:36:08,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:36:08,165 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label13.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:36:08,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:36:08,267 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;@7711c99d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:36:08,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:36:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 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 11:36:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 11:36:08,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:08,284 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] [2025-02-05 11:36:08,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:08,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash -448705891, now seen corresponding path program 1 times [2025-02-05 11:36:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781014460] [2025-02-05 11:36:08,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:08,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:08,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 11:36:08,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 11:36:08,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:08,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:08,598 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 11:36:08,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:08,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781014460] [2025-02-05 11:36:08,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781014460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:08,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:08,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:36:08,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818944781] [2025-02-05 11:36:08,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:08,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:08,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:08,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:08,626 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 11:36:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:12,330 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-02-05 11:36:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:12,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-05 11:36:12,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:12,359 INFO L225 Difference]: With dead ends: 2388 [2025-02-05 11:36:12,359 INFO L226 Difference]: Without dead ends: 1506 [2025-02-05 11:36:12,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:12,368 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 831 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:12,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 102 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 11:36:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-02-05 11:36:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-02-05 11:36:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.869767441860465) internal successors, (2814), 1505 states have internal predecessors, (2814), 0 states have call successors, (0), 0 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 11:36:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2814 transitions. [2025-02-05 11:36:12,499 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2814 transitions. Word has length 28 [2025-02-05 11:36:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:12,500 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2814 transitions. [2025-02-05 11:36:12,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 11:36:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2814 transitions. [2025-02-05 11:36:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 11:36:12,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:12,503 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:12,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:36:12,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:12,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:12,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1925244388, now seen corresponding path program 1 times [2025-02-05 11:36:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:12,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038010333] [2025-02-05 11:36:12,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:12,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:12,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 11:36:12,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 11:36:12,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:12,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:36:13,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:13,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038010333] [2025-02-05 11:36:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038010333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:13,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:13,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:13,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513262859] [2025-02-05 11:36:13,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:13,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:36:13,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:13,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:36:13,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:36:13,022 INFO L87 Difference]: Start difference. First operand 1506 states and 2814 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 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 11:36:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:17,859 INFO L93 Difference]: Finished difference Result 5271 states and 9820 transitions. [2025-02-05 11:36:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:36:17,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-02-05 11:36:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:17,876 INFO L225 Difference]: With dead ends: 5271 [2025-02-05 11:36:17,877 INFO L226 Difference]: Without dead ends: 3767 [2025-02-05 11:36:17,880 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 11:36:17,882 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 2294 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 5147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1535 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:17,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2294 Valid, 201 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1535 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-05 11:36:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2025-02-05 11:36:17,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3759. [2025-02-05 11:36:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.611761575306014) internal successors, (6057), 3758 states have internal predecessors, (6057), 0 states have call successors, (0), 0 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 11:36:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 6057 transitions. [2025-02-05 11:36:17,964 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 6057 transitions. Word has length 101 [2025-02-05 11:36:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:17,964 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 6057 transitions. [2025-02-05 11:36:17,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 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 11:36:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 6057 transitions. [2025-02-05 11:36:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 11:36:17,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:17,976 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:36:17,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:36:17,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:17,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2001459741, now seen corresponding path program 1 times [2025-02-05 11:36:17,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:17,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557578343] [2025-02-05 11:36:17,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:17,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:18,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 11:36:18,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 11:36:18,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:18,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:36:18,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:18,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557578343] [2025-02-05 11:36:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557578343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:18,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:18,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528271809] [2025-02-05 11:36:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:18,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:36:18,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:18,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:36:18,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:36:18,421 INFO L87 Difference]: Start difference. First operand 3759 states and 6057 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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 11:36:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:21,802 INFO L93 Difference]: Finished difference Result 10559 states and 17447 transitions. [2025-02-05 11:36:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:36:21,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2025-02-05 11:36:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:21,825 INFO L225 Difference]: With dead ends: 10559 [2025-02-05 11:36:21,826 INFO L226 Difference]: Without dead ends: 6765 [2025-02-05 11:36:21,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:36:21,831 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 704 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3109 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 3109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:21,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 710 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 3109 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:36:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6765 states. [2025-02-05 11:36:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6765 to 6763. [2025-02-05 11:36:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.3620230700976041) internal successors, (9210), 6762 states have internal predecessors, (9210), 0 states have call successors, (0), 0 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 11:36:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 9210 transitions. [2025-02-05 11:36:21,958 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 9210 transitions. Word has length 175 [2025-02-05 11:36:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:21,960 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 9210 transitions. [2025-02-05 11:36:21,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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 11:36:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 9210 transitions. [2025-02-05 11:36:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 11:36:21,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:21,964 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:36:21,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:36:21,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:21,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1892879988, now seen corresponding path program 1 times [2025-02-05 11:36:21,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:21,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055796401] [2025-02-05 11:36:21,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:21,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:22,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 11:36:22,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 11:36:22,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:22,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:36:22,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:22,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055796401] [2025-02-05 11:36:22,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055796401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:22,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:22,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:22,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103283923] [2025-02-05 11:36:22,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:22,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:22,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:22,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:22,297 INFO L87 Difference]: Start difference. First operand 6763 states and 9210 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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 11:36:24,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:24,862 INFO L93 Difference]: Finished difference Result 13524 states and 18418 transitions. [2025-02-05 11:36:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:24,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 245 [2025-02-05 11:36:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:24,898 INFO L225 Difference]: With dead ends: 13524 [2025-02-05 11:36:24,899 INFO L226 Difference]: Without dead ends: 6763 [2025-02-05 11:36:24,923 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 11:36:24,930 INFO L435 NwaCegarLoop]: 1075 mSDtfsCounter, 692 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:24,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1082 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:36:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-02-05 11:36:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2025-02-05 11:36:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.3040520556048507) internal successors, (8818), 6762 states have internal predecessors, (8818), 0 states have call successors, (0), 0 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 11:36:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 8818 transitions. [2025-02-05 11:36:25,088 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 8818 transitions. Word has length 245 [2025-02-05 11:36:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:25,090 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 8818 transitions. [2025-02-05 11:36:25,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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 11:36:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 8818 transitions. [2025-02-05 11:36:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-05 11:36:25,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:25,097 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:36:25,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:36:25,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:25,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:25,098 INFO L85 PathProgramCache]: Analyzing trace with hash -405555734, now seen corresponding path program 1 times [2025-02-05 11:36:25,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:25,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097762116] [2025-02-05 11:36:25,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:25,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:25,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-05 11:36:25,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 11:36:25,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:25,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:36:25,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:25,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097762116] [2025-02-05 11:36:25,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097762116] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:36:25,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397466175] [2025-02-05 11:36:25,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:25,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:36:25,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:36:25,592 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 11:36:25,594 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 11:36:25,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-05 11:36:25,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 11:36:25,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:25,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:25,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:36:25,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:36:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:36:25,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:36:25,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397466175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:25,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:36:25,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:36:25,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104720593] [2025-02-05 11:36:25,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:25,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:25,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:25,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:25,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:36:25,853 INFO L87 Difference]: Start difference. First operand 6763 states and 8818 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:28,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:28,610 INFO L93 Difference]: Finished difference Result 16528 states and 22425 transitions. [2025-02-05 11:36:28,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:28,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2025-02-05 11:36:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:28,638 INFO L225 Difference]: With dead ends: 16528 [2025-02-05 11:36:28,638 INFO L226 Difference]: Without dead ends: 9767 [2025-02-05 11:36:28,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:36:28,647 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 876 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2100 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:28,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 375 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2100 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:36:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-02-05 11:36:28,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-02-05 11:36:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.3089289371288142) internal successors, (12783), 9766 states have internal predecessors, (12783), 0 states have call successors, (0), 0 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 11:36:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12783 transitions. [2025-02-05 11:36:28,840 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12783 transitions. Word has length 249 [2025-02-05 11:36:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:28,841 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12783 transitions. [2025-02-05 11:36:28,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12783 transitions. [2025-02-05 11:36:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-05 11:36:28,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:28,845 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:36:28,854 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 11:36:29,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:36:29,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:29,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1294330790, now seen corresponding path program 1 times [2025-02-05 11:36:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861160677] [2025-02-05 11:36:29,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:29,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:29,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 11:36:29,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 11:36:29,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:29,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-05 11:36:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861160677] [2025-02-05 11:36:29,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861160677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:29,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:29,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:29,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472959206] [2025-02-05 11:36:29,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:29,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:29,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:29,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:29,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:29,337 INFO L87 Difference]: Start difference. First operand 9767 states and 12783 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:32,210 INFO L93 Difference]: Finished difference Result 27793 states and 36760 transitions. [2025-02-05 11:36:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:32,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2025-02-05 11:36:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:32,248 INFO L225 Difference]: With dead ends: 27793 [2025-02-05 11:36:32,249 INFO L226 Difference]: Without dead ends: 18028 [2025-02-05 11:36:32,261 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 11:36:32,263 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 726 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:32,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1394 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:36:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18028 states. [2025-02-05 11:36:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18028 to 18028. [2025-02-05 11:36:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18028 states, 18027 states have (on average 1.2131802296555168) internal successors, (21870), 18027 states have internal predecessors, (21870), 0 states have call successors, (0), 0 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 11:36:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18028 states to 18028 states and 21870 transitions. [2025-02-05 11:36:32,571 INFO L78 Accepts]: Start accepts. Automaton has 18028 states and 21870 transitions. Word has length 268 [2025-02-05 11:36:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:32,572 INFO L471 AbstractCegarLoop]: Abstraction has 18028 states and 21870 transitions. [2025-02-05 11:36:32,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 18028 states and 21870 transitions. [2025-02-05 11:36:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-02-05 11:36:32,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:32,578 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:36:32,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:36:32,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:32,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:32,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1571625402, now seen corresponding path program 1 times [2025-02-05 11:36:32,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:32,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392442079] [2025-02-05 11:36:32,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:32,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:32,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-02-05 11:36:32,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-02-05 11:36:32,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:32,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-02-05 11:36:32,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:32,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392442079] [2025-02-05 11:36:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392442079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:32,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:32,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:36:32,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024213721] [2025-02-05 11:36:32,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:32,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:32,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:32,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:32,806 INFO L87 Difference]: Start difference. First operand 18028 states and 21870 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:35,497 INFO L93 Difference]: Finished difference Result 42062 states and 51582 transitions. [2025-02-05 11:36:35,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:35,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2025-02-05 11:36:35,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:35,555 INFO L225 Difference]: With dead ends: 42062 [2025-02-05 11:36:35,555 INFO L226 Difference]: Without dead ends: 24036 [2025-02-05 11:36:35,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:35,574 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 696 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 814 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 814 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:35,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 434 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [814 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:36:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24036 states. [2025-02-05 11:36:35,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 23285. [2025-02-05 11:36:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.1537536505755024) internal successors, (26864), 23284 states have internal predecessors, (26864), 0 states have call successors, (0), 0 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 11:36:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 26864 transitions. [2025-02-05 11:36:35,852 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 26864 transitions. Word has length 289 [2025-02-05 11:36:35,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:35,853 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 26864 transitions. [2025-02-05 11:36:35,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 26864 transitions. [2025-02-05 11:36:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-02-05 11:36:35,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:35,859 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:36:35,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:36:35,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:35,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash -184611028, now seen corresponding path program 1 times [2025-02-05 11:36:35,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:35,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790484346] [2025-02-05 11:36:35,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:35,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:35,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-05 11:36:36,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-05 11:36:36,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:36,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 77 proven. 108 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-05 11:36:36,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:36,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790484346] [2025-02-05 11:36:36,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790484346] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:36:36,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532637178] [2025-02-05 11:36:36,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:36,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:36:36,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:36:36,486 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 11:36:36,489 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 11:36:36,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-05 11:36:36,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-05 11:36:36,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:36,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:36,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:36:36,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:36:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-05 11:36:37,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:36:37,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532637178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:37,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:36:37,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:36:37,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413907255] [2025-02-05 11:36:37,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:37,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:37,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:37,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:36:37,140 INFO L87 Difference]: Start difference. First operand 23285 states and 26864 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 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 11:36:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:39,660 INFO L93 Difference]: Finished difference Result 56331 states and 64569 transitions. [2025-02-05 11:36:39,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:39,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 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 368 [2025-02-05 11:36:39,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:39,714 INFO L225 Difference]: With dead ends: 56331 [2025-02-05 11:36:39,714 INFO L226 Difference]: Without dead ends: 33048 [2025-02-05 11:36:39,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:36:39,743 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 626 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:39,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 593 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:36:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33048 states. [2025-02-05 11:36:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33048 to 30044. [2025-02-05 11:36:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30044 states, 30043 states have (on average 1.137869054355424) internal successors, (34185), 30043 states have internal predecessors, (34185), 0 states have call successors, (0), 0 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 11:36:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30044 states to 30044 states and 34185 transitions. [2025-02-05 11:36:40,166 INFO L78 Accepts]: Start accepts. Automaton has 30044 states and 34185 transitions. Word has length 368 [2025-02-05 11:36:40,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:40,167 INFO L471 AbstractCegarLoop]: Abstraction has 30044 states and 34185 transitions. [2025-02-05 11:36:40,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 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 11:36:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 30044 states and 34185 transitions. [2025-02-05 11:36:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-05 11:36:40,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:40,175 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:40,183 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 11:36:40,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:36:40,377 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:40,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash 731758055, now seen corresponding path program 1 times [2025-02-05 11:36:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:40,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280495468] [2025-02-05 11:36:40,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:40,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:40,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-05 11:36:40,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-05 11:36:40,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:40,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 52 proven. 228 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-02-05 11:36:41,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:41,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280495468] [2025-02-05 11:36:41,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280495468] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:36:41,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462459522] [2025-02-05 11:36:41,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:41,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:36:41,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:36:41,088 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 11:36:41,091 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 11:36:41,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-05 11:36:41,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-05 11:36:41,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:41,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:41,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:36:41,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:36:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-05 11:36:41,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:36:41,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462459522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:41,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:36:41,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 11:36:41,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646169033] [2025-02-05 11:36:41,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:41,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:41,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:41,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:41,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:36:41,291 INFO L87 Difference]: Start difference. First operand 30044 states and 34185 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:43,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:43,698 INFO L93 Difference]: Finished difference Result 60086 states and 68368 transitions. [2025-02-05 11:36:43,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:43,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 378 [2025-02-05 11:36:43,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:43,734 INFO L225 Difference]: With dead ends: 60086 [2025-02-05 11:36:43,735 INFO L226 Difference]: Without dead ends: 30044 [2025-02-05 11:36:43,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:36:43,758 INFO L435 NwaCegarLoop]: 1180 mSDtfsCounter, 778 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:43,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 1188 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 2192 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:36:43,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30044 states. [2025-02-05 11:36:44,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30044 to 30044. [2025-02-05 11:36:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30044 states, 30043 states have (on average 1.1030190060912692) internal successors, (33138), 30043 states have internal predecessors, (33138), 0 states have call successors, (0), 0 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 11:36:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30044 states to 30044 states and 33138 transitions. [2025-02-05 11:36:44,179 INFO L78 Accepts]: Start accepts. Automaton has 30044 states and 33138 transitions. Word has length 378 [2025-02-05 11:36:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:44,179 INFO L471 AbstractCegarLoop]: Abstraction has 30044 states and 33138 transitions. [2025-02-05 11:36:44,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 30044 states and 33138 transitions. [2025-02-05 11:36:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-02-05 11:36:44,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:44,186 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:36:44,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 11:36:44,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:36:44,387 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:44,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1500244481, now seen corresponding path program 1 times [2025-02-05 11:36:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:44,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846192331] [2025-02-05 11:36:44,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:44,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 11:36:44,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 11:36:44,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:44,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 118 proven. 230 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 11:36:44,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:44,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846192331] [2025-02-05 11:36:44,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846192331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:36:44,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616758739] [2025-02-05 11:36:44,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:44,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:36:44,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:36:44,806 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 11:36:44,809 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 11:36:44,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 11:36:45,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 11:36:45,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:45,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:45,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:36:45,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:36:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-02-05 11:36:45,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:36:45,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616758739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:45,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:36:45,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 11:36:45,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857344774] [2025-02-05 11:36:45,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:45,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:45,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:45,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:45,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:36:45,263 INFO L87 Difference]: Start difference. First operand 30044 states and 33138 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:48,123 INFO L93 Difference]: Finished difference Result 78110 states and 86796 transitions. [2025-02-05 11:36:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:48,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 407 [2025-02-05 11:36:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:48,176 INFO L225 Difference]: With dead ends: 78110 [2025-02-05 11:36:48,176 INFO L226 Difference]: Without dead ends: 48068 [2025-02-05 11:36:48,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:36:48,206 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 664 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 718 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:48,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 1025 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [718 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:36:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48068 states. [2025-02-05 11:36:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48068 to 47317. [2025-02-05 11:36:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47317 states, 47316 states have (on average 1.1108081832783836) internal successors, (52559), 47316 states have internal predecessors, (52559), 0 states have call successors, (0), 0 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 11:36:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47317 states to 47317 states and 52559 transitions. [2025-02-05 11:36:48,778 INFO L78 Accepts]: Start accepts. Automaton has 47317 states and 52559 transitions. Word has length 407 [2025-02-05 11:36:48,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:48,779 INFO L471 AbstractCegarLoop]: Abstraction has 47317 states and 52559 transitions. [2025-02-05 11:36:48,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 47317 states and 52559 transitions. [2025-02-05 11:36:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-02-05 11:36:48,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:48,789 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:36:48,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 11:36:48,989 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,SelfDestructingSolverStorable9 [2025-02-05 11:36:48,990 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:48,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1428851325, now seen corresponding path program 1 times [2025-02-05 11:36:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:48,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116586726] [2025-02-05 11:36:48,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:49,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-05 11:36:49,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-05 11:36:49,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:49,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-05 11:36:49,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116586726] [2025-02-05 11:36:49,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116586726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:49,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:49,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:49,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633251765] [2025-02-05 11:36:49,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:49,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:49,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:49,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:49,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:49,273 INFO L87 Difference]: Start difference. First operand 47317 states and 52559 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:51,758 INFO L93 Difference]: Finished difference Result 97636 states and 108221 transitions. [2025-02-05 11:36:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:51,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 473 [2025-02-05 11:36:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:51,805 INFO L225 Difference]: With dead ends: 97636 [2025-02-05 11:36:51,805 INFO L226 Difference]: Without dead ends: 47317 [2025-02-05 11:36:51,831 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 11:36:51,831 INFO L435 NwaCegarLoop]: 1228 mSDtfsCounter, 703 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 2705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:51,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1235 Invalid, 2705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:36:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47317 states. [2025-02-05 11:36:52,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47317 to 45815. [2025-02-05 11:36:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45815 states, 45814 states have (on average 1.0815034705548523) internal successors, (49548), 45814 states have internal predecessors, (49548), 0 states have call successors, (0), 0 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 11:36:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45815 states to 45815 states and 49548 transitions. [2025-02-05 11:36:52,405 INFO L78 Accepts]: Start accepts. Automaton has 45815 states and 49548 transitions. Word has length 473 [2025-02-05 11:36:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:52,406 INFO L471 AbstractCegarLoop]: Abstraction has 45815 states and 49548 transitions. [2025-02-05 11:36:52,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:36:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 45815 states and 49548 transitions. [2025-02-05 11:36:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-02-05 11:36:52,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:52,414 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:52,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:36:52,415 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:52,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:52,415 INFO L85 PathProgramCache]: Analyzing trace with hash -656905387, now seen corresponding path program 1 times [2025-02-05 11:36:52,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:52,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906786587] [2025-02-05 11:36:52,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:52,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:52,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-02-05 11:36:52,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-02-05 11:36:52,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:52,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-05 11:36:52,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:52,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906786587] [2025-02-05 11:36:52,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906786587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:52,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:52,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:52,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613219671] [2025-02-05 11:36:52,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:52,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:52,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:52,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:52,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:52,587 INFO L87 Difference]: Start difference. First operand 45815 states and 49548 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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 11:36:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:55,700 INFO L93 Difference]: Finished difference Result 118664 states and 128705 transitions. [2025-02-05 11:36:55,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:55,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 475 [2025-02-05 11:36:55,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:55,778 INFO L225 Difference]: With dead ends: 118664 [2025-02-05 11:36:55,779 INFO L226 Difference]: Without dead ends: 73602 [2025-02-05 11:36:55,811 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 11:36:55,811 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 690 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 617 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 617 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:55,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 519 Invalid, 2902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [617 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:36:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73602 states. [2025-02-05 11:36:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73602 to 71349. [2025-02-05 11:36:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71349 states, 71348 states have (on average 1.0686214049447778) internal successors, (76244), 71348 states have internal predecessors, (76244), 0 states have call successors, (0), 0 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 11:36:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71349 states to 71349 states and 76244 transitions. [2025-02-05 11:36:56,672 INFO L78 Accepts]: Start accepts. Automaton has 71349 states and 76244 transitions. Word has length 475 [2025-02-05 11:36:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:56,673 INFO L471 AbstractCegarLoop]: Abstraction has 71349 states and 76244 transitions. [2025-02-05 11:36:56,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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 11:36:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 71349 states and 76244 transitions. [2025-02-05 11:36:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-02-05 11:36:56,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:56,680 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:36:56,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:36:56,680 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:56,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:56,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1537968271, now seen corresponding path program 1 times [2025-02-05 11:36:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:56,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976210610] [2025-02-05 11:36:56,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:56,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-02-05 11:36:56,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-02-05 11:36:56,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:56,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:56,854 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-02-05 11:36:56,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:56,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976210610] [2025-02-05 11:36:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976210610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:56,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:36:56,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:36:56,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450552736] [2025-02-05 11:36:56,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:56,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:56,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:56,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:56,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:36:56,857 INFO L87 Difference]: Start difference. First operand 71349 states and 76244 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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 11:36:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:59,494 INFO L93 Difference]: Finished difference Result 159218 states and 170394 transitions. [2025-02-05 11:36:59,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:59,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 502 [2025-02-05 11:36:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:59,587 INFO L225 Difference]: With dead ends: 159218 [2025-02-05 11:36:59,587 INFO L226 Difference]: Without dead ends: 88622 [2025-02-05 11:36:59,630 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 11:36:59,631 INFO L435 NwaCegarLoop]: 1290 mSDtfsCounter, 661 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:59,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1298 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:36:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88622 states. [2025-02-05 11:37:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88622 to 86369. [2025-02-05 11:37:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86369 states, 86368 states have (on average 1.0625463134494257) internal successors, (91770), 86368 states have internal predecessors, (91770), 0 states have call successors, (0), 0 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 11:37:00,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86369 states to 86369 states and 91770 transitions. [2025-02-05 11:37:00,681 INFO L78 Accepts]: Start accepts. Automaton has 86369 states and 91770 transitions. Word has length 502 [2025-02-05 11:37:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:37:00,682 INFO L471 AbstractCegarLoop]: Abstraction has 86369 states and 91770 transitions. [2025-02-05 11:37:00,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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 11:37:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 86369 states and 91770 transitions. [2025-02-05 11:37:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-02-05 11:37:00,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:37:00,694 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:37:00,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:37:00,695 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:37:00,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:37:00,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1023425713, now seen corresponding path program 1 times [2025-02-05 11:37:00,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:37:00,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305828593] [2025-02-05 11:37:00,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:00,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:37:00,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-02-05 11:37:00,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-02-05 11:37:00,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:00,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:37:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 597 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-02-05 11:37:01,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:37:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305828593] [2025-02-05 11:37:01,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305828593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:37:01,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:37:01,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:37:01,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702230784] [2025-02-05 11:37:01,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:37:01,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:37:01,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:37:01,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:37:01,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:37:01,085 INFO L87 Difference]: Start difference. First operand 86369 states and 91770 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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 11:37:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:37:03,664 INFO L93 Difference]: Finished difference Result 186254 states and 198031 transitions. [2025-02-05 11:37:03,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:37:03,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 502 [2025-02-05 11:37:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:37:03,770 INFO L225 Difference]: With dead ends: 186254 [2025-02-05 11:37:03,770 INFO L226 Difference]: Without dead ends: 100638 [2025-02-05 11:37:03,808 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 11:37:03,809 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 669 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 2344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:37:03,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1271 Invalid, 2344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 11:37:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100638 states. [2025-02-05 11:37:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100638 to 98385. [2025-02-05 11:37:04,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98385 states, 98384 states have (on average 1.0550292730525288) internal successors, (103798), 98384 states have internal predecessors, (103798), 0 states have call successors, (0), 0 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 11:37:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98385 states to 98385 states and 103798 transitions. [2025-02-05 11:37:04,651 INFO L78 Accepts]: Start accepts. Automaton has 98385 states and 103798 transitions. Word has length 502 [2025-02-05 11:37:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:37:04,651 INFO L471 AbstractCegarLoop]: Abstraction has 98385 states and 103798 transitions. [2025-02-05 11:37:04,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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 11:37:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 98385 states and 103798 transitions. [2025-02-05 11:37:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-02-05 11:37:04,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:37:04,662 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:37:04,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:37:04,662 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:37:04,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:37:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1160959054, now seen corresponding path program 1 times [2025-02-05 11:37:04,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:37:04,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821636611] [2025-02-05 11:37:04,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:37:04,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-02-05 11:37:04,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-02-05 11:37:04,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:04,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:37:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 833 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-05 11:37:05,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:37:05,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821636611] [2025-02-05 11:37:05,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821636611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:37:05,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:37:05,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:37:05,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338546434] [2025-02-05 11:37:05,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:37:05,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:37:05,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:37:05,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:37:05,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:37:05,193 INFO L87 Difference]: Start difference. First operand 98385 states and 103798 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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 11:37:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:37:08,030 INFO L93 Difference]: Finished difference Result 229812 states and 242859 transitions. [2025-02-05 11:37:08,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:37:08,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 604 [2025-02-05 11:37:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:37:08,191 INFO L225 Difference]: With dead ends: 229812 [2025-02-05 11:37:08,191 INFO L226 Difference]: Without dead ends: 132180 [2025-02-05 11:37:08,255 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 11:37:08,255 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 673 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 538 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 2940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 538 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:37:08,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 274 Invalid, 2940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [538 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:37:08,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132180 states. [2025-02-05 11:37:09,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132180 to 113405. [2025-02-05 11:37:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113405 states, 113404 states have (on average 1.0578021939261402) internal successors, (119959), 113404 states have internal predecessors, (119959), 0 states have call successors, (0), 0 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 11:37:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113405 states to 113405 states and 119959 transitions. [2025-02-05 11:37:09,612 INFO L78 Accepts]: Start accepts. Automaton has 113405 states and 119959 transitions. Word has length 604 [2025-02-05 11:37:09,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:37:09,612 INFO L471 AbstractCegarLoop]: Abstraction has 113405 states and 119959 transitions. [2025-02-05 11:37:09,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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 11:37:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 113405 states and 119959 transitions. [2025-02-05 11:37:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-02-05 11:37:09,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:37:09,625 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:37:09,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:37:09,625 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:37:09,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:37:09,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1581707928, now seen corresponding path program 1 times [2025-02-05 11:37:09,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:37:09,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109858355] [2025-02-05 11:37:09,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:37:09,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:37:09,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-02-05 11:37:09,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-02-05 11:37:09,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:37:09,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:37:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 716 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-02-05 11:37:10,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:37:10,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109858355] [2025-02-05 11:37:10,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109858355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:37:10,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:37:10,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:37:10,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662676186] [2025-02-05 11:37:10,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:37:10,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:37:10,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:37:10,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:37:10,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:37:10,199 INFO L87 Difference]: Start difference. First operand 113405 states and 119959 transitions. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 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 11:37:13,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:37:13,267 INFO L93 Difference]: Finished difference Result 243330 states and 257271 transitions. [2025-02-05 11:37:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:37:13,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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 632 [2025-02-05 11:37:13,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:37:13,414 INFO L225 Difference]: With dead ends: 243330 [2025-02-05 11:37:13,414 INFO L226 Difference]: Without dead ends: 130678 [2025-02-05 11:37:13,467 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 11:37:13,468 INFO L435 NwaCegarLoop]: 1212 mSDtfsCounter, 712 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:37:13,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1220 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:37:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130678 states.