./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-var-start-time.3.ufo.BOUNDED-6.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 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:49:05,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:49:06,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:49:06,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:49:06,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:49:06,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:49:06,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:49:06,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:49:06,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:49:06,063 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:49:06,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:49:06,063 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:49:06,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:49:06,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:49:06,064 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:49:06,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:49:06,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:49:06,064 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:49:06,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:49:06,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:49:06,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:49:06,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:49:06,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:49:06,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:49:06,064 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:49:06,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:49:06,065 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:49:06,065 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:49:06,065 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:49:06,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:49:06,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:49:06,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:49:06,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:49:06,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:49:06,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:49:06,065 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:49:06,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:49:06,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:49:06,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:49:06,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:49:06,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:49:06,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:49:06,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:49:06,066 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 -> 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b [2025-03-03 14:49:06,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:49:06,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:49:06,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:49:06,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:49:06,307 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:49:06,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2025-03-03 14:49:07,480 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf28a271/c3f44543dc804afab8bc74ff519a307e/FLAGd779687fd [2025-03-03 14:49:07,749 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:49:07,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2025-03-03 14:49:07,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf28a271/c3f44543dc804afab8bc74ff519a307e/FLAGd779687fd [2025-03-03 14:49:08,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf28a271/c3f44543dc804afab8bc74ff519a307e [2025-03-03 14:49:08,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:49:08,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:49:08,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:49:08,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:49:08,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:49:08,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49920bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08, skipping insertion in model container [2025-03-03 14:49:08,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:49:08,233 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-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2025-03-03 14:49:08,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:49:08,246 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:49:08,282 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-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2025-03-03 14:49:08,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:49:08,296 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:49:08,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08 WrapperNode [2025-03-03 14:49:08,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:49:08,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:49:08,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:49:08,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:49:08,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,329 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2025-03-03 14:49:08,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:49:08,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:49:08,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:49:08,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:49:08,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,344 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-03 14:49:08,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:49:08,353 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:49:08,353 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:49:08,353 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:49:08,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (1/1) ... [2025-03-03 14:49:08,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:49:08,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:49:08,379 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-03 14:49:08,383 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-03 14:49:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:49:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:49:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:49:08,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:49:08,455 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:49:08,457 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:49:08,716 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-03 14:49:08,716 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:49:08,724 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:49:08,724 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:49:08,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:49:08 BoogieIcfgContainer [2025-03-03 14:49:08,725 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:49:08,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:49:08,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:49:08,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:49:08,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:49:08" (1/3) ... [2025-03-03 14:49:08,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e984dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:49:08, skipping insertion in model container [2025-03-03 14:49:08,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:49:08" (2/3) ... [2025-03-03 14:49:08,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e984dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:49:08, skipping insertion in model container [2025-03-03 14:49:08,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:49:08" (3/3) ... [2025-03-03 14:49:08,733 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2025-03-03 14:49:08,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:49:08,746 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c that has 1 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:49:08,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:49:08,800 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;@466b0e3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:49:08,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:49:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.703125) internal successors, (109), 65 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-03 14:49:08,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 14:49:08,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:08,810 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] [2025-03-03 14:49:08,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:08,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:08,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1703050643, now seen corresponding path program 1 times [2025-03-03 14:49:08,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:08,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805833939] [2025-03-03 14:49:08,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:08,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:08,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:49:08,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:49:08,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:08,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:08,988 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-03 14:49:08,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:08,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805833939] [2025-03-03 14:49:08,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805833939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:08,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:08,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:49:08,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147962673] [2025-03-03 14:49:08,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:08,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:49:08,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:09,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:49:09,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:49:09,015 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.703125) internal successors, (109), 65 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-03 14:49:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:09,029 INFO L93 Difference]: Finished difference Result 110 states and 178 transitions. [2025-03-03 14:49:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:49:09,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-03 14:49:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:09,037 INFO L225 Difference]: With dead ends: 110 [2025-03-03 14:49:09,037 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 14:49:09,040 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-03 14:49:09,041 INFO L435 NwaCegarLoop]: 107 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, 107 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-03 14:49:09,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 14:49:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-03 14:49:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 62 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-03 14:49:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 104 transitions. [2025-03-03 14:49:09,072 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 104 transitions. Word has length 25 [2025-03-03 14:49:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:09,072 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 104 transitions. [2025-03-03 14:49:09,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-03 14:49:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2025-03-03 14:49:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 14:49:09,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:09,073 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] [2025-03-03 14:49:09,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:49:09,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:09,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1294226418, now seen corresponding path program 1 times [2025-03-03 14:49:09,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:09,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528872291] [2025-03-03 14:49:09,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:09,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:09,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:49:09,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:49:09,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:09,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:09,234 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-03 14:49:09,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:09,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528872291] [2025-03-03 14:49:09,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528872291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:09,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:09,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:49:09,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040062866] [2025-03-03 14:49:09,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:09,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:49:09,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:09,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:49:09,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:49:09,236 INFO L87 Difference]: Start difference. First operand 63 states and 104 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-03 14:49:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:09,302 INFO L93 Difference]: Finished difference Result 147 states and 236 transitions. [2025-03-03 14:49:09,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:49:09,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-03 14:49:09,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:09,305 INFO L225 Difference]: With dead ends: 147 [2025-03-03 14:49:09,305 INFO L226 Difference]: Without dead ends: 103 [2025-03-03 14:49:09,305 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-03 14:49:09,306 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 63 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:09,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 377 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:49:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-03 14:49:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 63. [2025-03-03 14:49:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-03 14:49:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2025-03-03 14:49:09,312 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 25 [2025-03-03 14:49:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:09,314 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2025-03-03 14:49:09,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-03 14:49:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2025-03-03 14:49:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 14:49:09,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:09,317 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] [2025-03-03 14:49:09,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:49:09,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:09,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:09,317 INFO L85 PathProgramCache]: Analyzing trace with hash -76370206, now seen corresponding path program 1 times [2025-03-03 14:49:09,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:09,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178370078] [2025-03-03 14:49:09,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:09,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:09,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 14:49:09,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 14:49:09,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:09,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:09,418 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-03 14:49:09,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178370078] [2025-03-03 14:49:09,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178370078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:09,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:09,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:09,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398119368] [2025-03-03 14:49:09,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:09,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:09,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:09,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:09,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:09,420 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-03 14:49:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:09,448 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2025-03-03 14:49:09,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:09,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-03 14:49:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:09,451 INFO L225 Difference]: With dead ends: 135 [2025-03-03 14:49:09,451 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 14:49:09,451 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-03 14:49:09,451 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:09,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 194 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 14:49:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-03-03 14:49:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 92 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-03-03 14:49:09,458 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 41 [2025-03-03 14:49:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:09,458 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-03 14:49:09,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-03 14:49:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-03-03 14:49:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 14:49:09,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:09,459 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] [2025-03-03 14:49:09,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:49:09,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:09,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:09,460 INFO L85 PathProgramCache]: Analyzing trace with hash 112567055, now seen corresponding path program 1 times [2025-03-03 14:49:09,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375533867] [2025-03-03 14:49:09,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:09,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 14:49:09,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 14:49:09,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:09,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:09,599 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-03 14:49:09,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375533867] [2025-03-03 14:49:09,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375533867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:09,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:09,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:49:09,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525858679] [2025-03-03 14:49:09,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:09,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:49:09,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:09,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:49:09,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:49:09,600 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-03 14:49:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:09,670 INFO L93 Difference]: Finished difference Result 373 states and 583 transitions. [2025-03-03 14:49:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:49:09,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-03-03 14:49:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:09,672 INFO L225 Difference]: With dead ends: 373 [2025-03-03 14:49:09,672 INFO L226 Difference]: Without dead ends: 303 [2025-03-03 14:49:09,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:49:09,673 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 362 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:09,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 291 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-03 14:49:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 161. [2025-03-03 14:49:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.5125) internal successors, (242), 160 states have internal predecessors, (242), 0 states have call successors, (0), 0 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-03 14:49:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 242 transitions. [2025-03-03 14:49:09,686 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 242 transitions. Word has length 41 [2025-03-03 14:49:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:09,686 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 242 transitions. [2025-03-03 14:49:09,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-03 14:49:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 242 transitions. [2025-03-03 14:49:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 14:49:09,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:09,690 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] [2025-03-03 14:49:09,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:49:09,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:09,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:09,690 INFO L85 PathProgramCache]: Analyzing trace with hash -775774379, now seen corresponding path program 1 times [2025-03-03 14:49:09,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:09,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274020870] [2025-03-03 14:49:09,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:09,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:09,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-03 14:49:09,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 14:49:09,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:09,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:09,950 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-03 14:49:09,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:09,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274020870] [2025-03-03 14:49:09,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274020870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:09,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:09,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:49:09,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145678390] [2025-03-03 14:49:09,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:09,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:49:09,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:09,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:49:09,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:49:09,954 INFO L87 Difference]: Start difference. First operand 161 states and 242 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-03 14:49:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:09,999 INFO L93 Difference]: Finished difference Result 175 states and 259 transitions. [2025-03-03 14:49:10,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:49:10,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-03-03 14:49:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:10,002 INFO L225 Difference]: With dead ends: 175 [2025-03-03 14:49:10,002 INFO L226 Difference]: Without dead ends: 173 [2025-03-03 14:49:10,003 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-03 14:49:10,004 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:10,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 552 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:10,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-03 14:49:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-03 14:49:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.4767441860465116) internal successors, (254), 172 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 254 transitions. [2025-03-03 14:49:10,019 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 254 transitions. Word has length 42 [2025-03-03 14:49:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:10,020 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 254 transitions. [2025-03-03 14:49:10,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-03 14:49:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 254 transitions. [2025-03-03 14:49:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 14:49:10,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:10,021 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-03 14:49:10,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:49:10,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:10,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:10,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1809517583, now seen corresponding path program 1 times [2025-03-03 14:49:10,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:10,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105829249] [2025-03-03 14:49:10,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:10,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 14:49:10,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 14:49:10,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:10,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:10,110 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-03 14:49:10,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:10,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105829249] [2025-03-03 14:49:10,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105829249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:10,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:10,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:10,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122423275] [2025-03-03 14:49:10,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:10,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:10,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:10,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:10,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:10,112 INFO L87 Difference]: Start difference. First operand 173 states and 254 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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-03 14:49:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:10,126 INFO L93 Difference]: Finished difference Result 394 states and 593 transitions. [2025-03-03 14:49:10,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:10,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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-03 14:49:10,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:10,128 INFO L225 Difference]: With dead ends: 394 [2025-03-03 14:49:10,128 INFO L226 Difference]: Without dead ends: 244 [2025-03-03 14:49:10,128 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-03 14:49:10,129 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 37 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:10,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-03 14:49:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2025-03-03 14:49:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.4896265560165975) internal successors, (359), 241 states have internal predecessors, (359), 0 states have call successors, (0), 0 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-03 14:49:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2025-03-03 14:49:10,137 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 43 [2025-03-03 14:49:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:10,137 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2025-03-03 14:49:10,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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-03 14:49:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2025-03-03 14:49:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 14:49:10,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:10,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:10,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:49:10,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:10,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1295937826, now seen corresponding path program 1 times [2025-03-03 14:49:10,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:10,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113078645] [2025-03-03 14:49:10,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:10,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:10,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 14:49:10,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 14:49:10,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:10,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:10,184 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-03 14:49:10,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:10,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113078645] [2025-03-03 14:49:10,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113078645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:10,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:10,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:10,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617906005] [2025-03-03 14:49:10,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:10,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:10,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:10,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:10,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:10,186 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-03 14:49:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:10,202 INFO L93 Difference]: Finished difference Result 628 states and 943 transitions. [2025-03-03 14:49:10,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:10,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-03 14:49:10,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:10,204 INFO L225 Difference]: With dead ends: 628 [2025-03-03 14:49:10,204 INFO L226 Difference]: Without dead ends: 411 [2025-03-03 14:49:10,204 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-03 14:49:10,205 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 44 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:10,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-03 14:49:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2025-03-03 14:49:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 1.4754901960784315) internal successors, (602), 408 states have internal predecessors, (602), 0 states have call successors, (0), 0 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-03 14:49:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 602 transitions. [2025-03-03 14:49:10,229 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 602 transitions. Word has length 44 [2025-03-03 14:49:10,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:10,230 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 602 transitions. [2025-03-03 14:49:10,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-03 14:49:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 602 transitions. [2025-03-03 14:49:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 14:49:10,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:10,233 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] [2025-03-03 14:49:10,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:49:10,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:10,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash 137261936, now seen corresponding path program 1 times [2025-03-03 14:49:10,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:10,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847424638] [2025-03-03 14:49:10,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:10,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:10,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 14:49:10,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 14:49:10,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:10,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:10,276 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-03 14:49:10,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:10,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847424638] [2025-03-03 14:49:10,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847424638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:10,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:10,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:10,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929935627] [2025-03-03 14:49:10,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:10,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:10,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:10,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:10,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:10,278 INFO L87 Difference]: Start difference. First operand 409 states and 602 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-03 14:49:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:10,298 INFO L93 Difference]: Finished difference Result 1081 states and 1588 transitions. [2025-03-03 14:49:10,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:10,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-03 14:49:10,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:10,301 INFO L225 Difference]: With dead ends: 1081 [2025-03-03 14:49:10,301 INFO L226 Difference]: Without dead ends: 697 [2025-03-03 14:49:10,303 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-03 14:49:10,303 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 48 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:10,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 191 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-03-03 14:49:10,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 695. [2025-03-03 14:49:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.4380403458213256) internal successors, (998), 694 states have internal predecessors, (998), 0 states have call successors, (0), 0 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-03 14:49:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 998 transitions. [2025-03-03 14:49:10,327 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 998 transitions. Word has length 44 [2025-03-03 14:49:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:10,327 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 998 transitions. [2025-03-03 14:49:10,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-03 14:49:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 998 transitions. [2025-03-03 14:49:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:49:10,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:10,328 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:10,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:49:10,329 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:10,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:10,329 INFO L85 PathProgramCache]: Analyzing trace with hash -90192710, now seen corresponding path program 1 times [2025-03-03 14:49:10,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:10,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540618374] [2025-03-03 14:49:10,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:10,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:10,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:49:10,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:49:10,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:10,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:10,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:10,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540618374] [2025-03-03 14:49:10,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540618374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:10,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:10,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:10,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113745665] [2025-03-03 14:49:10,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:10,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:10,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:10,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:10,439 INFO L87 Difference]: Start difference. First operand 695 states and 998 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-03 14:49:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:10,465 INFO L93 Difference]: Finished difference Result 1367 states and 1972 transitions. [2025-03-03 14:49:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:10,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 14:49:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:10,468 INFO L225 Difference]: With dead ends: 1367 [2025-03-03 14:49:10,468 INFO L226 Difference]: Without dead ends: 697 [2025-03-03 14:49:10,469 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-03 14:49:10,469 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:10,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-03-03 14:49:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 695. [2025-03-03 14:49:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.420749279538905) internal successors, (986), 694 states have internal predecessors, (986), 0 states have call successors, (0), 0 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-03 14:49:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 986 transitions. [2025-03-03 14:49:10,498 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 986 transitions. Word has length 62 [2025-03-03 14:49:10,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:10,498 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 986 transitions. [2025-03-03 14:49:10,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-03 14:49:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 986 transitions. [2025-03-03 14:49:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:49:10,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:10,499 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] [2025-03-03 14:49:10,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:49:10,499 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:10,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash -389830323, now seen corresponding path program 1 times [2025-03-03 14:49:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:10,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281487505] [2025-03-03 14:49:10,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:10,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:49:10,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:49:10,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:10,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:10,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:10,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281487505] [2025-03-03 14:49:10,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281487505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:10,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:10,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672449394] [2025-03-03 14:49:10,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:10,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:10,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:10,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:10,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:10,595 INFO L87 Difference]: Start difference. First operand 695 states and 986 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-03 14:49:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:10,613 INFO L93 Difference]: Finished difference Result 1033 states and 1468 transitions. [2025-03-03 14:49:10,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:10,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 14:49:10,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:10,615 INFO L225 Difference]: With dead ends: 1033 [2025-03-03 14:49:10,615 INFO L226 Difference]: Without dead ends: 363 [2025-03-03 14:49:10,615 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-03 14:49:10,616 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:10,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-03 14:49:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2025-03-03 14:49:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.3888888888888888) internal successors, (500), 360 states have internal predecessors, (500), 0 states have call successors, (0), 0 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-03 14:49:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 500 transitions. [2025-03-03 14:49:10,630 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 500 transitions. Word has length 62 [2025-03-03 14:49:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:10,630 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 500 transitions. [2025-03-03 14:49:10,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-03 14:49:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 500 transitions. [2025-03-03 14:49:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:49:10,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:10,631 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] [2025-03-03 14:49:10,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:49:10,631 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:10,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:10,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1008808096, now seen corresponding path program 1 times [2025-03-03 14:49:10,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:10,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22789532] [2025-03-03 14:49:10,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:10,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:10,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:49:10,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:49:10,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:10,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:12,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:12,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22789532] [2025-03-03 14:49:12,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22789532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:49:12,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860322349] [2025-03-03 14:49:12,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:12,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:49:12,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:49:12,645 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-03 14:49:12,646 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-03 14:49:12,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:49:12,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:49:12,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:12,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:12,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:49:12,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:49:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:13,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:49:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:13,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860322349] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:49:13,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:49:13,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 24 [2025-03-03 14:49:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774481023] [2025-03-03 14:49:13,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:49:13,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 14:49:13,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:13,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 14:49:13,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:49:13,656 INFO L87 Difference]: Start difference. First operand 361 states and 500 transitions. Second operand has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:21,429 INFO L93 Difference]: Finished difference Result 3546 states and 4902 transitions. [2025-03-03 14:49:21,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-03-03 14:49:21,431 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 14:49:21,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:21,442 INFO L225 Difference]: With dead ends: 3546 [2025-03-03 14:49:21,443 INFO L226 Difference]: Without dead ends: 3210 [2025-03-03 14:49:21,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6353 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3071, Invalid=14221, Unknown=0, NotChecked=0, Total=17292 [2025-03-03 14:49:21,450 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 4195 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4195 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:21,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4195 Valid, 1175 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:49:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2025-03-03 14:49:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 2172. [2025-03-03 14:49:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2171 states have (on average 1.3735605711653616) internal successors, (2982), 2171 states have internal predecessors, (2982), 0 states have call successors, (0), 0 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-03 14:49:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 2982 transitions. [2025-03-03 14:49:21,511 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 2982 transitions. Word has length 62 [2025-03-03 14:49:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:21,512 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 2982 transitions. [2025-03-03 14:49:21,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.291666666666667) internal successors, (175), 24 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2982 transitions. [2025-03-03 14:49:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:49:21,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:21,513 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:21,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:49:21,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:49:21,714 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:21,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2023061580, now seen corresponding path program 1 times [2025-03-03 14:49:21,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:21,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91444582] [2025-03-03 14:49:21,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:21,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:21,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:49:21,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:49:21,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:21,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:49:21,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:21,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91444582] [2025-03-03 14:49:21,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91444582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:21,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:21,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:49:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156585249] [2025-03-03 14:49:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:21,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:49:21,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:21,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:49:21,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:49:21,789 INFO L87 Difference]: Start difference. First operand 2172 states and 2982 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-03 14:49:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:21,883 INFO L93 Difference]: Finished difference Result 5241 states and 7261 transitions. [2025-03-03 14:49:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:49:21,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 63 [2025-03-03 14:49:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:21,896 INFO L225 Difference]: With dead ends: 5241 [2025-03-03 14:49:21,896 INFO L226 Difference]: Without dead ends: 4226 [2025-03-03 14:49:21,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:49:21,899 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 216 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:21,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 425 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4226 states. [2025-03-03 14:49:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4226 to 3133. [2025-03-03 14:49:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 3132 states have (on average 1.3690932311621966) internal successors, (4288), 3132 states have internal predecessors, (4288), 0 states have call successors, (0), 0 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-03 14:49:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4288 transitions. [2025-03-03 14:49:22,007 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4288 transitions. Word has length 63 [2025-03-03 14:49:22,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:22,007 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 4288 transitions. [2025-03-03 14:49:22,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-03 14:49:22,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4288 transitions. [2025-03-03 14:49:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:49:22,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:22,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:22,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:49:22,008 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:22,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:22,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1882956040, now seen corresponding path program 1 times [2025-03-03 14:49:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:22,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493704674] [2025-03-03 14:49:22,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:22,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:22,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:49:22,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:49:22,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:22,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:49:22,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:22,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493704674] [2025-03-03 14:49:22,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493704674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:22,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:22,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:49:22,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992618026] [2025-03-03 14:49:22,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:22,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:49:22,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:22,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:49:22,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:49:22,085 INFO L87 Difference]: Start difference. First operand 3133 states and 4288 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-03 14:49:22,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:22,194 INFO L93 Difference]: Finished difference Result 6253 states and 8638 transitions. [2025-03-03 14:49:22,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:49:22,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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 63 [2025-03-03 14:49:22,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:22,210 INFO L225 Difference]: With dead ends: 6253 [2025-03-03 14:49:22,210 INFO L226 Difference]: Without dead ends: 5178 [2025-03-03 14:49:22,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:49:22,216 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 218 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:22,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 366 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2025-03-03 14:49:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 4152. [2025-03-03 14:49:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4151 states have (on average 1.3659359190556493) internal successors, (5670), 4151 states have internal predecessors, (5670), 0 states have call successors, (0), 0 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-03 14:49:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 5670 transitions. [2025-03-03 14:49:22,380 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 5670 transitions. Word has length 63 [2025-03-03 14:49:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:22,380 INFO L471 AbstractCegarLoop]: Abstraction has 4152 states and 5670 transitions. [2025-03-03 14:49:22,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-03 14:49:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 5670 transitions. [2025-03-03 14:49:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:49:22,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:22,381 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:22,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:49:22,382 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:22,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:22,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1249229689, now seen corresponding path program 1 times [2025-03-03 14:49:22,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:22,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451090364] [2025-03-03 14:49:22,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:22,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:22,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:49:22,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:49:22,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:22,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:22,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:22,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451090364] [2025-03-03 14:49:22,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451090364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:22,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:22,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:22,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713294960] [2025-03-03 14:49:22,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:22,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:22,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:22,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:22,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:22,454 INFO L87 Difference]: Start difference. First operand 4152 states and 5670 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-03 14:49:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:22,593 INFO L93 Difference]: Finished difference Result 12024 states and 16282 transitions. [2025-03-03 14:49:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:22,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-03 14:49:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:22,615 INFO L225 Difference]: With dead ends: 12024 [2025-03-03 14:49:22,616 INFO L226 Difference]: Without dead ends: 7999 [2025-03-03 14:49:22,623 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-03 14:49:22,625 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:22,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 212 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7999 states. [2025-03-03 14:49:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7999 to 7997. [2025-03-03 14:49:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7997 states, 7996 states have (on average 1.3267883941970986) internal successors, (10609), 7996 states have internal predecessors, (10609), 0 states have call successors, (0), 0 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-03 14:49:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7997 states to 7997 states and 10609 transitions. [2025-03-03 14:49:22,844 INFO L78 Accepts]: Start accepts. Automaton has 7997 states and 10609 transitions. Word has length 64 [2025-03-03 14:49:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:22,845 INFO L471 AbstractCegarLoop]: Abstraction has 7997 states and 10609 transitions. [2025-03-03 14:49:22,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-03 14:49:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 7997 states and 10609 transitions. [2025-03-03 14:49:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:49:22,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:22,846 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:22,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:49:22,847 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:22,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash 111310681, now seen corresponding path program 1 times [2025-03-03 14:49:22,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:22,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454452201] [2025-03-03 14:49:22,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:22,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:22,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:49:22,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:49:22,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:22,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:22,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:22,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454452201] [2025-03-03 14:49:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454452201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:22,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:22,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:22,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073572273] [2025-03-03 14:49:22,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:22,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:22,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:22,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:22,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:22,910 INFO L87 Difference]: Start difference. First operand 7997 states and 10609 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-03 14:49:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:23,137 INFO L93 Difference]: Finished difference Result 20910 states and 27654 transitions. [2025-03-03 14:49:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:23,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-03 14:49:23,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:23,168 INFO L225 Difference]: With dead ends: 20910 [2025-03-03 14:49:23,168 INFO L226 Difference]: Without dead ends: 13180 [2025-03-03 14:49:23,174 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-03 14:49:23,174 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 40 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:23,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 164 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:23,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13180 states. [2025-03-03 14:49:23,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13180 to 13178. [2025-03-03 14:49:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13178 states, 13177 states have (on average 1.301434317371177) internal successors, (17149), 13177 states have internal predecessors, (17149), 0 states have call successors, (0), 0 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-03 14:49:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13178 states to 13178 states and 17149 transitions. [2025-03-03 14:49:23,580 INFO L78 Accepts]: Start accepts. Automaton has 13178 states and 17149 transitions. Word has length 64 [2025-03-03 14:49:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:23,581 INFO L471 AbstractCegarLoop]: Abstraction has 13178 states and 17149 transitions. [2025-03-03 14:49:23,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-03 14:49:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 13178 states and 17149 transitions. [2025-03-03 14:49:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:49:23,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:23,582 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:23,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:49:23,582 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:23,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:23,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1534170157, now seen corresponding path program 1 times [2025-03-03 14:49:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:23,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548987231] [2025-03-03 14:49:23,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:23,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:23,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:49:23,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:49:23,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:23,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:23,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548987231] [2025-03-03 14:49:23,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548987231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:23,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:23,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:23,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157191173] [2025-03-03 14:49:23,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:23,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:23,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:23,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:23,617 INFO L87 Difference]: Start difference. First operand 13178 states and 17149 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-03 14:49:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:23,913 INFO L93 Difference]: Finished difference Result 30431 states and 39637 transitions. [2025-03-03 14:49:23,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:23,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-03 14:49:23,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:23,948 INFO L225 Difference]: With dead ends: 30431 [2025-03-03 14:49:23,948 INFO L226 Difference]: Without dead ends: 17634 [2025-03-03 14:49:23,955 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-03 14:49:23,956 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 40 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:23,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 171 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:23,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17634 states. [2025-03-03 14:49:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17634 to 17632. [2025-03-03 14:49:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17632 states, 17631 states have (on average 1.2780897283194375) internal successors, (22534), 17631 states have internal predecessors, (22534), 0 states have call successors, (0), 0 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-03 14:49:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17632 states to 17632 states and 22534 transitions. [2025-03-03 14:49:24,331 INFO L78 Accepts]: Start accepts. Automaton has 17632 states and 22534 transitions. Word has length 64 [2025-03-03 14:49:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:24,331 INFO L471 AbstractCegarLoop]: Abstraction has 17632 states and 22534 transitions. [2025-03-03 14:49:24,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-03 14:49:24,331 INFO L276 IsEmpty]: Start isEmpty. Operand 17632 states and 22534 transitions. [2025-03-03 14:49:24,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:49:24,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:24,333 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:24,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:49:24,333 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:24,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:24,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2081628779, now seen corresponding path program 1 times [2025-03-03 14:49:24,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:24,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708148691] [2025-03-03 14:49:24,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:24,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:24,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:49:24,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:49:24,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:24,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:49:24,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:24,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708148691] [2025-03-03 14:49:24,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708148691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:24,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:24,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:49:24,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347088780] [2025-03-03 14:49:24,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:24,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:49:24,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:24,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:49:24,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:49:24,394 INFO L87 Difference]: Start difference. First operand 17632 states and 22534 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-03 14:49:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:24,924 INFO L93 Difference]: Finished difference Result 29143 states and 37579 transitions. [2025-03-03 14:49:24,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:49:24,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-03 14:49:24,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:24,968 INFO L225 Difference]: With dead ends: 29143 [2025-03-03 14:49:24,968 INFO L226 Difference]: Without dead ends: 23154 [2025-03-03 14:49:24,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:49:24,979 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 220 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:24,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 388 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23154 states. [2025-03-03 14:49:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23154 to 21691. [2025-03-03 14:49:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21691 states, 21690 states have (on average 1.2714153988012908) internal successors, (27577), 21690 states have internal predecessors, (27577), 0 states have call successors, (0), 0 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-03 14:49:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21691 states to 21691 states and 27577 transitions. [2025-03-03 14:49:25,660 INFO L78 Accepts]: Start accepts. Automaton has 21691 states and 27577 transitions. Word has length 64 [2025-03-03 14:49:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:25,660 INFO L471 AbstractCegarLoop]: Abstraction has 21691 states and 27577 transitions. [2025-03-03 14:49:25,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 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-03 14:49:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 21691 states and 27577 transitions. [2025-03-03 14:49:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:49:25,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:25,662 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:25,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:49:25,662 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:25,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:25,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1778418228, now seen corresponding path program 1 times [2025-03-03 14:49:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:25,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342332395] [2025-03-03 14:49:25,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:25,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:49:25,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:49:25,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:25,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:25,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:25,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342332395] [2025-03-03 14:49:25,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342332395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:49:25,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025425436] [2025-03-03 14:49:25,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:25,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:49:25,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:49:25,887 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-03 14:49:25,889 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-03 14:49:25,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:49:25,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:49:25,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:25,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:25,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 14:49:25,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:49:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:26,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:49:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025425436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:49:27,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:49:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 16] total 36 [2025-03-03 14:49:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963854070] [2025-03-03 14:49:27,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:49:27,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 14:49:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:27,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 14:49:27,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:49:27,280 INFO L87 Difference]: Start difference. First operand 21691 states and 27577 transitions. Second operand has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 36 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:35,505 INFO L93 Difference]: Finished difference Result 101387 states and 129532 transitions. [2025-03-03 14:49:35,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2025-03-03 14:49:35,506 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 36 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 14:49:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:35,640 INFO L225 Difference]: With dead ends: 101387 [2025-03-03 14:49:35,641 INFO L226 Difference]: Without dead ends: 79869 [2025-03-03 14:49:35,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14190 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=6751, Invalid=30305, Unknown=0, NotChecked=0, Total=37056 [2025-03-03 14:49:35,672 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 5420 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5420 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:35,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5420 Valid, 1811 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:49:35,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79869 states. [2025-03-03 14:49:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79869 to 66123. [2025-03-03 14:49:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66123 states, 66122 states have (on average 1.2577810713529536) internal successors, (83167), 66122 states have internal predecessors, (83167), 0 states have call successors, (0), 0 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-03 14:49:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66123 states to 66123 states and 83167 transitions. [2025-03-03 14:49:37,344 INFO L78 Accepts]: Start accepts. Automaton has 66123 states and 83167 transitions. Word has length 66 [2025-03-03 14:49:37,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:37,344 INFO L471 AbstractCegarLoop]: Abstraction has 66123 states and 83167 transitions. [2025-03-03 14:49:37,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 36 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:49:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 66123 states and 83167 transitions. [2025-03-03 14:49:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:49:37,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:37,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:37,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:49:37,547 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,SelfDestructingSolverStorable17 [2025-03-03 14:49:37,547 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:37,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:37,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1455892199, now seen corresponding path program 1 times [2025-03-03 14:49:37,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:37,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684902760] [2025-03-03 14:49:37,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:37,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:37,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:49:37,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:49:37,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:37,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:37,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:37,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684902760] [2025-03-03 14:49:37,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684902760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:49:37,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:49:37,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:49:37,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689776931] [2025-03-03 14:49:37,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:49:37,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:49:37,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:37,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:49:37,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:49:37,587 INFO L87 Difference]: Start difference. First operand 66123 states and 83167 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-03 14:49:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:49:38,421 INFO L93 Difference]: Finished difference Result 89431 states and 112179 transitions. [2025-03-03 14:49:38,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:49:38,421 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-03 14:49:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:49:38,477 INFO L225 Difference]: With dead ends: 89431 [2025-03-03 14:49:38,478 INFO L226 Difference]: Without dead ends: 48061 [2025-03-03 14:49:38,500 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-03 14:49:38,501 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:49:38,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 206 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:49:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48061 states. [2025-03-03 14:49:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48061 to 42407. [2025-03-03 14:49:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42407 states, 42406 states have (on average 1.241168702542093) internal successors, (52633), 42406 states have internal predecessors, (52633), 0 states have call successors, (0), 0 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-03 14:49:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42407 states to 42407 states and 52633 transitions. [2025-03-03 14:49:39,824 INFO L78 Accepts]: Start accepts. Automaton has 42407 states and 52633 transitions. Word has length 67 [2025-03-03 14:49:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:49:39,824 INFO L471 AbstractCegarLoop]: Abstraction has 42407 states and 52633 transitions. [2025-03-03 14:49:39,825 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-03 14:49:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 42407 states and 52633 transitions. [2025-03-03 14:49:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:49:39,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:49:39,827 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:49:39,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:49:39,828 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:49:39,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:49:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash -300852910, now seen corresponding path program 1 times [2025-03-03 14:49:39,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:49:39,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640531993] [2025-03-03 14:49:39,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:39,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:49:39,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:49:39,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:49:39,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:39,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:40,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:49:40,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640531993] [2025-03-03 14:49:40,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640531993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:49:40,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490679654] [2025-03-03 14:49:40,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:49:40,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:49:40,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:49:40,358 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-03 14:49:40,360 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-03 14:49:40,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:49:40,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:49:40,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:49:40,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:49:40,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 14:49:40,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:49:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:41,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:49:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:49:42,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490679654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:49:42,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:49:42,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 16] total 43 [2025-03-03 14:49:42,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020744831] [2025-03-03 14:49:42,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:49:42,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 14:49:42,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:49:42,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 14:49:42,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1623, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 14:49:42,888 INFO L87 Difference]: Start difference. First operand 42407 states and 52633 transitions. Second operand has 43 states, 43 states have (on average 4.395348837209302) internal successors, (189), 43 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-03 14:50:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:09,404 INFO L93 Difference]: Finished difference Result 211360 states and 259930 transitions. [2025-03-03 14:50:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 299 states. [2025-03-03 14:50:09,405 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.395348837209302) internal successors, (189), 43 states have internal predecessors, (189), 0 states have call successors, (0), 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 68 [2025-03-03 14:50:09,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:09,621 INFO L225 Difference]: With dead ends: 211360 [2025-03-03 14:50:09,621 INFO L226 Difference]: Without dead ends: 169306 [2025-03-03 14:50:09,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49494 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=20975, Invalid=94285, Unknown=0, NotChecked=0, Total=115260 [2025-03-03 14:50:09,666 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 9460 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9460 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:09,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9460 Valid, 2324 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:50:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169306 states. [2025-03-03 14:50:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169306 to 73458. [2025-03-03 14:50:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73458 states, 73457 states have (on average 1.2417060321004125) internal successors, (91212), 73457 states have internal predecessors, (91212), 0 states have call successors, (0), 0 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-03 14:50:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73458 states to 73458 states and 91212 transitions. [2025-03-03 14:50:12,404 INFO L78 Accepts]: Start accepts. Automaton has 73458 states and 91212 transitions. Word has length 68 [2025-03-03 14:50:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:12,404 INFO L471 AbstractCegarLoop]: Abstraction has 73458 states and 91212 transitions. [2025-03-03 14:50:12,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.395348837209302) internal successors, (189), 43 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-03 14:50:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 73458 states and 91212 transitions. [2025-03-03 14:50:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:50:12,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:12,413 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:12,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:50:12,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:12,614 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:12,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:12,614 INFO L85 PathProgramCache]: Analyzing trace with hash -510167271, now seen corresponding path program 1 times [2025-03-03 14:50:12,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:12,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52710663] [2025-03-03 14:50:12,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:12,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:12,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:50:12,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:50:12,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:12,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 14:50:12,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:12,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52710663] [2025-03-03 14:50:12,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52710663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:12,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:12,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:12,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209381233] [2025-03-03 14:50:12,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:12,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:12,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:12,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:12,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:12,660 INFO L87 Difference]: Start difference. First operand 73458 states and 91212 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-03 14:50:15,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:15,164 INFO L93 Difference]: Finished difference Result 114608 states and 141788 transitions. [2025-03-03 14:50:15,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:15,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 108 [2025-03-03 14:50:15,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:15,251 INFO L225 Difference]: With dead ends: 114608 [2025-03-03 14:50:15,251 INFO L226 Difference]: Without dead ends: 68407 [2025-03-03 14:50:15,284 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-03 14:50:15,285 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:15,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 213 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68407 states. [2025-03-03 14:50:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68407 to 64403. [2025-03-03 14:50:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64403 states, 64402 states have (on average 1.220893761063321) internal successors, (78628), 64402 states have internal predecessors, (78628), 0 states have call successors, (0), 0 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-03 14:50:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64403 states to 64403 states and 78628 transitions. [2025-03-03 14:50:17,576 INFO L78 Accepts]: Start accepts. Automaton has 64403 states and 78628 transitions. Word has length 108 [2025-03-03 14:50:17,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:17,577 INFO L471 AbstractCegarLoop]: Abstraction has 64403 states and 78628 transitions. [2025-03-03 14:50:17,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-03 14:50:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 64403 states and 78628 transitions. [2025-03-03 14:50:17,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:50:17,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:17,584 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:17,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:50:17,585 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:17,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:17,585 INFO L85 PathProgramCache]: Analyzing trace with hash -71756424, now seen corresponding path program 1 times [2025-03-03 14:50:17,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:17,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351644243] [2025-03-03 14:50:17,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:17,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:17,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:50:17,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:50:17,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:17,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:50:17,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:17,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351644243] [2025-03-03 14:50:17,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351644243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:50:17,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:50:17,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:50:17,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347612952] [2025-03-03 14:50:17,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:50:17,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:50:17,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:17,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:50:17,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:50:17,632 INFO L87 Difference]: Start difference. First operand 64403 states and 78628 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-03 14:50:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:19,071 INFO L93 Difference]: Finished difference Result 81372 states and 98869 transitions. [2025-03-03 14:50:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:50:19,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 108 [2025-03-03 14:50:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:19,130 INFO L225 Difference]: With dead ends: 81372 [2025-03-03 14:50:19,130 INFO L226 Difference]: Without dead ends: 49855 [2025-03-03 14:50:19,153 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-03 14:50:19,154 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 22 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:19,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 176 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:50:19,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49855 states. [2025-03-03 14:50:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49855 to 49853. [2025-03-03 14:50:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49853 states, 49852 states have (on average 1.1971234855171307) internal successors, (59679), 49852 states have internal predecessors, (59679), 0 states have call successors, (0), 0 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-03 14:50:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49853 states to 49853 states and 59679 transitions. [2025-03-03 14:50:20,789 INFO L78 Accepts]: Start accepts. Automaton has 49853 states and 59679 transitions. Word has length 108 [2025-03-03 14:50:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:50:20,789 INFO L471 AbstractCegarLoop]: Abstraction has 49853 states and 59679 transitions. [2025-03-03 14:50:20,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-03 14:50:20,789 INFO L276 IsEmpty]: Start isEmpty. Operand 49853 states and 59679 transitions. [2025-03-03 14:50:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:50:20,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:50:20,795 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:50:20,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:50:20,795 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:50:20,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:50:20,795 INFO L85 PathProgramCache]: Analyzing trace with hash -452148463, now seen corresponding path program 1 times [2025-03-03 14:50:20,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:50:20,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856100235] [2025-03-03 14:50:20,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:20,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:50:20,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:50:20,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:50:20,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:20,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 34 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:50:21,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:50:21,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856100235] [2025-03-03 14:50:21,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856100235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:50:21,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417382192] [2025-03-03 14:50:21,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:50:21,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:50:21,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:50:21,115 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-03 14:50:21,117 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-03 14:50:21,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:50:21,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:50:21,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:50:21,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:50:21,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 14:50:21,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:50:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 50 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:21,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:50:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 35 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:50:22,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417382192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:50:22,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:50:22,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 26 [2025-03-03 14:50:22,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283296564] [2025-03-03 14:50:22,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:50:22,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 14:50:22,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:50:22,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 14:50:22,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:50:22,760 INFO L87 Difference]: Start difference. First operand 49853 states and 59679 transitions. Second operand has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 26 states have internal predecessors, (255), 0 states have call successors, (0), 0 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-03 14:50:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:50:27,321 INFO L93 Difference]: Finished difference Result 162307 states and 193573 transitions. [2025-03-03 14:50:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 14:50:27,322 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.807692307692308) internal successors, (255), 26 states have internal predecessors, (255), 0 states have call successors, (0), 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 109 [2025-03-03 14:50:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:50:27,463 INFO L225 Difference]: With dead ends: 162307 [2025-03-03 14:50:27,463 INFO L226 Difference]: Without dead ends: 116961 [2025-03-03 14:50:27,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=515, Invalid=1837, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 14:50:27,503 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1396 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:50:27,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 1196 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:50:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116961 states.