./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 50b0a90f24476d3b8404a11c5a11650cef36326e0b80eb9bfd0bc8b7617d7b0d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:01:17,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:01:17,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:01:17,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:01:17,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:01:17,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:01:17,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:01:17,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:01:17,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:01:17,546 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:01:17,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:01:17,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:01:17,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:01:17,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:01:17,547 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:01:17,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:01:17,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:01:17,547 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:01:17,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:01:17,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:01:17,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:01:17,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:01:17,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:01:17,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:01:17,548 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:01:17,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:01:17,548 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:01:17,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:01:17,548 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:01:17,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:01:17,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:01:17,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:01:17,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:01:17,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:01:17,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:01:17,549 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:01:17,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:01:17,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:01:17,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:01:17,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:01:17,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:01:17,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:01:17,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:01:17,550 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/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 -> 50b0a90f24476d3b8404a11c5a11650cef36326e0b80eb9bfd0bc8b7617d7b0d [2025-03-08 06:01:17,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:01:17,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:01:17,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:01:17,783 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:01:17,783 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:01:17,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2025-03-08 06:01:18,239 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9f8306d/f57c65c4ee724a1482dd8f8cb98b09f0/FLAG28a4822a3 [2025-03-08 06:01:19,820 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:01:19,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2025-03-08 06:01:19,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9f8306d/f57c65c4ee724a1482dd8f8cb98b09f0/FLAG28a4822a3 [2025-03-08 06:01:20,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9f8306d/f57c65c4ee724a1482dd8f8cb98b09f0 [2025-03-08 06:01:20,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:01:20,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:01:20,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:01:20,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:01:20,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:01:20,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721f17ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20, skipping insertion in model container [2025-03-08 06:01:20,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:01:20,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c[8342,8355] [2025-03-08 06:01:20,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:01:20,323 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:01:20,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.UNBOUNDED.pals.c[8342,8355] [2025-03-08 06:01:20,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:01:20,371 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:01:20,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20 WrapperNode [2025-03-08 06:01:20,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:01:20,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:01:20,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:01:20,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:01:20,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,397 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 276 [2025-03-08 06:01:20,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:01:20,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:01:20,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:01:20,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:01:20,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,426 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-03-08 06:01:20,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:01:20,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:01:20,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:01:20,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:01:20,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (1/1) ... [2025-03-08 06:01:20,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:01:20,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:20,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:01:20,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:01:20,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:01:20,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:01:20,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:01:20,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:01:20,537 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:01:20,538 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:01:20,859 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-08 06:01:20,860 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:01:20,869 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:01:20,870 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:01:20,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:01:20 BoogieIcfgContainer [2025-03-08 06:01:20,870 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:01:20,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:01:20,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:01:20,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:01:20,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:01:20" (1/3) ... [2025-03-08 06:01:20,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a84334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:01:20, skipping insertion in model container [2025-03-08 06:01:20,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:01:20" (2/3) ... [2025-03-08 06:01:20,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a84334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:01:20, skipping insertion in model container [2025-03-08 06:01:20,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:01:20" (3/3) ... [2025-03-08 06:01:20,878 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c [2025-03-08 06:01:20,888 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:01:20,890 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 06:01:20,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:01:20,945 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;@7a9c97c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:01:20,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:01:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 69 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 06:01:20,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:20,954 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] [2025-03-08 06:01:20,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:20,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2142403755, now seen corresponding path program 1 times [2025-03-08 06:01:20,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:20,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410658443] [2025-03-08 06:01:20,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:20,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:21,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 06:01:21,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 06:01:21,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:21,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:21,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:21,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410658443] [2025-03-08 06:01:21,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410658443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:21,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:21,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 06:01:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351145000] [2025-03-08 06:01:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:21,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 06:01:21,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:21,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 06:01:21,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 06:01:21,150 INFO L87 Difference]: Start difference. First operand has 70 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 69 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:21,161 INFO L93 Difference]: Finished difference Result 109 states and 180 transitions. [2025-03-08 06:01:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 06:01:21,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-08 06:01:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:21,169 INFO L225 Difference]: With dead ends: 109 [2025-03-08 06:01:21,169 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 06:01:21,171 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-03-08 06:01:21,173 INFO L435 NwaCegarLoop]: 112 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, 112 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-03-08 06:01:21,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 06:01:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 06:01:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.696969696969697) internal successors, (112), 66 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 112 transitions. [2025-03-08 06:01:21,196 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 112 transitions. Word has length 21 [2025-03-08 06:01:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:21,196 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 112 transitions. [2025-03-08 06:01:21,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 112 transitions. [2025-03-08 06:01:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 06:01:21,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:21,197 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] [2025-03-08 06:01:21,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:01:21,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:21,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:21,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1631869578, now seen corresponding path program 1 times [2025-03-08 06:01:21,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:21,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132095161] [2025-03-08 06:01:21,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:21,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:21,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 06:01:21,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 06:01:21,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:21,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:21,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:21,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132095161] [2025-03-08 06:01:21,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132095161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:21,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:21,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:01:21,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139307581] [2025-03-08 06:01:21,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:21,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:01:21,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:21,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:01:21,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:01:21,411 INFO L87 Difference]: Start difference. First operand 67 states and 112 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:21,476 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2025-03-08 06:01:21,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:01:21,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-03-08 06:01:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:21,477 INFO L225 Difference]: With dead ends: 109 [2025-03-08 06:01:21,477 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 06:01:21,478 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-03-08 06:01:21,478 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:21,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 412 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:01:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 06:01:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 06:01:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2025-03-08 06:01:21,482 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 21 [2025-03-08 06:01:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:21,482 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2025-03-08 06:01:21,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2025-03-08 06:01:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 06:01:21,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:21,483 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] [2025-03-08 06:01:21,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:01:21,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:21,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:21,483 INFO L85 PathProgramCache]: Analyzing trace with hash 859137748, now seen corresponding path program 1 times [2025-03-08 06:01:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:21,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46285681] [2025-03-08 06:01:21,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:21,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 06:01:21,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 06:01:21,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:21,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:21,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:21,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46285681] [2025-03-08 06:01:21,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46285681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:21,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:21,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:01:21,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917379412] [2025-03-08 06:01:21,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:21,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:01:21,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:21,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:01:21,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:21,635 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:21,781 INFO L93 Difference]: Finished difference Result 371 states and 569 transitions. [2025-03-08 06:01:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:01:21,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-03-08 06:01:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:21,784 INFO L225 Difference]: With dead ends: 371 [2025-03-08 06:01:21,784 INFO L226 Difference]: Without dead ends: 333 [2025-03-08 06:01:21,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:01:21,785 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 529 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:21,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 696 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:01:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-08 06:01:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 103. [2025-03-08 06:01:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 102 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2025-03-08 06:01:21,794 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 43 [2025-03-08 06:01:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:21,794 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2025-03-08 06:01:21,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2025-03-08 06:01:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 06:01:21,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:21,795 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] [2025-03-08 06:01:21,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:01:21,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:21,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:21,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2118008207, now seen corresponding path program 1 times [2025-03-08 06:01:21,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:21,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135938086] [2025-03-08 06:01:21,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:21,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:21,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 06:01:21,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 06:01:21,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:21,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:21,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135938086] [2025-03-08 06:01:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135938086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:21,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:21,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973172149] [2025-03-08 06:01:21,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:21,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:21,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:21,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:21,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:21,900 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:21,927 INFO L93 Difference]: Finished difference Result 240 states and 361 transitions. [2025-03-08 06:01:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:21,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-08 06:01:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:21,928 INFO L225 Difference]: With dead ends: 240 [2025-03-08 06:01:21,928 INFO L226 Difference]: Without dead ends: 166 [2025-03-08 06:01:21,929 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-03-08 06:01:21,929 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 37 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:21,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-08 06:01:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2025-03-08 06:01:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4658385093167703) internal successors, (236), 161 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 236 transitions. [2025-03-08 06:01:21,946 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 236 transitions. Word has length 45 [2025-03-08 06:01:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:21,946 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 236 transitions. [2025-03-08 06:01:21,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 236 transitions. [2025-03-08 06:01:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 06:01:21,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:21,948 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] [2025-03-08 06:01:21,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:01:21,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:21,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2144635854, now seen corresponding path program 1 times [2025-03-08 06:01:21,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:21,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040208734] [2025-03-08 06:01:21,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:21,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:21,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 06:01:21,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 06:01:21,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:21,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:22,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:22,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040208734] [2025-03-08 06:01:22,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040208734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:22,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:22,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:01:22,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772660985] [2025-03-08 06:01:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:22,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:01:22,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:22,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:01:22,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:22,136 INFO L87 Difference]: Start difference. First operand 162 states and 236 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:22,232 INFO L93 Difference]: Finished difference Result 297 states and 444 transitions. [2025-03-08 06:01:22,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:01:22,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-08 06:01:22,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:22,234 INFO L225 Difference]: With dead ends: 297 [2025-03-08 06:01:22,234 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 06:01:22,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:01:22,234 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 96 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:22,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 255 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 06:01:22,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2025-03-08 06:01:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.453416149068323) internal successors, (234), 161 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2025-03-08 06:01:22,250 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 45 [2025-03-08 06:01:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:22,250 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2025-03-08 06:01:22,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2025-03-08 06:01:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 06:01:22,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:22,253 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] [2025-03-08 06:01:22,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:01:22,253 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:22,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2028664301, now seen corresponding path program 1 times [2025-03-08 06:01:22,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:22,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953152824] [2025-03-08 06:01:22,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:22,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 06:01:22,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 06:01:22,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:22,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:22,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:22,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953152824] [2025-03-08 06:01:22,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953152824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:22,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:22,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:01:22,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495249751] [2025-03-08 06:01:22,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:22,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:01:22,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:22,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:01:22,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:01:22,472 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:22,503 INFO L93 Difference]: Finished difference Result 170 states and 243 transitions. [2025-03-08 06:01:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:01:22,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-03-08 06:01:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:22,504 INFO L225 Difference]: With dead ends: 170 [2025-03-08 06:01:22,504 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 06:01:22,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:01:22,505 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:22,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 06:01:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-08 06:01:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.4311377245508983) internal successors, (239), 167 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 239 transitions. [2025-03-08 06:01:22,511 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 239 transitions. Word has length 46 [2025-03-08 06:01:22,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:22,511 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 239 transitions. [2025-03-08 06:01:22,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 239 transitions. [2025-03-08 06:01:22,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:01:22,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:22,513 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] [2025-03-08 06:01:22,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:01:22,513 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:22,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash -505514128, now seen corresponding path program 1 times [2025-03-08 06:01:22,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:22,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198890176] [2025-03-08 06:01:22,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:22,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:22,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:01:22,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:01:22,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:22,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:22,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:22,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198890176] [2025-03-08 06:01:22,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198890176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:22,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:22,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:22,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844782489] [2025-03-08 06:01:22,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:22,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:22,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:22,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:22,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:22,591 INFO L87 Difference]: Start difference. First operand 168 states and 239 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:22,606 INFO L93 Difference]: Finished difference Result 430 states and 631 transitions. [2025-03-08 06:01:22,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-08 06:01:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:22,608 INFO L225 Difference]: With dead ends: 430 [2025-03-08 06:01:22,608 INFO L226 Difference]: Without dead ends: 291 [2025-03-08 06:01:22,609 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-03-08 06:01:22,611 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 48 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:22,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 191 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-08 06:01:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2025-03-08 06:01:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.4444444444444444) internal successors, (416), 288 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 416 transitions. [2025-03-08 06:01:22,625 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 416 transitions. Word has length 47 [2025-03-08 06:01:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:22,625 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 416 transitions. [2025-03-08 06:01:22,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 416 transitions. [2025-03-08 06:01:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:01:22,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:22,626 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] [2025-03-08 06:01:22,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:01:22,626 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:22,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:22,627 INFO L85 PathProgramCache]: Analyzing trace with hash -90338256, now seen corresponding path program 1 times [2025-03-08 06:01:22,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:22,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492592789] [2025-03-08 06:01:22,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:22,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:22,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:01:22,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:01:22,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:22,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:22,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:22,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492592789] [2025-03-08 06:01:22,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492592789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:22,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:22,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:22,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483744662] [2025-03-08 06:01:22,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:22,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:22,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:22,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:22,675 INFO L87 Difference]: Start difference. First operand 289 states and 416 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:22,693 INFO L93 Difference]: Finished difference Result 777 states and 1134 transitions. [2025-03-08 06:01:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:22,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-08 06:01:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:22,697 INFO L225 Difference]: With dead ends: 777 [2025-03-08 06:01:22,697 INFO L226 Difference]: Without dead ends: 517 [2025-03-08 06:01:22,698 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-03-08 06:01:22,698 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 46 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:22,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 193 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-08 06:01:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 515. [2025-03-08 06:01:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.4357976653696498) internal successors, (738), 514 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 738 transitions. [2025-03-08 06:01:22,722 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 738 transitions. Word has length 47 [2025-03-08 06:01:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:22,722 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 738 transitions. [2025-03-08 06:01:22,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 738 transitions. [2025-03-08 06:01:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:01:22,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:22,725 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] [2025-03-08 06:01:22,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:01:22,725 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:22,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash -577056528, now seen corresponding path program 1 times [2025-03-08 06:01:22,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:22,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608268098] [2025-03-08 06:01:22,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:22,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:22,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:01:22,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:01:22,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:22,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608268098] [2025-03-08 06:01:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608268098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905172119] [2025-03-08 06:01:22,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:22,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:22,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:22,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:22,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:22,785 INFO L87 Difference]: Start difference. First operand 515 states and 738 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:22,813 INFO L93 Difference]: Finished difference Result 1423 states and 2044 transitions. [2025-03-08 06:01:22,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:22,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-08 06:01:22,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:22,817 INFO L225 Difference]: With dead ends: 1423 [2025-03-08 06:01:22,817 INFO L226 Difference]: Without dead ends: 937 [2025-03-08 06:01:22,818 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-03-08 06:01:22,818 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:22,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-03-08 06:01:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 935. [2025-03-08 06:01:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 1.411134903640257) internal successors, (1318), 934 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1318 transitions. [2025-03-08 06:01:22,853 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1318 transitions. Word has length 47 [2025-03-08 06:01:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:22,853 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1318 transitions. [2025-03-08 06:01:22,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1318 transitions. [2025-03-08 06:01:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 06:01:22,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:22,853 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] [2025-03-08 06:01:22,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:01:22,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:22,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:22,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1134540880, now seen corresponding path program 1 times [2025-03-08 06:01:22,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:22,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753315168] [2025-03-08 06:01:22,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:22,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 06:01:22,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 06:01:22,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:22,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:22,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:22,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753315168] [2025-03-08 06:01:22,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753315168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:22,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:22,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:22,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408141175] [2025-03-08 06:01:22,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:22,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:22,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:22,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:22,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:22,904 INFO L87 Difference]: Start difference. First operand 935 states and 1318 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:22,935 INFO L93 Difference]: Finished difference Result 1902 states and 2716 transitions. [2025-03-08 06:01:22,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:22,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-08 06:01:22,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:22,940 INFO L225 Difference]: With dead ends: 1902 [2025-03-08 06:01:22,940 INFO L226 Difference]: Without dead ends: 1371 [2025-03-08 06:01:22,941 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-03-08 06:01:22,942 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 47 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:22,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-03-08 06:01:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2025-03-08 06:01:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1368 states have (on average 1.4035087719298245) internal successors, (1920), 1368 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1920 transitions. [2025-03-08 06:01:22,989 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1920 transitions. Word has length 49 [2025-03-08 06:01:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:22,989 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1920 transitions. [2025-03-08 06:01:22,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1920 transitions. [2025-03-08 06:01:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:01:22,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:22,990 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] [2025-03-08 06:01:22,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:01:22,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:22,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash -18445534, now seen corresponding path program 1 times [2025-03-08 06:01:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:22,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995553990] [2025-03-08 06:01:22,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:22,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:23,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:01:23,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:01:23,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:23,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 06:01:23,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:23,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995553990] [2025-03-08 06:01:23,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995553990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:23,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:23,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:01:23,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542352128] [2025-03-08 06:01:23,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:23,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:01:23,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:23,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:01:23,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:23,100 INFO L87 Difference]: Start difference. First operand 1369 states and 1920 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:23,275 INFO L93 Difference]: Finished difference Result 7019 states and 9877 transitions. [2025-03-08 06:01:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:01:23,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 64 [2025-03-08 06:01:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:23,294 INFO L225 Difference]: With dead ends: 7019 [2025-03-08 06:01:23,294 INFO L226 Difference]: Without dead ends: 5681 [2025-03-08 06:01:23,298 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-03-08 06:01:23,298 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 351 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:23,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 471 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2025-03-08 06:01:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 2705. [2025-03-08 06:01:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2704 states have (on average 1.3994082840236686) internal successors, (3784), 2704 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 3784 transitions. [2025-03-08 06:01:23,402 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 3784 transitions. Word has length 64 [2025-03-08 06:01:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:23,402 INFO L471 AbstractCegarLoop]: Abstraction has 2705 states and 3784 transitions. [2025-03-08 06:01:23,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3784 transitions. [2025-03-08 06:01:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:01:23,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:23,403 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] [2025-03-08 06:01:23,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:01:23,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 396730338, now seen corresponding path program 1 times [2025-03-08 06:01:23,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:23,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873218631] [2025-03-08 06:01:23,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:23,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:01:23,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:01:23,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:23,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 06:01:23,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:23,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873218631] [2025-03-08 06:01:23,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873218631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:23,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:23,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:01:23,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494566030] [2025-03-08 06:01:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:23,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:01:23,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:23,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:01:23,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:23,535 INFO L87 Difference]: Start difference. First operand 2705 states and 3784 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:23,721 INFO L93 Difference]: Finished difference Result 8355 states and 11741 transitions. [2025-03-08 06:01:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:01:23,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 64 [2025-03-08 06:01:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:23,761 INFO L225 Difference]: With dead ends: 8355 [2025-03-08 06:01:23,761 INFO L226 Difference]: Without dead ends: 7017 [2025-03-08 06:01:23,765 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-03-08 06:01:23,766 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 373 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:23,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 438 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:01:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2025-03-08 06:01:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 4713. [2025-03-08 06:01:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4713 states, 4712 states have (on average 1.3921901528013583) internal successors, (6560), 4712 states have internal predecessors, (6560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4713 states to 4713 states and 6560 transitions. [2025-03-08 06:01:23,920 INFO L78 Accepts]: Start accepts. Automaton has 4713 states and 6560 transitions. Word has length 64 [2025-03-08 06:01:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:23,920 INFO L471 AbstractCegarLoop]: Abstraction has 4713 states and 6560 transitions. [2025-03-08 06:01:23,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:23,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4713 states and 6560 transitions. [2025-03-08 06:01:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:01:23,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:23,922 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] [2025-03-08 06:01:23,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:01:23,922 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:23,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:23,922 INFO L85 PathProgramCache]: Analyzing trace with hash -89987934, now seen corresponding path program 1 times [2025-03-08 06:01:23,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:23,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651700109] [2025-03-08 06:01:23,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:23,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:23,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:01:23,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:01:23,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:23,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:01:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:24,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651700109] [2025-03-08 06:01:24,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651700109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:24,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:24,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:01:24,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80909029] [2025-03-08 06:01:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:24,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:01:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:24,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:01:24,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:24,027 INFO L87 Difference]: Start difference. First operand 4713 states and 6560 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:24,208 INFO L93 Difference]: Finished difference Result 9691 states and 13605 transitions. [2025-03-08 06:01:24,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:01:24,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-08 06:01:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:24,232 INFO L225 Difference]: With dead ends: 9691 [2025-03-08 06:01:24,233 INFO L226 Difference]: Without dead ends: 8353 [2025-03-08 06:01:24,235 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-03-08 06:01:24,236 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 360 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:24,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 446 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8353 states. [2025-03-08 06:01:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8353 to 6049. [2025-03-08 06:01:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6049 states, 6048 states have (on average 1.3928571428571428) internal successors, (8424), 6048 states have internal predecessors, (8424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6049 states to 6049 states and 8424 transitions. [2025-03-08 06:01:24,437 INFO L78 Accepts]: Start accepts. Automaton has 6049 states and 8424 transitions. Word has length 64 [2025-03-08 06:01:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:24,437 INFO L471 AbstractCegarLoop]: Abstraction has 6049 states and 8424 transitions. [2025-03-08 06:01:24,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6049 states and 8424 transitions. [2025-03-08 06:01:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:01:24,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:24,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:24,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:01:24,439 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:24,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash 606387456, now seen corresponding path program 1 times [2025-03-08 06:01:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:24,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825993828] [2025-03-08 06:01:24,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:24,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:01:24,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:01:24,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:24,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:24,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:24,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825993828] [2025-03-08 06:01:24,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825993828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:24,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:24,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:24,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896459104] [2025-03-08 06:01:24,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:24,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:24,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:24,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:24,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:24,513 INFO L87 Difference]: Start difference. First operand 6049 states and 8424 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:24,615 INFO L93 Difference]: Finished difference Result 10391 states and 14565 transitions. [2025-03-08 06:01:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:24,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-08 06:01:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:24,626 INFO L225 Difference]: With dead ends: 10391 [2025-03-08 06:01:24,626 INFO L226 Difference]: Without dead ends: 4373 [2025-03-08 06:01:24,631 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-03-08 06:01:24,632 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 42 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:24,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 195 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:24,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2025-03-08 06:01:24,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4371. [2025-03-08 06:01:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4371 states, 4370 states have (on average 1.3954233409610983) internal successors, (6098), 4370 states have internal predecessors, (6098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4371 states to 4371 states and 6098 transitions. [2025-03-08 06:01:24,740 INFO L78 Accepts]: Start accepts. Automaton has 4371 states and 6098 transitions. Word has length 66 [2025-03-08 06:01:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:24,741 INFO L471 AbstractCegarLoop]: Abstraction has 4371 states and 6098 transitions. [2025-03-08 06:01:24,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 4371 states and 6098 transitions. [2025-03-08 06:01:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:01:24,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:24,744 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] [2025-03-08 06:01:24,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:01:24,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:24,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:24,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1213057310, now seen corresponding path program 1 times [2025-03-08 06:01:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:24,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959938511] [2025-03-08 06:01:24,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:24,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:01:24,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:01:24,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:24,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:01:24,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:24,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959938511] [2025-03-08 06:01:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959938511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:24,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:24,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:01:24,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491385738] [2025-03-08 06:01:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:24,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:01:24,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:24,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:01:24,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:01:24,849 INFO L87 Difference]: Start difference. First operand 4371 states and 6098 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:25,022 INFO L93 Difference]: Finished difference Result 8221 states and 11543 transitions. [2025-03-08 06:01:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:01:25,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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 66 [2025-03-08 06:01:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:25,038 INFO L225 Difference]: With dead ends: 8221 [2025-03-08 06:01:25,038 INFO L226 Difference]: Without dead ends: 7259 [2025-03-08 06:01:25,042 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-03-08 06:01:25,043 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 350 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:25,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 515 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7259 states. [2025-03-08 06:01:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7259 to 5331. [2025-03-08 06:01:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5331 states, 5330 states have (on average 1.3962476547842402) internal successors, (7442), 5330 states have internal predecessors, (7442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 7442 transitions. [2025-03-08 06:01:25,177 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 7442 transitions. Word has length 66 [2025-03-08 06:01:25,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:25,177 INFO L471 AbstractCegarLoop]: Abstraction has 5331 states and 7442 transitions. [2025-03-08 06:01:25,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:25,177 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 7442 transitions. [2025-03-08 06:01:25,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:01:25,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:25,178 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] [2025-03-08 06:01:25,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:01:25,179 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:25,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:25,179 INFO L85 PathProgramCache]: Analyzing trace with hash -785675157, now seen corresponding path program 1 times [2025-03-08 06:01:25,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:25,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153887763] [2025-03-08 06:01:25,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:25,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:25,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:01:25,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:01:25,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:25,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:25,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:25,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153887763] [2025-03-08 06:01:25,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153887763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:25,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:25,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:25,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977901537] [2025-03-08 06:01:25,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:25,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:25,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:25,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:25,259 INFO L87 Difference]: Start difference. First operand 5331 states and 7442 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:25,305 INFO L93 Difference]: Finished difference Result 7975 states and 11140 transitions. [2025-03-08 06:01:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:25,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-08 06:01:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:25,310 INFO L225 Difference]: With dead ends: 7975 [2025-03-08 06:01:25,310 INFO L226 Difference]: Without dead ends: 2693 [2025-03-08 06:01:25,315 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-03-08 06:01:25,315 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:25,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 180 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2025-03-08 06:01:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2691. [2025-03-08 06:01:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 2690 states have (on average 1.3762081784386617) internal successors, (3702), 2690 states have internal predecessors, (3702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 3702 transitions. [2025-03-08 06:01:25,369 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 3702 transitions. Word has length 67 [2025-03-08 06:01:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:25,369 INFO L471 AbstractCegarLoop]: Abstraction has 2691 states and 3702 transitions. [2025-03-08 06:01:25,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3702 transitions. [2025-03-08 06:01:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 06:01:25,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:25,370 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] [2025-03-08 06:01:25,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:01:25,370 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:25,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:25,371 INFO L85 PathProgramCache]: Analyzing trace with hash -580110382, now seen corresponding path program 1 times [2025-03-08 06:01:25,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:25,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715436626] [2025-03-08 06:01:25,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:25,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:25,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 06:01:25,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 06:01:25,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:25,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:25,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:25,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715436626] [2025-03-08 06:01:25,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715436626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:25,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:25,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:25,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293418688] [2025-03-08 06:01:25,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:25,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:25,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:25,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:25,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:25,433 INFO L87 Difference]: Start difference. First operand 2691 states and 3702 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:25,459 INFO L93 Difference]: Finished difference Result 4015 states and 5530 transitions. [2025-03-08 06:01:25,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:25,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-08 06:01:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:25,462 INFO L225 Difference]: With dead ends: 4015 [2025-03-08 06:01:25,462 INFO L226 Difference]: Without dead ends: 1373 [2025-03-08 06:01:25,464 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-03-08 06:01:25,465 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:25,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 165 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2025-03-08 06:01:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1371. [2025-03-08 06:01:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1370 states have (on average 1.3532846715328468) internal successors, (1854), 1370 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1854 transitions. [2025-03-08 06:01:25,510 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1854 transitions. Word has length 69 [2025-03-08 06:01:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:25,510 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1854 transitions. [2025-03-08 06:01:25,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1854 transitions. [2025-03-08 06:01:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:01:25,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:25,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:25,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:01:25,511 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:25,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1582877785, now seen corresponding path program 1 times [2025-03-08 06:01:25,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:25,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623878391] [2025-03-08 06:01:25,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:25,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:25,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:01:25,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:01:25,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:25,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:25,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:25,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623878391] [2025-03-08 06:01:25,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623878391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:25,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:25,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:25,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737626419] [2025-03-08 06:01:25,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:25,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:25,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:25,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:25,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:25,587 INFO L87 Difference]: Start difference. First operand 1371 states and 1854 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-03-08 06:01:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:25,609 INFO L93 Difference]: Finished difference Result 2035 states and 2758 transitions. [2025-03-08 06:01:25,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:25,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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 71 [2025-03-08 06:01:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:25,611 INFO L225 Difference]: With dead ends: 2035 [2025-03-08 06:01:25,611 INFO L226 Difference]: Without dead ends: 713 [2025-03-08 06:01:25,612 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-03-08 06:01:25,612 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:25,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-03-08 06:01:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 711. [2025-03-08 06:01:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.3253521126760563) internal successors, (941), 710 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 941 transitions. [2025-03-08 06:01:25,634 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 941 transitions. Word has length 71 [2025-03-08 06:01:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:25,634 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 941 transitions. [2025-03-08 06:01:25,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 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-03-08 06:01:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 941 transitions. [2025-03-08 06:01:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:01:25,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:25,635 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] [2025-03-08 06:01:25,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:01:25,635 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:25,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:25,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1148697088, now seen corresponding path program 1 times [2025-03-08 06:01:25,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:25,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575043599] [2025-03-08 06:01:25,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:25,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:25,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:01:25,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:01:25,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:25,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575043599] [2025-03-08 06:01:25,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575043599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874188491] [2025-03-08 06:01:25,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:25,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:25,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:25,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:25,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:01:26,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:01:26,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:01:26,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:26,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:26,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:01:26,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:01:26,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:01:26,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874188491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:26,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:26,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 16 [2025-03-08 06:01:26,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275078018] [2025-03-08 06:01:26,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:26,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 06:01:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:26,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 06:01:26,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:01:26,411 INFO L87 Difference]: Start difference. First operand 711 states and 941 transitions. Second operand has 16 states, 16 states have (on average 12.6875) internal successors, (203), 16 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:27,455 INFO L93 Difference]: Finished difference Result 4832 states and 6413 transitions. [2025-03-08 06:01:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 06:01:27,455 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.6875) internal successors, (203), 16 states have internal predecessors, (203), 0 states have call successors, (0), 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 73 [2025-03-08 06:01:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:27,462 INFO L225 Difference]: With dead ends: 4832 [2025-03-08 06:01:27,462 INFO L226 Difference]: Without dead ends: 4170 [2025-03-08 06:01:27,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=459, Invalid=1703, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 06:01:27,465 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1450 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:27,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 636 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:01:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2025-03-08 06:01:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4126. [2025-03-08 06:01:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4126 states, 4125 states have (on average 1.2608484848484849) internal successors, (5201), 4125 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 5201 transitions. [2025-03-08 06:01:27,583 INFO L78 Accepts]: Start accepts. Automaton has 4126 states and 5201 transitions. Word has length 73 [2025-03-08 06:01:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:27,583 INFO L471 AbstractCegarLoop]: Abstraction has 4126 states and 5201 transitions. [2025-03-08 06:01:27,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.6875) internal successors, (203), 16 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 4126 states and 5201 transitions. [2025-03-08 06:01:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:01:27,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:27,584 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] [2025-03-08 06:01:27,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:01:27,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:27,786 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:27,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash -934163952, now seen corresponding path program 1 times [2025-03-08 06:01:27,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:27,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541864404] [2025-03-08 06:01:27,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:27,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:01:27,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:01:27,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:27,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:28,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:28,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541864404] [2025-03-08 06:01:28,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541864404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:28,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44717085] [2025-03-08 06:01:28,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:28,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:28,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:28,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:28,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:01:28,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:01:28,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:01:28,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:28,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:28,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 06:01:28,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:28,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:29,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44717085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:29,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:29,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-08 06:01:29,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134853939] [2025-03-08 06:01:29,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:29,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 06:01:29,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:29,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 06:01:29,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:01:29,255 INFO L87 Difference]: Start difference. First operand 4126 states and 5201 transitions. Second operand has 21 states, 21 states have (on average 8.047619047619047) internal successors, (169), 20 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:29,706 INFO L93 Difference]: Finished difference Result 11729 states and 14859 transitions. [2025-03-08 06:01:29,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:01:29,707 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.047619047619047) internal successors, (169), 20 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-08 06:01:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:29,721 INFO L225 Difference]: With dead ends: 11729 [2025-03-08 06:01:29,721 INFO L226 Difference]: Without dead ends: 8361 [2025-03-08 06:01:29,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2025-03-08 06:01:29,727 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 538 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:29,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 480 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:01:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8361 states. [2025-03-08 06:01:29,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8361 to 8233. [2025-03-08 06:01:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8233 states, 8232 states have (on average 1.2444120505344995) internal successors, (10244), 8232 states have internal predecessors, (10244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8233 states to 8233 states and 10244 transitions. [2025-03-08 06:01:29,940 INFO L78 Accepts]: Start accepts. Automaton has 8233 states and 10244 transitions. Word has length 74 [2025-03-08 06:01:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:29,940 INFO L471 AbstractCegarLoop]: Abstraction has 8233 states and 10244 transitions. [2025-03-08 06:01:29,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.047619047619047) internal successors, (169), 20 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 8233 states and 10244 transitions. [2025-03-08 06:01:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:01:29,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:29,941 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] [2025-03-08 06:01:29,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:01:30,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-08 06:01:30,143 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:30,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:30,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1925238352, now seen corresponding path program 1 times [2025-03-08 06:01:30,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:30,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051989682] [2025-03-08 06:01:30,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:30,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:30,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:01:30,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:01:30,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:30,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:30,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:30,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051989682] [2025-03-08 06:01:30,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051989682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:30,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556045705] [2025-03-08 06:01:30,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:30,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:30,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:30,381 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:30,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:01:30,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:01:30,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:01:30,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:30,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:30,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:01:30,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:30,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:31,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556045705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:31,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:31,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-08 06:01:31,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468418941] [2025-03-08 06:01:31,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:31,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 06:01:31,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:31,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 06:01:31,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:01:31,327 INFO L87 Difference]: Start difference. First operand 8233 states and 10244 transitions. Second operand has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 25 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:32,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:32,798 INFO L93 Difference]: Finished difference Result 29807 states and 37396 transitions. [2025-03-08 06:01:32,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 06:01:32,798 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 25 states have internal predecessors, (196), 0 states have call successors, (0), 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 74 [2025-03-08 06:01:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:32,834 INFO L225 Difference]: With dead ends: 29807 [2025-03-08 06:01:32,834 INFO L226 Difference]: Without dead ends: 21894 [2025-03-08 06:01:32,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=656, Invalid=2536, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 06:01:32,845 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1155 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:32,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1172 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:01:32,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21894 states. [2025-03-08 06:01:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21894 to 21574. [2025-03-08 06:01:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21574 states, 21573 states have (on average 1.2251425392852175) internal successors, (26430), 21573 states have internal predecessors, (26430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21574 states to 21574 states and 26430 transitions. [2025-03-08 06:01:33,363 INFO L78 Accepts]: Start accepts. Automaton has 21574 states and 26430 transitions. Word has length 74 [2025-03-08 06:01:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:33,363 INFO L471 AbstractCegarLoop]: Abstraction has 21574 states and 26430 transitions. [2025-03-08 06:01:33,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.538461538461538) internal successors, (196), 25 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 21574 states and 26430 transitions. [2025-03-08 06:01:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:01:33,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:33,364 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] [2025-03-08 06:01:33,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 06:01:33,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:33,568 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:33,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash 322985588, now seen corresponding path program 1 times [2025-03-08 06:01:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:33,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589561057] [2025-03-08 06:01:33,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:33,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:33,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:01:33,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:01:33,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:33,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:35,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:35,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589561057] [2025-03-08 06:01:35,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589561057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:35,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79560868] [2025-03-08 06:01:35,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:35,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:35,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:35,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:35,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:01:35,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:01:35,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:01:35,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:35,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:35,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 06:01:35,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:36,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:37,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79560868] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:37,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:37,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 15] total 55 [2025-03-08 06:01:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536432837] [2025-03-08 06:01:37,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:37,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 06:01:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:37,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 06:01:37,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2751, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 06:01:37,998 INFO L87 Difference]: Start difference. First operand 21574 states and 26430 transitions. Second operand has 55 states, 55 states have (on average 3.690909090909091) internal successors, (203), 55 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:50,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:50,324 INFO L93 Difference]: Finished difference Result 71439 states and 88350 transitions. [2025-03-08 06:01:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2025-03-08 06:01:50,324 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.690909090909091) internal successors, (203), 55 states have internal predecessors, (203), 0 states have call successors, (0), 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 76 [2025-03-08 06:01:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:50,425 INFO L225 Difference]: With dead ends: 71439 [2025-03-08 06:01:50,425 INFO L226 Difference]: Without dead ends: 63116 [2025-03-08 06:01:50,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9760 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=5940, Invalid=24860, Unknown=0, NotChecked=0, Total=30800 [2025-03-08 06:01:50,447 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 6022 mSDsluCounter, 5349 mSDsCounter, 0 mSdLazyCounter, 5233 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6022 SdHoareTripleChecker+Valid, 5556 SdHoareTripleChecker+Invalid, 5369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 5233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:50,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6022 Valid, 5556 Invalid, 5369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 5233 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 06:01:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63116 states. [2025-03-08 06:01:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63116 to 22125. [2025-03-08 06:01:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22125 states, 22124 states have (on average 1.2220665340806365) internal successors, (27037), 22124 states have internal predecessors, (27037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22125 states to 22125 states and 27037 transitions. [2025-03-08 06:01:51,235 INFO L78 Accepts]: Start accepts. Automaton has 22125 states and 27037 transitions. Word has length 76 [2025-03-08 06:01:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:51,235 INFO L471 AbstractCegarLoop]: Abstraction has 22125 states and 27037 transitions. [2025-03-08 06:01:51,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.690909090909091) internal successors, (203), 55 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:01:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 22125 states and 27037 transitions. [2025-03-08 06:01:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:01:51,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:51,237 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] [2025-03-08 06:01:51,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 06:01:51,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:51,438 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:51,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1533885237, now seen corresponding path program 1 times [2025-03-08 06:01:51,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469711685] [2025-03-08 06:01:51,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:51,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:51,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:01:51,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:01:51,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:51,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:52,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:52,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469711685] [2025-03-08 06:01:52,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469711685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:52,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123370519] [2025-03-08 06:01:52,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:52,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:52,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:52,294 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:52,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:01:52,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:01:52,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:01:52,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:52,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:52,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 06:01:52,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:53,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:54,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123370519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:54,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:54,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 47 [2025-03-08 06:01:54,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433476112] [2025-03-08 06:01:54,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:54,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 06:01:54,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:54,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 06:01:54,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1980, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 06:01:54,824 INFO L87 Difference]: Start difference. First operand 22125 states and 27037 transitions. Second operand has 47 states, 47 states have (on average 4.425531914893617) internal successors, (208), 47 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:21,925 INFO L93 Difference]: Finished difference Result 69740 states and 87115 transitions. [2025-03-08 06:02:21,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2025-03-08 06:02:21,926 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 4.425531914893617) internal successors, (208), 47 states have internal predecessors, (208), 0 states have call successors, (0), 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 76 [2025-03-08 06:02:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:21,994 INFO L225 Difference]: With dead ends: 69740 [2025-03-08 06:02:21,995 INFO L226 Difference]: Without dead ends: 59886 [2025-03-08 06:02:22,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22535 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=10324, Invalid=47998, Unknown=0, NotChecked=0, Total=58322 [2025-03-08 06:02:22,012 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 9329 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 3940 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9329 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 4120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 3940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:22,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9329 Valid, 3466 Invalid, 4120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 3940 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 06:02:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59886 states. [2025-03-08 06:02:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59886 to 23671. [2025-03-08 06:02:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23671 states, 23670 states have (on average 1.2292353189691592) internal successors, (29096), 23670 states have internal predecessors, (29096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23671 states to 23671 states and 29096 transitions. [2025-03-08 06:02:22,995 INFO L78 Accepts]: Start accepts. Automaton has 23671 states and 29096 transitions. Word has length 76 [2025-03-08 06:02:22,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:22,995 INFO L471 AbstractCegarLoop]: Abstraction has 23671 states and 29096 transitions. [2025-03-08 06:02:22,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 4.425531914893617) internal successors, (208), 47 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 23671 states and 29096 transitions. [2025-03-08 06:02:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:02:22,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:22,996 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] [2025-03-08 06:02:23,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 06:02:23,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 06:02:23,201 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:23,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:23,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1187387686, now seen corresponding path program 1 times [2025-03-08 06:02:23,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:23,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292144362] [2025-03-08 06:02:23,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:23,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:23,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:02:23,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:02:23,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:23,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292144362] [2025-03-08 06:02:23,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292144362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:02:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175842506] [2025-03-08 06:02:23,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:23,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:02:23,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:02:23,670 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:02:23,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 06:02:23,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:02:23,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:02:23,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:23,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:23,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 06:02:23,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:02:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:26,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:02:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:29,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175842506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:02:29,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:02:29,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27, 22] total 59 [2025-03-08 06:02:29,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428539901] [2025-03-08 06:02:29,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:02:29,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-08 06:02:29,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:29,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-08 06:02:29,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=2901, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 06:02:29,399 INFO L87 Difference]: Start difference. First operand 23671 states and 29096 transitions. Second operand has 59 states, 59 states have (on average 3.5762711864406778) internal successors, (211), 59 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-03-08 06:02:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:45,203 INFO L93 Difference]: Finished difference Result 37689 states and 46175 transitions. [2025-03-08 06:02:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-03-08 06:02:45,204 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 3.5762711864406778) internal successors, (211), 59 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 77 [2025-03-08 06:02:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:45,232 INFO L225 Difference]: With dead ends: 37689 [2025-03-08 06:02:45,232 INFO L226 Difference]: Without dead ends: 25686 [2025-03-08 06:02:45,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5889 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=3834, Invalid=14256, Unknown=0, NotChecked=0, Total=18090 [2025-03-08 06:02:45,242 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1723 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 2861 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:45,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1723 Valid, 1973 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2861 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 06:02:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25686 states. [2025-03-08 06:02:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25686 to 19952. [2025-03-08 06:02:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19952 states, 19951 states have (on average 1.2230965866372614) internal successors, (24402), 19951 states have internal predecessors, (24402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19952 states to 19952 states and 24402 transitions. [2025-03-08 06:02:45,994 INFO L78 Accepts]: Start accepts. Automaton has 19952 states and 24402 transitions. Word has length 77 [2025-03-08 06:02:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:45,995 INFO L471 AbstractCegarLoop]: Abstraction has 19952 states and 24402 transitions. [2025-03-08 06:02:45,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 3.5762711864406778) internal successors, (211), 59 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-03-08 06:02:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 19952 states and 24402 transitions. [2025-03-08 06:02:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:02:45,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:45,996 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] [2025-03-08 06:02:46,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 06:02:46,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:02:46,196 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:46,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1627548773, now seen corresponding path program 1 times [2025-03-08 06:02:46,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:46,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487310648] [2025-03-08 06:02:46,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:46,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:02:46,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:02:46,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:46,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:46,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:46,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487310648] [2025-03-08 06:02:46,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487310648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:02:46,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003054165] [2025-03-08 06:02:46,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:46,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:02:46,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:02:46,652 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:02:46,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 06:02:46,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:02:46,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:02:46,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:46,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:46,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 06:02:46,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:02:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:47,303 INFO L312 TraceCheckSpWp]: Computing backward predicates...