./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cyclic_scheduler.2.prop1-func-interl.c --full-output --architecture 64bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 48c9605d
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cyclic_scheduler.2.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d49cca2c1981986ef498fb2d20ecfb4ecde4369aa8ec3ff47ed8b99c4f9cf327
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-07 22:59:34,025 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-07 22:59:34,088 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-02-07 22:59:34,093 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-07 22:59:34,099 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-07 22:59:34,118 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-07 22:59:34,119 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-07 22:59:34,119 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-07 22:59:34,120 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-07 22:59:34,120 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-07 22:59:34,120 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-07 22:59:34,120 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-07 22:59:34,121 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-07 22:59:34,121 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-07 22:59:34,121 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-07 22:59:34,121 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-07 22:59:34,121 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-07 22:59:34,121 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-07 22:59:34,121 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-07 22:59:34,122 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-07 22:59:34,122 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-07 22:59:34,122 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-07 22:59:34,122 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-07 22:59:34,122 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-07 22:59:34,122 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-07 22:59:34,122 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-07 22:59:34,122 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-07 22:59:34,123 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-07 22:59:34,123 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-07 22:59:34,123 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 22:59:34,123 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-07 22:59:34,123 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-07 22:59:34,123 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-07 22:59:34,123 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-07 22:59:34,123 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-07 22:59:34,124 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-07 22:59:34,124 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-07 22:59:34,124 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-07 22:59:34,124 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-07 22:59:34,124 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-07 22:59:34,124 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d49cca2c1981986ef498fb2d20ecfb4ecde4369aa8ec3ff47ed8b99c4f9cf327
[2025-02-07 22:59:34,402 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-07 22:59:34,412 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-07 22:59:34,416 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-07 22:59:34,417 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-07 22:59:34,417 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-07 22:59:34,419 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cyclic_scheduler.2.prop1-func-interl.c
[2025-02-07 22:59:35,873 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21710711/39e0852f0e634d068362a1f1fcec44f6/FLAGf81bfece5
[2025-02-07 22:59:36,310 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-07 22:59:36,311 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cyclic_scheduler.2.prop1-func-interl.c
[2025-02-07 22:59:36,336 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21710711/39e0852f0e634d068362a1f1fcec44f6/FLAGf81bfece5
[2025-02-07 22:59:36,446 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21710711/39e0852f0e634d068362a1f1fcec44f6
[2025-02-07 22:59:36,448 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-07 22:59:36,450 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-07 22:59:36,452 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-07 22:59:36,452 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-07 22:59:36,456 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-07 22:59:36,457 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:59:36" (1/1) ...
[2025-02-07 22:59:36,458 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e016956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:36, skipping insertion in model container
[2025-02-07 22:59:36,458 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:59:36" (1/1) ...
[2025-02-07 22:59:36,519 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-07 22:59:36,712 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cyclic_scheduler.2.prop1-func-interl.c[1183,1196]
[2025-02-07 22:59:37,134 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 22:59:37,145 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-07 22:59:37,155 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cyclic_scheduler.2.prop1-func-interl.c[1183,1196]
[2025-02-07 22:59:37,392 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 22:59:37,406 INFO  L204         MainTranslator]: Completed translation
[2025-02-07 22:59:37,408 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37 WrapperNode
[2025-02-07 22:59:37,408 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-07 22:59:37,409 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-07 22:59:37,409 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-07 22:59:37,410 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-07 22:59:37,416 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (1/1) ...
[2025-02-07 22:59:37,508 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (1/1) ...
[2025-02-07 22:59:38,373 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 7526
[2025-02-07 22:59:38,374 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-07 22:59:38,375 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-07 22:59:38,375 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-07 22:59:38,375 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-07 22:59:38,383 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (1/1) ...
[2025-02-07 22:59:38,383 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (1/1) ...
[2025-02-07 22:59:38,666 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (1/1) ...
[2025-02-07 22:59:38,880 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-07 22:59:38,882 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (1/1) ...
[2025-02-07 22:59:38,882 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (1/1) ...
[2025-02-07 22:59:39,167 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (1/1) ...
[2025-02-07 22:59:39,207 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (1/1) ...
[2025-02-07 22:59:39,252 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (1/1) ...
[2025-02-07 22:59:39,298 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (1/1) ...
[2025-02-07 22:59:39,482 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-07 22:59:39,485 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-07 22:59:39,486 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-07 22:59:39,486 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-07 22:59:39,487 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (1/1) ...
[2025-02-07 22:59:39,503 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 22:59:39,539 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 22:59:39,559 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-07 22:59:39,564 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-07 22:59:39,603 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-07 22:59:39,603 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-07 22:59:39,603 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-07 22:59:39,603 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-07 22:59:40,063 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-07 22:59:40,065 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-07 22:59:49,921 INFO  L?                        ?]: Removed 4152 outVars from TransFormulas that were not future-live.
[2025-02-07 22:59:49,921 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-07 22:59:50,205 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-07 22:59:50,205 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-07 22:59:50,205 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:59:50 BoogieIcfgContainer
[2025-02-07 22:59:50,206 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-07 22:59:50,208 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-07 22:59:50,208 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-07 22:59:50,213 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-07 22:59:50,213 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:59:36" (1/3) ...
[2025-02-07 22:59:50,214 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b985348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:59:50, skipping insertion in model container
[2025-02-07 22:59:50,215 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:59:37" (2/3) ...
[2025-02-07 22:59:50,215 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b985348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:59:50, skipping insertion in model container
[2025-02-07 22:59:50,215 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:59:50" (3/3) ...
[2025-02-07 22:59:50,217 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cyclic_scheduler.2.prop1-func-interl.c
[2025-02-07 22:59:50,233 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-07 22:59:50,235 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cyclic_scheduler.2.prop1-func-interl.c that has 1 procedures, 2692 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-07 22:59:50,367 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-07 22:59:50,380 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;@4b525b01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-07 22:59:50,382 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-07 22:59:50,398 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 2692 states, 2690 states have (on average 1.5) internal successors, (4035), 2691 states have internal predecessors, (4035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:59:50,414 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2025-02-07 22:59:50,415 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:59:50,416 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:59:50,416 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:59:50,422 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:59:50,424 INFO  L85        PathProgramCache]: Analyzing trace with hash -1709314567, now seen corresponding path program 1 times
[2025-02-07 22:59:50,431 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:59:50,434 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588724216]
[2025-02-07 22:59:50,435 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:59:50,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:59:50,551 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes.
[2025-02-07 22:59:50,706 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements.
[2025-02-07 22:59:50,706 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:59:50,706 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:59:51,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:59:51,490 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:59:51,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588724216]
[2025-02-07 22:59:51,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588724216] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:59:51,494 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:59:51,495 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:59:51,496 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334880036]
[2025-02-07 22:59:51,496 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:59:51,500 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:59:51,500 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:59:51,519 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:59:51,520 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:59:51,528 INFO  L87              Difference]: Start difference. First operand  has 2692 states, 2690 states have (on average 1.5) internal successors, (4035), 2691 states have internal predecessors, (4035), 0 states have call successors, (0), 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 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:59:53,078 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:59:53,078 INFO  L93              Difference]: Finished difference Result 5199 states and 7795 transitions.
[2025-02-07 22:59:53,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:59:53,080 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 132
[2025-02-07 22:59:53,081 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:59:53,113 INFO  L225             Difference]: With dead ends: 5199
[2025-02-07 22:59:53,114 INFO  L226             Difference]: Without dead ends: 2692
[2025-02-07 22:59:53,126 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:59:53,128 INFO  L435           NwaCegarLoop]: 3359 mSDtfsCounter, 0 mSDsluCounter, 6713 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10072 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-07 22:59:53,129 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10072 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-07 22:59:53,150 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2692 states.
[2025-02-07 22:59:53,309 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 2692.
[2025-02-07 22:59:53,318 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2692 states, 2691 states have (on average 1.499070977331847) internal successors, (4034), 2691 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:59:53,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4034 transitions.
[2025-02-07 22:59:53,333 INFO  L78                 Accepts]: Start accepts. Automaton has 2692 states and 4034 transitions. Word has length 132
[2025-02-07 22:59:53,334 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:59:53,336 INFO  L471      AbstractCegarLoop]: Abstraction has 2692 states and 4034 transitions.
[2025-02-07 22:59:53,336 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:59:53,336 INFO  L276                IsEmpty]: Start isEmpty. Operand 2692 states and 4034 transitions.
[2025-02-07 22:59:53,342 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-02-07 22:59:53,342 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:59:53,343 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:59:53,343 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-07 22:59:53,343 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:59:53,345 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:59:53,345 INFO  L85        PathProgramCache]: Analyzing trace with hash -1444460633, now seen corresponding path program 1 times
[2025-02-07 22:59:53,345 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:59:53,346 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865751085]
[2025-02-07 22:59:53,346 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:59:53,346 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:59:53,391 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-02-07 22:59:53,423 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-02-07 22:59:53,425 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:59:53,425 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:59:53,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:59:53,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:59:53,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865751085]
[2025-02-07 22:59:53,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865751085] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:59:53,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:59:53,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:59:53,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919349747]
[2025-02-07 22:59:53,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:59:53,694 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 22:59:53,694 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:59:53,694 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 22:59:53,695 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:59:53,695 INFO  L87              Difference]: Start difference. First operand 2692 states and 4034 transitions. Second operand  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:59:54,964 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:59:54,965 INFO  L93              Difference]: Finished difference Result 5201 states and 7794 transitions.
[2025-02-07 22:59:54,965 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 22:59:54,965 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133
[2025-02-07 22:59:54,966 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:59:54,979 INFO  L225             Difference]: With dead ends: 5201
[2025-02-07 22:59:54,980 INFO  L226             Difference]: Without dead ends: 2694
[2025-02-07 22:59:54,984 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 22:59:54,985 INFO  L435           NwaCegarLoop]: 3359 mSDtfsCounter, 0 mSDsluCounter, 6710 mSDsCounter, 0 mSdLazyCounter, 2026 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10069 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-07 22:59:54,985 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10069 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2026 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-07 22:59:54,993 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2694 states.
[2025-02-07 22:59:55,039 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2694.
[2025-02-07 22:59:55,045 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2694 states, 2693 states have (on average 1.498700334199777) internal successors, (4036), 2693 states have internal predecessors, (4036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:59:55,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 4036 transitions.
[2025-02-07 22:59:55,055 INFO  L78                 Accepts]: Start accepts. Automaton has 2694 states and 4036 transitions. Word has length 133
[2025-02-07 22:59:55,056 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:59:55,056 INFO  L471      AbstractCegarLoop]: Abstraction has 2694 states and 4036 transitions.
[2025-02-07 22:59:55,056 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:59:55,056 INFO  L276                IsEmpty]: Start isEmpty. Operand 2694 states and 4036 transitions.
[2025-02-07 22:59:55,057 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-02-07 22:59:55,057 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:59:55,057 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:59:55,058 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-07 22:59:55,058 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:59:55,058 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:59:55,058 INFO  L85        PathProgramCache]: Analyzing trace with hash 102906804, now seen corresponding path program 1 times
[2025-02-07 22:59:55,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:59:55,059 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328022218]
[2025-02-07 22:59:55,059 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:59:55,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:59:55,106 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-02-07 22:59:55,129 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-02-07 22:59:55,130 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:59:55,130 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 22:59:55,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 22:59:55,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 22:59:55,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328022218]
[2025-02-07 22:59:55,428 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328022218] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 22:59:55,428 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 22:59:55,429 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 22:59:55,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175515510]
[2025-02-07 22:59:55,429 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 22:59:55,429 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 22:59:55,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 22:59:55,430 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 22:59:55,430 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 22:59:55,430 INFO  L87              Difference]: Start difference. First operand 2694 states and 4036 transitions. Second operand  has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:59:57,888 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 22:59:57,888 INFO  L93              Difference]: Finished difference Result 6874 states and 10299 transitions.
[2025-02-07 22:59:57,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 22:59:57,889 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134
[2025-02-07 22:59:57,889 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 22:59:57,906 INFO  L225             Difference]: With dead ends: 6874
[2025-02-07 22:59:57,907 INFO  L226             Difference]: Without dead ends: 4365
[2025-02-07 22:59:57,911 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-07 22:59:57,912 INFO  L435           NwaCegarLoop]: 3355 mSDtfsCounter, 2660 mSDsluCounter, 9829 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2660 SdHoareTripleChecker+Valid, 13184 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-07 22:59:57,912 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2660 Valid, 13184 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-07 22:59:57,920 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4365 states.
[2025-02-07 22:59:57,977 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 2760.
[2025-02-07 22:59:57,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2760 states, 2759 states have (on average 1.4983689742660384) internal successors, (4134), 2759 states have internal predecessors, (4134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:59:57,993 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 4134 transitions.
[2025-02-07 22:59:57,993 INFO  L78                 Accepts]: Start accepts. Automaton has 2760 states and 4134 transitions. Word has length 134
[2025-02-07 22:59:57,993 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 22:59:57,994 INFO  L471      AbstractCegarLoop]: Abstraction has 2760 states and 4134 transitions.
[2025-02-07 22:59:57,994 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 22:59:57,994 INFO  L276                IsEmpty]: Start isEmpty. Operand 2760 states and 4134 transitions.
[2025-02-07 22:59:58,054 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1388
[2025-02-07 22:59:58,054 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 22:59:58,055 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 22:59:58,055 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-07 22:59:58,055 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 22:59:58,056 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 22:59:58,057 INFO  L85        PathProgramCache]: Analyzing trace with hash -155839794, now seen corresponding path program 1 times
[2025-02-07 22:59:58,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 22:59:58,057 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085225395]
[2025-02-07 22:59:58,058 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 22:59:58,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 22:59:58,254 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1387 statements into 1 equivalence classes.
[2025-02-07 22:59:59,429 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1387 of 1387 statements.
[2025-02-07 22:59:59,430 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 22:59:59,430 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:00:02,943 INFO  L134       CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-02-07 23:00:02,945 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:00:02,945 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085225395]
[2025-02-07 23:00:02,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085225395] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:00:02,945 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:00:02,945 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 23:00:02,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737173240]
[2025-02-07 23:00:02,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:00:02,947 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 23:00:02,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:00:02,949 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 23:00:02,949 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:00:02,950 INFO  L87              Difference]: Start difference. First operand 2760 states and 4134 transitions. Second operand  has 5 states, 5 states have (on average 271.2) internal successors, (1356), 5 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:00:04,467 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:00:04,468 INFO  L93              Difference]: Finished difference Result 5273 states and 7898 transitions.
[2025-02-07 23:00:04,468 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:00:04,469 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 271.2) internal successors, (1356), 5 states have internal predecessors, (1356), 0 states have call successors, (0), 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 1387
[2025-02-07 23:00:04,471 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:00:04,483 INFO  L225             Difference]: With dead ends: 5273
[2025-02-07 23:00:04,484 INFO  L226             Difference]: Without dead ends: 2764
[2025-02-07 23:00:04,488 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:00:04,489 INFO  L435           NwaCegarLoop]: 3359 mSDtfsCounter, 0 mSDsluCounter, 10054 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13413 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-07 23:00:04,489 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13413 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-07 23:00:04,493 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2764 states.
[2025-02-07 23:00:04,534 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2760.
[2025-02-07 23:00:04,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2760 states, 2759 states have (on average 1.4983689742660384) internal successors, (4134), 2759 states have internal predecessors, (4134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:00:04,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 4134 transitions.
[2025-02-07 23:00:04,546 INFO  L78                 Accepts]: Start accepts. Automaton has 2760 states and 4134 transitions. Word has length 1387
[2025-02-07 23:00:04,548 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:00:04,548 INFO  L471      AbstractCegarLoop]: Abstraction has 2760 states and 4134 transitions.
[2025-02-07 23:00:04,549 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 271.2) internal successors, (1356), 5 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:00:04,549 INFO  L276                IsEmpty]: Start isEmpty. Operand 2760 states and 4134 transitions.
[2025-02-07 23:00:04,565 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1389
[2025-02-07 23:00:04,565 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:00:04,566 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 23:00:04,566 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-07 23:00:04,566 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:00:04,568 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:00:04,568 INFO  L85        PathProgramCache]: Analyzing trace with hash 1352300434, now seen corresponding path program 1 times
[2025-02-07 23:00:04,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:00:04,568 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92721655]
[2025-02-07 23:00:04,569 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:00:04,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:00:04,748 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1388 statements into 1 equivalence classes.
[2025-02-07 23:00:07,593 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1388 of 1388 statements.
[2025-02-07 23:00:07,593 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:00:07,593 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:00:10,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:00:10,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:00:10,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92721655]
[2025-02-07 23:00:10,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92721655] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-07 23:00:10,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134926882]
[2025-02-07 23:00:10,332 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:00:10,332 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-07 23:00:10,332 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 23:00:10,336 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-07 23:00:10,338 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-07 23:00:11,249 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1388 statements into 1 equivalence classes.
[2025-02-07 23:00:12,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1388 of 1388 statements.
[2025-02-07 23:00:12,143 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:00:12,144 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:00:12,176 INFO  L256         TraceCheckSpWp]: Trace formula consists of 6003 conjuncts, 122 conjuncts are in the unsatisfiable core
[2025-02-07 23:00:12,291 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-07 23:00:27,880 INFO  L134       CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:00:27,881 INFO  L312         TraceCheckSpWp]: Computing backward predicates...