./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.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/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.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 17ba764d4851428799f2c4794a4662e2753aae472d291b23839dac79bbfbab6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:14:12,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:14:12,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:14:12,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:14:12,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:14:12,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:14:12,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:14:12,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:14:12,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:14:12,182 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:14:12,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:14:12,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:14:12,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:14:12,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:14:12,184 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:14:12,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:14:12,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:14:12,184 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:14:12,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:14:12,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:14:12,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:14:12,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:14:12,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:14:12,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:14:12,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:14:12,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:14:12,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:14:12,186 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:14:12,186 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:14:12,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:14:12,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:14:12,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:14:12,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:14:12,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:14:12,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:14:12,187 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:14:12,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:14:12,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:14:12,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:14:12,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:14:12,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:14:12,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:14:12,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:14:12,188 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 -> 17ba764d4851428799f2c4794a4662e2753aae472d291b23839dac79bbfbab6d [2025-02-05 16:14:12,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:14:12,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:14:12,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:14:12,487 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:14:12,487 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:14:12,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2025-02-05 16:14:13,827 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5bf124b36/ba33e6447b3f414d8533304c5a775eff/FLAG4c45ee09e [2025-02-05 16:14:14,079 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:14:14,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2025-02-05 16:14:14,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5bf124b36/ba33e6447b3f414d8533304c5a775eff/FLAG4c45ee09e [2025-02-05 16:14:14,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5bf124b36/ba33e6447b3f414d8533304c5a775eff [2025-02-05 16:14:14,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:14:14,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:14:14,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:14:14,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:14:14,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:14:14,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644b0937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14, skipping insertion in model container [2025-02-05 16:14:14,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:14:14,321 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/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c[9392,9405] [2025-02-05 16:14:14,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:14:14,338 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:14:14,387 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/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c[9392,9405] [2025-02-05 16:14:14,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:14:14,401 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:14:14,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14 WrapperNode [2025-02-05 16:14:14,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:14:14,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:14:14,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:14:14,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:14:14,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,435 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 312 [2025-02-05 16:14:14,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:14:14,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:14:14,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:14:14,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:14:14,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,458 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 16:14:14,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:14:14,478 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:14:14,478 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:14:14,478 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:14:14,479 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (1/1) ... [2025-02-05 16:14:14,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:14:14,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:14,505 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 16:14:14,508 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 16:14:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:14:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:14:14,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:14:14,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:14:14,621 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:14:14,622 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:14:15,028 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-02-05 16:14:15,028 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:14:15,039 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:14:15,040 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:14:15,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:14:15 BoogieIcfgContainer [2025-02-05 16:14:15,040 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:14:15,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:14:15,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:14:15,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:14:15,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:14:14" (1/3) ... [2025-02-05 16:14:15,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb298c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:14:15, skipping insertion in model container [2025-02-05 16:14:15,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:14:14" (2/3) ... [2025-02-05 16:14:15,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb298c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:14:15, skipping insertion in model container [2025-02-05 16:14:15,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:14:15" (3/3) ... [2025-02-05 16:14:15,050 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2025-02-05 16:14:15,061 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:14:15,062 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c that has 1 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:14:15,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:14:15,129 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;@72b2366e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:14:15,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:14:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 81 states have (on average 1.728395061728395) internal successors, (140), 82 states have internal predecessors, (140), 0 states have call successors, (0), 0 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 16:14:15,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 16:14:15,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:15,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:15,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:15,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1607638684, now seen corresponding path program 1 times [2025-02-05 16:14:15,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174614417] [2025-02-05 16:14:15,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:15,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:15,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 16:14:15,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 16:14:15,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:15,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:15,364 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 16:14:15,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:15,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174614417] [2025-02-05 16:14:15,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174614417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:15,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:15,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:14:15,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892956007] [2025-02-05 16:14:15,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:15,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:14:15,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:15,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:14:15,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:14:15,389 INFO L87 Difference]: Start difference. First operand has 83 states, 81 states have (on average 1.728395061728395) internal successors, (140), 82 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 16:14:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:15,407 INFO L93 Difference]: Finished difference Result 137 states and 226 transitions. [2025-02-05 16:14:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:14:15,409 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-02-05 16:14:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:15,415 INFO L225 Difference]: With dead ends: 137 [2025-02-05 16:14:15,416 INFO L226 Difference]: Without dead ends: 80 [2025-02-05 16:14:15,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:14:15,420 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:15,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-05 16:14:15,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-05 16:14:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 79 states have internal predecessors, (135), 0 states have call successors, (0), 0 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 16:14:15,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 135 transitions. [2025-02-05 16:14:15,448 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 135 transitions. Word has length 29 [2025-02-05 16:14:15,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:15,448 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 135 transitions. [2025-02-05 16:14:15,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 16:14:15,449 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 135 transitions. [2025-02-05 16:14:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 16:14:15,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:15,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:15,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:14:15,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:15,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1674645437, now seen corresponding path program 1 times [2025-02-05 16:14:15,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:15,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215311541] [2025-02-05 16:14:15,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:15,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:15,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 16:14:15,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 16:14:15,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:15,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:15,696 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 16:14:15,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:15,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215311541] [2025-02-05 16:14:15,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215311541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:15,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:15,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:14:15,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078560332] [2025-02-05 16:14:15,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:15,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:14:15,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:15,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:14:15,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:14:15,699 INFO L87 Difference]: Start difference. First operand 80 states and 135 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 16:14:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:15,803 INFO L93 Difference]: Finished difference Result 184 states and 301 transitions. [2025-02-05 16:14:15,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:14:15,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-02-05 16:14:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:15,805 INFO L225 Difference]: With dead ends: 184 [2025-02-05 16:14:15,805 INFO L226 Difference]: Without dead ends: 130 [2025-02-05 16:14:15,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:14:15,806 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 80 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:15,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 494 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:14:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-05 16:14:15,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 80. [2025-02-05 16:14:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 0 states have call successors, (0), 0 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 16:14:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2025-02-05 16:14:15,814 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 29 [2025-02-05 16:14:15,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:15,814 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2025-02-05 16:14:15,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 16:14:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2025-02-05 16:14:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:14:15,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:15,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:15,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:14:15,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:15,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:15,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1404675940, now seen corresponding path program 1 times [2025-02-05 16:14:15,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:15,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174900399] [2025-02-05 16:14:15,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:15,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:15,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:14:15,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:14:15,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:15,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:15,953 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 16:14:15,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:15,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174900399] [2025-02-05 16:14:15,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174900399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:15,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:15,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:14:15,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082660914] [2025-02-05 16:14:15,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:15,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:14:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:15,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:14:15,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:15,955 INFO L87 Difference]: Start difference. First operand 80 states and 111 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 16:14:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:15,986 INFO L93 Difference]: Finished difference Result 172 states and 259 transitions. [2025-02-05 16:14:15,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:14:15,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-05 16:14:15,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:15,992 INFO L225 Difference]: With dead ends: 172 [2025-02-05 16:14:15,992 INFO L226 Difference]: Without dead ends: 122 [2025-02-05 16:14:15,992 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 16:14:15,993 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 69 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:15,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-05 16:14:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-02-05 16:14:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 119 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 16:14:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-02-05 16:14:16,006 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 52 [2025-02-05 16:14:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:16,006 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-02-05 16:14:16,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 16:14:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-02-05 16:14:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:14:16,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:16,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:16,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:14:16,008 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:16,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1217827255, now seen corresponding path program 1 times [2025-02-05 16:14:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:16,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273553] [2025-02-05 16:14:16,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:16,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:16,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:14:16,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:14:16,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:16,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:16,084 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 16:14:16,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273553] [2025-02-05 16:14:16,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:16,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:16,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:14:16,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926326543] [2025-02-05 16:14:16,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:16,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:14:16,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:16,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:14:16,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:16,086 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 16:14:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:16,109 INFO L93 Difference]: Finished difference Result 284 states and 440 transitions. [2025-02-05 16:14:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:14:16,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-05 16:14:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:16,115 INFO L225 Difference]: With dead ends: 284 [2025-02-05 16:14:16,115 INFO L226 Difference]: Without dead ends: 194 [2025-02-05 16:14:16,115 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 16:14:16,116 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 65 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:16,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 249 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-05 16:14:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2025-02-05 16:14:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.5235602094240839) internal successors, (291), 191 states have internal predecessors, (291), 0 states have call successors, (0), 0 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 16:14:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2025-02-05 16:14:16,133 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 52 [2025-02-05 16:14:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:16,134 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2025-02-05 16:14:16,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 16:14:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2025-02-05 16:14:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:14:16,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:16,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:16,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:14:16,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:16,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1028889994, now seen corresponding path program 1 times [2025-02-05 16:14:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:16,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235456007] [2025-02-05 16:14:16,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:16,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:16,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:14:16,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:14:16,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:16,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:16,317 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 16:14:16,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235456007] [2025-02-05 16:14:16,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235456007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:16,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:16,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:14:16,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566184504] [2025-02-05 16:14:16,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:16,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:14:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:16,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:14:16,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:14:16,320 INFO L87 Difference]: Start difference. First operand 192 states and 291 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 16:14:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:16,440 INFO L93 Difference]: Finished difference Result 1002 states and 1596 transitions. [2025-02-05 16:14:16,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:14:16,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-02-05 16:14:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:16,445 INFO L225 Difference]: With dead ends: 1002 [2025-02-05 16:14:16,446 INFO L226 Difference]: Without dead ends: 840 [2025-02-05 16:14:16,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:14:16,448 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 782 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:16,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 518 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:14:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-02-05 16:14:16,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 352. [2025-02-05 16:14:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.547008547008547) internal successors, (543), 351 states have internal predecessors, (543), 0 states have call successors, (0), 0 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 16:14:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 543 transitions. [2025-02-05 16:14:16,489 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 543 transitions. Word has length 52 [2025-02-05 16:14:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:16,489 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 543 transitions. [2025-02-05 16:14:16,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 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 16:14:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 543 transitions. [2025-02-05 16:14:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:14:16,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:16,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:16,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:14:16,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:16,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:16,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1801204530, now seen corresponding path program 1 times [2025-02-05 16:14:16,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:16,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732369098] [2025-02-05 16:14:16,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:16,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:16,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:14:16,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:14:16,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:16,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:16,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732369098] [2025-02-05 16:14:16,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732369098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:16,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:16,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:14:16,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492212980] [2025-02-05 16:14:16,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:16,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:14:16,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:16,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:14:16,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:14:16,740 INFO L87 Difference]: Start difference. First operand 352 states and 543 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 16:14:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:16,765 INFO L93 Difference]: Finished difference Result 378 states and 576 transitions. [2025-02-05 16:14:16,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:14:16,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-02-05 16:14:16,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:16,768 INFO L225 Difference]: With dead ends: 378 [2025-02-05 16:14:16,768 INFO L226 Difference]: Without dead ends: 376 [2025-02-05 16:14:16,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:14:16,769 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:16,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-02-05 16:14:16,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-02-05 16:14:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 1.512) internal successors, (567), 375 states have internal predecessors, (567), 0 states have call successors, (0), 0 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 16:14:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 567 transitions. [2025-02-05 16:14:16,786 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 567 transitions. Word has length 53 [2025-02-05 16:14:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:16,786 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 567 transitions. [2025-02-05 16:14:16,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 16:14:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 567 transitions. [2025-02-05 16:14:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:14:16,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:16,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:16,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:14:16,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:16,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:16,787 INFO L85 PathProgramCache]: Analyzing trace with hash 85953974, now seen corresponding path program 1 times [2025-02-05 16:14:16,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:16,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700430948] [2025-02-05 16:14:16,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:16,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:16,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:14:16,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:14:16,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:16,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:16,889 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 16:14:16,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:16,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700430948] [2025-02-05 16:14:16,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700430948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:16,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:16,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:14:16,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139263958] [2025-02-05 16:14:16,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:16,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:14:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:16,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:14:16,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:16,892 INFO L87 Difference]: Start difference. First operand 376 states and 567 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:16,920 INFO L93 Difference]: Finished difference Result 884 states and 1355 transitions. [2025-02-05 16:14:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:14:16,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-02-05 16:14:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:16,924 INFO L225 Difference]: With dead ends: 884 [2025-02-05 16:14:16,924 INFO L226 Difference]: Without dead ends: 538 [2025-02-05 16:14:16,925 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 16:14:16,926 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:16,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-02-05 16:14:16,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2025-02-05 16:14:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.519626168224299) internal successors, (813), 535 states have internal predecessors, (813), 0 states have call successors, (0), 0 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 16:14:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 813 transitions. [2025-02-05 16:14:16,949 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 813 transitions. Word has length 54 [2025-02-05 16:14:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:16,949 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 813 transitions. [2025-02-05 16:14:16,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 813 transitions. [2025-02-05 16:14:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:14:16,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:16,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:16,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:14:16,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:16,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:16,953 INFO L85 PathProgramCache]: Analyzing trace with hash -594926501, now seen corresponding path program 1 times [2025-02-05 16:14:16,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:16,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025261468] [2025-02-05 16:14:16,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:16,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:16,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:14:16,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:14:16,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:16,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:17,027 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 16:14:17,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:17,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025261468] [2025-02-05 16:14:17,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025261468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:17,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:17,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:14:17,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938044638] [2025-02-05 16:14:17,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:17,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:14:17,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:17,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:14:17,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:17,028 INFO L87 Difference]: Start difference. First operand 536 states and 813 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 16:14:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:17,063 INFO L93 Difference]: Finished difference Result 1448 states and 2207 transitions. [2025-02-05 16:14:17,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:14:17,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 16:14:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:17,069 INFO L225 Difference]: With dead ends: 1448 [2025-02-05 16:14:17,069 INFO L226 Difference]: Without dead ends: 944 [2025-02-05 16:14:17,070 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 16:14:17,070 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 57 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:17,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-02-05 16:14:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 942. [2025-02-05 16:14:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 1.5015940488841657) internal successors, (1413), 941 states have internal predecessors, (1413), 0 states have call successors, (0), 0 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 16:14:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1413 transitions. [2025-02-05 16:14:17,108 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1413 transitions. Word has length 55 [2025-02-05 16:14:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:17,109 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1413 transitions. [2025-02-05 16:14:17,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 16:14:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1413 transitions. [2025-02-05 16:14:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:14:17,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:17,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:17,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:14:17,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:17,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1753602391, now seen corresponding path program 1 times [2025-02-05 16:14:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:17,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153887763] [2025-02-05 16:14:17,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:17,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:14:17,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:14:17,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:17,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:17,189 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 16:14:17,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:17,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153887763] [2025-02-05 16:14:17,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153887763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:17,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:17,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:14:17,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242792221] [2025-02-05 16:14:17,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:17,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:14:17,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:17,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:14:17,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:17,191 INFO L87 Difference]: Start difference. First operand 942 states and 1413 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 16:14:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:17,235 INFO L93 Difference]: Finished difference Result 2570 states and 3839 transitions. [2025-02-05 16:14:17,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:14:17,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-02-05 16:14:17,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:17,242 INFO L225 Difference]: With dead ends: 2570 [2025-02-05 16:14:17,242 INFO L226 Difference]: Without dead ends: 1660 [2025-02-05 16:14:17,243 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 16:14:17,244 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:17,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 246 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-02-05 16:14:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1658. [2025-02-05 16:14:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.468316234158117) internal successors, (2433), 1657 states have internal predecessors, (2433), 0 states have call successors, (0), 0 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 16:14:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2433 transitions. [2025-02-05 16:14:17,310 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2433 transitions. Word has length 55 [2025-02-05 16:14:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:17,310 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2433 transitions. [2025-02-05 16:14:17,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 16:14:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2433 transitions. [2025-02-05 16:14:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:14:17,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:17,313 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:17,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:14:17,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:17,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:17,315 INFO L85 PathProgramCache]: Analyzing trace with hash -84435292, now seen corresponding path program 1 times [2025-02-05 16:14:17,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:17,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113205323] [2025-02-05 16:14:17,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:17,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:17,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:14:17,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:14:17,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:17,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:17,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:17,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113205323] [2025-02-05 16:14:17,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113205323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:17,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:17,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:14:17,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133852711] [2025-02-05 16:14:17,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:17,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:14:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:17,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:14:17,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:17,430 INFO L87 Difference]: Start difference. First operand 1658 states and 2433 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 16:14:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:17,470 INFO L93 Difference]: Finished difference Result 3286 states and 4835 transitions. [2025-02-05 16:14:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:14:17,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:14:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:17,476 INFO L225 Difference]: With dead ends: 3286 [2025-02-05 16:14:17,477 INFO L226 Difference]: Without dead ends: 1660 [2025-02-05 16:14:17,479 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 16:14:17,479 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 54 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:17,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 237 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:17,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-02-05 16:14:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1658. [2025-02-05 16:14:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.4538322269161135) internal successors, (2409), 1657 states have internal predecessors, (2409), 0 states have call successors, (0), 0 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 16:14:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2409 transitions. [2025-02-05 16:14:17,534 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2409 transitions. Word has length 77 [2025-02-05 16:14:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:17,534 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2409 transitions. [2025-02-05 16:14:17,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 16:14:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2409 transitions. [2025-02-05 16:14:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:14:17,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:17,536 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:17,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:14:17,536 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:17,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash -384072905, now seen corresponding path program 1 times [2025-02-05 16:14:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:17,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166094883] [2025-02-05 16:14:17,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:17,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:17,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:14:17,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:14:17,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:17,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:17,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:17,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166094883] [2025-02-05 16:14:17,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166094883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:17,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:17,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:14:17,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892411561] [2025-02-05 16:14:17,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:17,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:14:17,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:17,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:14:17,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:14:17,667 INFO L87 Difference]: Start difference. First operand 1658 states and 2409 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 16:14:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:17,703 INFO L93 Difference]: Finished difference Result 2474 states and 3599 transitions. [2025-02-05 16:14:17,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:14:17,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:14:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:17,708 INFO L225 Difference]: With dead ends: 2474 [2025-02-05 16:14:17,708 INFO L226 Difference]: Without dead ends: 848 [2025-02-05 16:14:17,711 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 16:14:17,712 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 48 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:17,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 218 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:14:17,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-02-05 16:14:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2025-02-05 16:14:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.4307692307692308) internal successors, (1209), 845 states have internal predecessors, (1209), 0 states have call successors, (0), 0 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 16:14:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1209 transitions. [2025-02-05 16:14:17,737 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1209 transitions. Word has length 77 [2025-02-05 16:14:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:17,738 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1209 transitions. [2025-02-05 16:14:17,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 16:14:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1209 transitions. [2025-02-05 16:14:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 16:14:17,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:17,739 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:17,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:14:17,739 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:17,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1003050678, now seen corresponding path program 1 times [2025-02-05 16:14:17,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:17,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016261255] [2025-02-05 16:14:17,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:17,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:17,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:14:17,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:14:17,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:17,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:18,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:18,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016261255] [2025-02-05 16:14:18,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016261255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:18,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952678768] [2025-02-05 16:14:18,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:18,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:18,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:18,258 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 16:14:18,261 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 16:14:18,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-05 16:14:18,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-05 16:14:18,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:18,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:18,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 16:14:18,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:19,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:19,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952678768] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:19,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:19,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 22 [2025-02-05 16:14:19,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180581059] [2025-02-05 16:14:19,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:19,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 16:14:19,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:19,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 16:14:19,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:14:19,865 INFO L87 Difference]: Start difference. First operand 846 states and 1209 transitions. Second operand has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 22 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:28,073 INFO L93 Difference]: Finished difference Result 10054 states and 14295 transitions. [2025-02-05 16:14:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2025-02-05 16:14:28,074 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 22 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 16:14:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:28,109 INFO L225 Difference]: With dead ends: 10054 [2025-02-05 16:14:28,110 INFO L226 Difference]: Without dead ends: 9492 [2025-02-05 16:14:28,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12920 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4452, Invalid=27768, Unknown=0, NotChecked=0, Total=32220 [2025-02-05 16:14:28,126 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 3439 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3439 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:28,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3439 Valid, 2151 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 16:14:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9492 states. [2025-02-05 16:14:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9492 to 8526. [2025-02-05 16:14:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8526 states, 8525 states have (on average 1.409149560117302) internal successors, (12013), 8525 states have internal predecessors, (12013), 0 states have call successors, (0), 0 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 16:14:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8526 states to 8526 states and 12013 transitions. [2025-02-05 16:14:28,387 INFO L78 Accepts]: Start accepts. Automaton has 8526 states and 12013 transitions. Word has length 77 [2025-02-05 16:14:28,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:28,387 INFO L471 AbstractCegarLoop]: Abstraction has 8526 states and 12013 transitions. [2025-02-05 16:14:28,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 22 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8526 states and 12013 transitions. [2025-02-05 16:14:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:14:28,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:28,393 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:28,403 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 16:14:28,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 16:14:28,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:28,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash 7678710, now seen corresponding path program 1 times [2025-02-05 16:14:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:28,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193268671] [2025-02-05 16:14:28,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:28,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:28,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:14:28,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:14:28,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:28,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:14:28,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:28,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193268671] [2025-02-05 16:14:28,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193268671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:28,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:28,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:14:28,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78742260] [2025-02-05 16:14:28,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:28,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:14:28,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:28,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:14:28,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:14:28,757 INFO L87 Difference]: Start difference. First operand 8526 states and 12013 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 16:14:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:29,147 INFO L93 Difference]: Finished difference Result 25332 states and 35922 transitions. [2025-02-05 16:14:29,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:14:29,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:14:29,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:29,200 INFO L225 Difference]: With dead ends: 25332 [2025-02-05 16:14:29,200 INFO L226 Difference]: Without dead ends: 21380 [2025-02-05 16:14:29,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:14:29,212 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 446 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:29,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 764 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:14:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21380 states. [2025-02-05 16:14:29,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21380 to 12424. [2025-02-05 16:14:29,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12424 states, 12423 states have (on average 1.4028012557353295) internal successors, (17427), 12423 states have internal predecessors, (17427), 0 states have call successors, (0), 0 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 16:14:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12424 states to 12424 states and 17427 transitions. [2025-02-05 16:14:29,662 INFO L78 Accepts]: Start accepts. Automaton has 12424 states and 17427 transitions. Word has length 78 [2025-02-05 16:14:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:29,662 INFO L471 AbstractCegarLoop]: Abstraction has 12424 states and 17427 transitions. [2025-02-05 16:14:29,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 16:14:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 12424 states and 17427 transitions. [2025-02-05 16:14:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:14:29,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:29,663 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:29,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:14:29,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:29,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:29,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1961866539, now seen corresponding path program 1 times [2025-02-05 16:14:29,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:29,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631990357] [2025-02-05 16:14:29,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:29,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:29,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:14:29,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:14:29,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:29,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:14:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631990357] [2025-02-05 16:14:29,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631990357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:29,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:29,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:14:29,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950110925] [2025-02-05 16:14:29,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:29,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:14:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:29,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:14:29,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:14:29,783 INFO L87 Difference]: Start difference. First operand 12424 states and 17427 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 16:14:30,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:30,399 INFO L93 Difference]: Finished difference Result 29724 states and 42058 transitions. [2025-02-05 16:14:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:14:30,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:14:30,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:30,464 INFO L225 Difference]: With dead ends: 29724 [2025-02-05 16:14:30,464 INFO L226 Difference]: Without dead ends: 25248 [2025-02-05 16:14:30,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:14:30,480 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 450 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:30,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 699 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:14:30,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25248 states. [2025-02-05 16:14:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25248 to 16616. [2025-02-05 16:14:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16616 states, 16615 states have (on average 1.400481492627144) internal successors, (23269), 16615 states have internal predecessors, (23269), 0 states have call successors, (0), 0 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 16:14:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16616 states to 16616 states and 23269 transitions. [2025-02-05 16:14:31,002 INFO L78 Accepts]: Start accepts. Automaton has 16616 states and 23269 transitions. Word has length 78 [2025-02-05 16:14:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:31,002 INFO L471 AbstractCegarLoop]: Abstraction has 16616 states and 23269 transitions. [2025-02-05 16:14:31,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 16:14:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 16616 states and 23269 transitions. [2025-02-05 16:14:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:14:31,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:31,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:31,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:14:31,006 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:31,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1572916863, now seen corresponding path program 1 times [2025-02-05 16:14:31,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:31,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193144049] [2025-02-05 16:14:31,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:31,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:31,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:14:31,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:14:31,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:31,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:14:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:31,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193144049] [2025-02-05 16:14:31,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193144049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:31,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:31,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:14:31,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059367068] [2025-02-05 16:14:31,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:31,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:14:31,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:31,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:14:31,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:14:31,141 INFO L87 Difference]: Start difference. First operand 16616 states and 23269 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:31,759 INFO L93 Difference]: Finished difference Result 33916 states and 47900 transitions. [2025-02-05 16:14:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:14:31,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:14:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:31,804 INFO L225 Difference]: With dead ends: 33916 [2025-02-05 16:14:31,804 INFO L226 Difference]: Without dead ends: 29440 [2025-02-05 16:14:31,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:14:31,817 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 510 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:31,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 650 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:14:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29440 states. [2025-02-05 16:14:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29440 to 20808. [2025-02-05 16:14:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20808 states, 20807 states have (on average 1.3990964579228145) internal successors, (29111), 20807 states have internal predecessors, (29111), 0 states have call successors, (0), 0 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 16:14:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20808 states to 20808 states and 29111 transitions. [2025-02-05 16:14:32,491 INFO L78 Accepts]: Start accepts. Automaton has 20808 states and 29111 transitions. Word has length 78 [2025-02-05 16:14:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:32,491 INFO L471 AbstractCegarLoop]: Abstraction has 20808 states and 29111 transitions. [2025-02-05 16:14:32,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:14:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20808 states and 29111 transitions. [2025-02-05 16:14:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:14:32,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:32,493 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:14:32,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:14:32,494 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:32,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2145668653, now seen corresponding path program 1 times [2025-02-05 16:14:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:32,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806824642] [2025-02-05 16:14:32,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:32,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:14:32,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:14:32,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:32,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:14:32,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:32,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806824642] [2025-02-05 16:14:32,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806824642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:14:32,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:14:32,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:14:32,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115713931] [2025-02-05 16:14:32,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:14:32,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:14:32,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:32,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:14:32,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:14:32,634 INFO L87 Difference]: Start difference. First operand 20808 states and 29111 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 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 16:14:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:33,460 INFO L93 Difference]: Finished difference Result 38108 states and 53742 transitions. [2025-02-05 16:14:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:14:33,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:14:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:33,516 INFO L225 Difference]: With dead ends: 38108 [2025-02-05 16:14:33,516 INFO L226 Difference]: Without dead ends: 33632 [2025-02-05 16:14:33,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:14:33,527 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 471 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:33,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 742 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:14:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33632 states. [2025-02-05 16:14:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33632 to 25000. [2025-02-05 16:14:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25000 states, 24999 states have (on average 1.3981759270370815) internal successors, (34953), 24999 states have internal predecessors, (34953), 0 states have call successors, (0), 0 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 16:14:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25000 states to 25000 states and 34953 transitions. [2025-02-05 16:14:34,094 INFO L78 Accepts]: Start accepts. Automaton has 25000 states and 34953 transitions. Word has length 78 [2025-02-05 16:14:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:34,094 INFO L471 AbstractCegarLoop]: Abstraction has 25000 states and 34953 transitions. [2025-02-05 16:14:34,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 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 16:14:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 25000 states and 34953 transitions. [2025-02-05 16:14:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:14:34,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:34,096 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:14:34,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:14:34,097 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:34,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:34,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1204350006, now seen corresponding path program 1 times [2025-02-05 16:14:34,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:34,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9497469] [2025-02-05 16:14:34,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:34,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:34,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:14:34,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:14:34,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:34,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:34,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:34,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9497469] [2025-02-05 16:14:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9497469] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:34,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730291331] [2025-02-05 16:14:34,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:34,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:34,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:34,560 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 16:14:34,562 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 16:14:34,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:14:34,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:14:34,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:34,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:34,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:14:34,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:35,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:35,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730291331] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:35,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:35,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-02-05 16:14:35,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618470055] [2025-02-05 16:14:35,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:35,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 16:14:35,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:35,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 16:14:35,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:14:35,913 INFO L87 Difference]: Start difference. First operand 25000 states and 34953 transitions. Second operand has 22 states, 22 states have (on average 8.409090909090908) internal successors, (185), 21 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 16:14:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:37,356 INFO L93 Difference]: Finished difference Result 95848 states and 134222 transitions. [2025-02-05 16:14:37,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:14:37,357 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.409090909090908) internal successors, (185), 21 states have internal predecessors, (185), 0 states have call successors, (0), 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 81 [2025-02-05 16:14:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:37,441 INFO L225 Difference]: With dead ends: 95848 [2025-02-05 16:14:37,441 INFO L226 Difference]: Without dead ends: 70880 [2025-02-05 16:14:37,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 16:14:37,465 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 981 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:37,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 890 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:14:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70880 states. [2025-02-05 16:14:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70880 to 66036. [2025-02-05 16:14:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66036 states, 66035 states have (on average 1.3779813735140456) internal successors, (90995), 66035 states have internal predecessors, (90995), 0 states have call successors, (0), 0 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 16:14:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66036 states to 66036 states and 90995 transitions. [2025-02-05 16:14:39,327 INFO L78 Accepts]: Start accepts. Automaton has 66036 states and 90995 transitions. Word has length 81 [2025-02-05 16:14:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:14:39,328 INFO L471 AbstractCegarLoop]: Abstraction has 66036 states and 90995 transitions. [2025-02-05 16:14:39,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.409090909090908) internal successors, (185), 21 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 16:14:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 66036 states and 90995 transitions. [2025-02-05 16:14:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 16:14:39,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:14:39,331 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:14:39,339 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 16:14:39,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 16:14:39,531 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:14:39,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:14:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1016917902, now seen corresponding path program 1 times [2025-02-05 16:14:39,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:14:39,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434205027] [2025-02-05 16:14:39,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:14:39,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:14:39,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:14:39,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:39,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:40,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:14:40,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434205027] [2025-02-05 16:14:40,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434205027] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:14:40,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247628014] [2025-02-05 16:14:40,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:14:40,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:14:40,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:14:40,291 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 16:14:40,292 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 16:14:40,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 16:14:40,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 16:14:40,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:14:40,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:14:40,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 16:14:40,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:14:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:40,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:14:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:14:41,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247628014] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:14:41,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:14:41,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2025-02-05 16:14:41,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155808350] [2025-02-05 16:14:41,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:14:41,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 16:14:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:14:41,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 16:14:41,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 16:14:41,761 INFO L87 Difference]: Start difference. First operand 66036 states and 90995 transitions. Second operand has 35 states, 35 states have (on average 6.0285714285714285) internal successors, (211), 35 states have internal predecessors, (211), 0 states have call successors, (0), 0 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 16:14:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:14:55,872 INFO L93 Difference]: Finished difference Result 809356 states and 1120339 transitions. [2025-02-05 16:14:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2025-02-05 16:14:55,873 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.0285714285714285) internal successors, (211), 35 states have internal predecessors, (211), 0 states have call successors, (0), 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 81 [2025-02-05 16:14:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:14:56,933 INFO L225 Difference]: With dead ends: 809356 [2025-02-05 16:14:56,934 INFO L226 Difference]: Without dead ends: 743352 [2025-02-05 16:14:57,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8347 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3914, Invalid=19648, Unknown=0, NotChecked=0, Total=23562 [2025-02-05 16:14:57,120 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 8322 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 2062 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8322 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 2062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:14:57,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8322 Valid, 1937 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 2062 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 16:14:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743352 states.