./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label06.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label06.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 0ad111d6936056460510a10e712b295b6541e8406527db903438c9aa67289a02
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 01:39:44,593 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 01:39:44,645 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 01:39:44,652 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 01:39:44,652 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 01:39:44,668 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 01:39:44,669 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 01:39:44,669 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 01:39:44,669 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 01:39:44,669 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 01:39:44,669 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 01:39:44,669 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 01:39:44,669 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 01:39:44,669 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 01:39:44,669 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 01:39:44,670 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 01:39:44,670 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 01:39:44,670 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 01:39:44,671 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 01:39:44,671 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 01:39:44,671 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 01:39:44,671 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 01:39:44,671 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 01:39:44,671 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 01:39:44,671 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 01:39:44,671 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 01:39:44,671 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 01:39:44,671 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 01:39:44,671 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 -> 0ad111d6936056460510a10e712b295b6541e8406527db903438c9aa67289a02
[2025-03-08 01:39:44,885 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 01:39:44,894 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 01:39:44,896 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 01:39:44,897 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 01:39:44,897 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 01:39:44,898 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label06.c
[2025-03-08 01:39:46,073 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a47dd49/d07d26d2407f4a419039a998a140d5dd/FLAG32c3f716d
[2025-03-08 01:39:46,392 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 01:39:46,393 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label06.c
[2025-03-08 01:39:46,403 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a47dd49/d07d26d2407f4a419039a998a140d5dd/FLAG32c3f716d
[2025-03-08 01:39:46,659 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a47dd49/d07d26d2407f4a419039a998a140d5dd
[2025-03-08 01:39:46,661 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 01:39:46,663 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 01:39:46,665 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 01:39:46,665 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 01:39:46,668 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 01:39:46,668 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:46,669 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b61bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46, skipping insertion in model container
[2025-03-08 01:39:46,669 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:46,692 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 01:39:46,822 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/eca-rers2012/Problem10_label06.c[2930,2943]
[2025-03-08 01:39:46,911 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 01:39:46,918 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 01:39:46,928 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/eca-rers2012/Problem10_label06.c[2930,2943]
[2025-03-08 01:39:46,975 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 01:39:46,987 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 01:39:46,988 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46 WrapperNode
[2025-03-08 01:39:46,989 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 01:39:46,990 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 01:39:46,990 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 01:39:46,990 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 01:39:46,995 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:47,009 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:47,059 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595
[2025-03-08 01:39:47,059 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 01:39:47,060 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 01:39:47,060 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 01:39:47,060 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 01:39:47,066 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:47,066 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:47,075 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:47,105 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 01:39:47,106 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:47,106 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:47,124 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:47,129 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:47,137 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:47,140 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:47,147 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 01:39:47,148 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 01:39:47,149 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 01:39:47,149 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 01:39:47,150 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (1/1) ...
[2025-03-08 01:39:47,156 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 01:39:47,166 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:39:47,180 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 01:39:47,186 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 01:39:47,201 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 01:39:47,202 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 01:39:47,202 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 01:39:47,203 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 01:39:47,251 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 01:39:47,253 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 01:39:48,120 INFO  L?                        ?]: Removed 84 outVars from TransFormulas that were not future-live.
[2025-03-08 01:39:48,120 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 01:39:48,133 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 01:39:48,134 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 01:39:48,135 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:39:48 BoogieIcfgContainer
[2025-03-08 01:39:48,135 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 01:39:48,137 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 01:39:48,137 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 01:39:48,140 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 01:39:48,140 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:39:46" (1/3) ...
[2025-03-08 01:39:48,140 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73176d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:39:48, skipping insertion in model container
[2025-03-08 01:39:48,141 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:46" (2/3) ...
[2025-03-08 01:39:48,141 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73176d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:39:48, skipping insertion in model container
[2025-03-08 01:39:48,142 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:39:48" (3/3) ...
[2025-03-08 01:39:48,143 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem10_label06.c
[2025-03-08 01:39:48,153 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 01:39:48,155 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label06.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 01:39:48,205 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 01:39:48,214 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;@23b30c65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 01:39:48,215 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 01:39:48,220 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:48,225 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-03-08 01:39:48,226 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:39:48,226 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]
[2025-03-08 01:39:48,227 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:39:48,231 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:39:48,232 INFO  L85        PathProgramCache]: Analyzing trace with hash -392968349, now seen corresponding path program 1 times
[2025-03-08 01:39:48,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:39:48,238 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837726572]
[2025-03-08 01:39:48,239 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:39:48,240 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:39:48,293 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-03-08 01:39:48,318 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-03-08 01:39:48,318 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:39:48,318 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:39:48,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:39:48,448 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:39:48,448 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837726572]
[2025-03-08 01:39:48,451 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837726572] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:39:48,451 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:39:48,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:39:48,453 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719761319]
[2025-03-08 01:39:48,454 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:39:48,456 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:39:48,456 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:39:48,469 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:39:48,469 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:48,471 INFO  L87              Difference]: Start difference. First operand  has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:49,067 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:39:49,067 INFO  L93              Difference]: Finished difference Result 552 states and 963 transitions.
[2025-03-08 01:39:49,069 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:39:49,070 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24
[2025-03-08 01:39:49,070 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:39:49,079 INFO  L225             Difference]: With dead ends: 552
[2025-03-08 01:39:49,080 INFO  L226             Difference]: Without dead ends: 282
[2025-03-08 01:39:49,084 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:49,087 INFO  L435           NwaCegarLoop]: 69 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:39:49,088 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:39:49,102 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 282 states.
[2025-03-08 01:39:49,129 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282.
[2025-03-08 01:39:49,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:49,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions.
[2025-03-08 01:39:49,138 INFO  L78                 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 24
[2025-03-08 01:39:49,138 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:39:49,138 INFO  L471      AbstractCegarLoop]: Abstraction has 282 states and 432 transitions.
[2025-03-08 01:39:49,138 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:49,138 INFO  L276                IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions.
[2025-03-08 01:39:49,141 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2025-03-08 01:39:49,141 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:39:49,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:39:49,142 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 01:39:49,142 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:39:49,142 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:39:49,142 INFO  L85        PathProgramCache]: Analyzing trace with hash -2016771943, now seen corresponding path program 1 times
[2025-03-08 01:39:49,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:39:49,143 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626738927]
[2025-03-08 01:39:49,143 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:39:49,143 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:39:49,159 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes.
[2025-03-08 01:39:49,195 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements.
[2025-03-08 01:39:49,195 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:39:49,195 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:39:49,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:39:49,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:39:49,388 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626738927]
[2025-03-08 01:39:49,388 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626738927] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:39:49,389 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:39:49,389 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:39:49,389 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240337915]
[2025-03-08 01:39:49,389 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:39:49,390 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:39:49,391 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:39:49,391 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:39:49,392 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:49,392 INFO  L87              Difference]: Start difference. First operand 282 states and 432 transitions. Second operand  has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:49,801 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:39:49,801 INFO  L93              Difference]: Finished difference Result 701 states and 1076 transitions.
[2025-03-08 01:39:49,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:39:49,802 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93
[2025-03-08 01:39:49,802 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:39:49,804 INFO  L225             Difference]: With dead ends: 701
[2025-03-08 01:39:49,804 INFO  L226             Difference]: Without dead ends: 421
[2025-03-08 01:39:49,804 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:49,805 INFO  L435           NwaCegarLoop]: 31 mSDtfsCounter, 109 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:39:49,805 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 34 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:39:49,806 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 421 states.
[2025-03-08 01:39:49,817 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421.
[2025-03-08 01:39:49,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 421 states, 420 states have (on average 1.4190476190476191) internal successors, (596), 420 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:49,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions.
[2025-03-08 01:39:49,819 INFO  L78                 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 93
[2025-03-08 01:39:49,819 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:39:49,819 INFO  L471      AbstractCegarLoop]: Abstraction has 421 states and 596 transitions.
[2025-03-08 01:39:49,819 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:49,820 INFO  L276                IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions.
[2025-03-08 01:39:49,821 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-08 01:39:49,821 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:39:49,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:39:49,821 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 01:39:49,822 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:39:49,822 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:39:49,822 INFO  L85        PathProgramCache]: Analyzing trace with hash -997248374, now seen corresponding path program 1 times
[2025-03-08 01:39:49,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:39:49,822 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092523515]
[2025-03-08 01:39:49,822 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:39:49,822 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:39:49,839 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-08 01:39:49,853 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-08 01:39:49,853 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:39:49,853 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:39:49,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:39:49,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:39:49,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092523515]
[2025-03-08 01:39:49,937 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092523515] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:39:49,937 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:39:49,937 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:39:49,937 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912394495]
[2025-03-08 01:39:49,937 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:39:49,937 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:39:49,937 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:39:49,938 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:39:49,938 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:49,938 INFO  L87              Difference]: Start difference. First operand 421 states and 596 transitions. Second operand  has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:50,335 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:39:50,336 INFO  L93              Difference]: Finished difference Result 562 states and 787 transitions.
[2025-03-08 01:39:50,336 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:39:50,336 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99
[2025-03-08 01:39:50,336 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:39:50,338 INFO  L225             Difference]: With dead ends: 562
[2025-03-08 01:39:50,338 INFO  L226             Difference]: Without dead ends: 560
[2025-03-08 01:39:50,338 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:50,339 INFO  L435           NwaCegarLoop]: 7 mSDtfsCounter, 160 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:39:50,339 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 11 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:39:50,340 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 560 states.
[2025-03-08 01:39:50,347 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421.
[2025-03-08 01:39:50,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 421 states, 420 states have (on average 1.4190476190476191) internal successors, (596), 420 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:50,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions.
[2025-03-08 01:39:50,349 INFO  L78                 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 99
[2025-03-08 01:39:50,349 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:39:50,350 INFO  L471      AbstractCegarLoop]: Abstraction has 421 states and 596 transitions.
[2025-03-08 01:39:50,350 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:50,350 INFO  L276                IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions.
[2025-03-08 01:39:50,351 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-03-08 01:39:50,351 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:39:50,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:39:50,352 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 01:39:50,352 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:39:50,352 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:39:50,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 412244127, now seen corresponding path program 1 times
[2025-03-08 01:39:50,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:39:50,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725278389]
[2025-03-08 01:39:50,352 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:39:50,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:39:50,368 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-03-08 01:39:50,376 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-03-08 01:39:50,377 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:39:50,377 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:39:50,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:39:50,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:39:50,466 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725278389]
[2025-03-08 01:39:50,466 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725278389] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:39:50,466 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:39:50,466 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:39:50,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295072997]
[2025-03-08 01:39:50,466 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:39:50,466 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:39:50,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:39:50,467 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:39:50,467 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:50,467 INFO  L87              Difference]: Start difference. First operand 421 states and 596 transitions. Second operand  has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:50,868 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:39:50,868 INFO  L93              Difference]: Finished difference Result 1257 states and 1783 transitions.
[2025-03-08 01:39:50,868 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:39:50,868 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 102
[2025-03-08 01:39:50,869 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:39:50,871 INFO  L225             Difference]: With dead ends: 1257
[2025-03-08 01:39:50,871 INFO  L226             Difference]: Without dead ends: 838
[2025-03-08 01:39:50,872 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:50,873 INFO  L435           NwaCegarLoop]: 27 mSDtfsCounter, 64 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:39:50,873 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 31 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:39:50,874 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 838 states.
[2025-03-08 01:39:50,896 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699.
[2025-03-08 01:39:50,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 699 states, 698 states have (on average 1.3882521489971347) internal successors, (969), 698 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:50,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 969 transitions.
[2025-03-08 01:39:50,898 INFO  L78                 Accepts]: Start accepts. Automaton has 699 states and 969 transitions. Word has length 102
[2025-03-08 01:39:50,899 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:39:50,899 INFO  L471      AbstractCegarLoop]: Abstraction has 699 states and 969 transitions.
[2025-03-08 01:39:50,899 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:50,899 INFO  L276                IsEmpty]: Start isEmpty. Operand 699 states and 969 transitions.
[2025-03-08 01:39:50,901 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-03-08 01:39:50,901 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:39:50,901 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:39:50,902 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 01:39:50,902 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:39:50,902 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:39:50,902 INFO  L85        PathProgramCache]: Analyzing trace with hash 1333321591, now seen corresponding path program 1 times
[2025-03-08 01:39:50,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:39:50,902 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693399780]
[2025-03-08 01:39:50,903 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:39:50,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:39:50,919 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-03-08 01:39:50,927 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-03-08 01:39:50,927 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:39:50,927 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:39:51,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:39:51,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:39:51,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693399780]
[2025-03-08 01:39:51,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693399780] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:39:51,012 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:39:51,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:39:51,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142829002]
[2025-03-08 01:39:51,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:39:51,012 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:39:51,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:39:51,013 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:39:51,013 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:51,013 INFO  L87              Difference]: Start difference. First operand 699 states and 969 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:51,364 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:39:51,365 INFO  L93              Difference]: Finished difference Result 1952 states and 2712 transitions.
[2025-03-08 01:39:51,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:39:51,365 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118
[2025-03-08 01:39:51,366 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:39:51,369 INFO  L225             Difference]: With dead ends: 1952
[2025-03-08 01:39:51,369 INFO  L226             Difference]: Without dead ends: 1255
[2025-03-08 01:39:51,370 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:51,371 INFO  L435           NwaCegarLoop]: 73 mSDtfsCounter, 48 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 01:39:51,371 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 77 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 01:39:51,372 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1255 states.
[2025-03-08 01:39:51,388 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1116.
[2025-03-08 01:39:51,391 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1116 states, 1115 states have (on average 1.2878923766816144) internal successors, (1436), 1115 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:51,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1436 transitions.
[2025-03-08 01:39:51,394 INFO  L78                 Accepts]: Start accepts. Automaton has 1116 states and 1436 transitions. Word has length 118
[2025-03-08 01:39:51,394 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:39:51,394 INFO  L471      AbstractCegarLoop]: Abstraction has 1116 states and 1436 transitions.
[2025-03-08 01:39:51,394 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:51,394 INFO  L276                IsEmpty]: Start isEmpty. Operand 1116 states and 1436 transitions.
[2025-03-08 01:39:51,396 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2025-03-08 01:39:51,396 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:39:51,396 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:39:51,396 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 01:39:51,396 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:39:51,396 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:39:51,397 INFO  L85        PathProgramCache]: Analyzing trace with hash -1223099514, now seen corresponding path program 1 times
[2025-03-08 01:39:51,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:39:51,397 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074043717]
[2025-03-08 01:39:51,397 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:39:51,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:39:51,432 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes.
[2025-03-08 01:39:51,447 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements.
[2025-03-08 01:39:51,448 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:39:51,449 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:39:51,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:39:51,749 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:39:51,749 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074043717]
[2025-03-08 01:39:51,749 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074043717] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:39:51,749 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:39:51,749 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 01:39:51,749 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507237817]
[2025-03-08 01:39:51,749 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:39:51,750 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 01:39:51,750 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:39:51,750 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 01:39:51,751 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2025-03-08 01:39:51,751 INFO  L87              Difference]: Start difference. First operand 1116 states and 1436 transitions. Second operand  has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:52,155 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:39:52,155 INFO  L93              Difference]: Finished difference Result 2285 states and 2925 transitions.
[2025-03-08 01:39:52,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 01:39:52,156 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 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 177
[2025-03-08 01:39:52,156 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:39:52,160 INFO  L225             Difference]: With dead ends: 2285
[2025-03-08 01:39:52,160 INFO  L226             Difference]: Without dead ends: 1116
[2025-03-08 01:39:52,162 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2025-03-08 01:39:52,162 INFO  L435           NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:39:52,162 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:39:52,163 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1116 states.
[2025-03-08 01:39:52,178 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116.
[2025-03-08 01:39:52,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1116 states, 1115 states have (on average 1.2807174887892376) internal successors, (1428), 1115 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:52,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1428 transitions.
[2025-03-08 01:39:52,182 INFO  L78                 Accepts]: Start accepts. Automaton has 1116 states and 1428 transitions. Word has length 177
[2025-03-08 01:39:52,183 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:39:52,183 INFO  L471      AbstractCegarLoop]: Abstraction has 1116 states and 1428 transitions.
[2025-03-08 01:39:52,183 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:52,183 INFO  L276                IsEmpty]: Start isEmpty. Operand 1116 states and 1428 transitions.
[2025-03-08 01:39:52,185 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2025-03-08 01:39:52,186 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:39:52,186 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:39:52,187 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 01:39:52,187 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:39:52,187 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:39:52,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 2138602001, now seen corresponding path program 1 times
[2025-03-08 01:39:52,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:39:52,187 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121815555]
[2025-03-08 01:39:52,187 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:39:52,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:39:52,203 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes.
[2025-03-08 01:39:52,214 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements.
[2025-03-08 01:39:52,214 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:39:52,214 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:39:52,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:39:52,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:39:52,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121815555]
[2025-03-08 01:39:52,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121815555] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:39:52,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:39:52,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:39:52,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516681728]
[2025-03-08 01:39:52,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:39:52,322 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:39:52,322 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:39:52,322 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:39:52,322 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:52,322 INFO  L87              Difference]: Start difference. First operand 1116 states and 1428 transitions. Second operand  has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:52,684 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:39:52,685 INFO  L93              Difference]: Finished difference Result 2647 states and 3409 transitions.
[2025-03-08 01:39:52,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:39:52,685 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 184
[2025-03-08 01:39:52,686 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:39:52,690 INFO  L225             Difference]: With dead ends: 2647
[2025-03-08 01:39:52,690 INFO  L226             Difference]: Without dead ends: 1533
[2025-03-08 01:39:52,691 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:52,693 INFO  L435           NwaCegarLoop]: 209 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 01:39:52,693 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 214 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 01:39:52,694 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1533 states.
[2025-03-08 01:39:52,711 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1116.
[2025-03-08 01:39:52,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1116 states, 1115 states have (on average 1.272645739910314) internal successors, (1419), 1115 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:52,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1419 transitions.
[2025-03-08 01:39:52,729 INFO  L78                 Accepts]: Start accepts. Automaton has 1116 states and 1419 transitions. Word has length 184
[2025-03-08 01:39:52,729 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:39:52,729 INFO  L471      AbstractCegarLoop]: Abstraction has 1116 states and 1419 transitions.
[2025-03-08 01:39:52,730 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:52,730 INFO  L276                IsEmpty]: Start isEmpty. Operand 1116 states and 1419 transitions.
[2025-03-08 01:39:52,731 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-03-08 01:39:52,731 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:39:52,731 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:39:52,731 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 01:39:52,732 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:39:52,732 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:39:52,732 INFO  L85        PathProgramCache]: Analyzing trace with hash 1237049880, now seen corresponding path program 1 times
[2025-03-08 01:39:52,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:39:52,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693311639]
[2025-03-08 01:39:52,732 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:39:52,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:39:52,747 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-03-08 01:39:52,755 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-03-08 01:39:52,756 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:39:52,756 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:39:52,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 120 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-03-08 01:39:52,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:39:52,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693311639]
[2025-03-08 01:39:52,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693311639] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:39:52,917 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:39:52,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:39:52,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340412365]
[2025-03-08 01:39:52,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:39:52,917 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:39:52,917 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:39:52,918 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:39:52,918 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:52,918 INFO  L87              Difference]: Start difference. First operand 1116 states and 1419 transitions. Second operand  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:53,249 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:39:53,249 INFO  L93              Difference]: Finished difference Result 2369 states and 2984 transitions.
[2025-03-08 01:39:53,250 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:39:53,250 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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 194
[2025-03-08 01:39:53,250 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:39:53,254 INFO  L225             Difference]: With dead ends: 2369
[2025-03-08 01:39:53,254 INFO  L226             Difference]: Without dead ends: 1255
[2025-03-08 01:39:53,255 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:53,256 INFO  L435           NwaCegarLoop]: 78 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 01:39:53,256 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 82 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 01:39:53,257 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1255 states.
[2025-03-08 01:39:53,273 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255.
[2025-03-08 01:39:53,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1255 states, 1254 states have (on average 1.2456140350877194) internal successors, (1562), 1254 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:53,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1562 transitions.
[2025-03-08 01:39:53,278 INFO  L78                 Accepts]: Start accepts. Automaton has 1255 states and 1562 transitions. Word has length 194
[2025-03-08 01:39:53,278 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:39:53,278 INFO  L471      AbstractCegarLoop]: Abstraction has 1255 states and 1562 transitions.
[2025-03-08 01:39:53,278 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:53,278 INFO  L276                IsEmpty]: Start isEmpty. Operand 1255 states and 1562 transitions.
[2025-03-08 01:39:53,280 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-03-08 01:39:53,280 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:39:53,280 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:39:53,280 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 01:39:53,281 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:39:53,283 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:39:53,283 INFO  L85        PathProgramCache]: Analyzing trace with hash 279595180, now seen corresponding path program 1 times
[2025-03-08 01:39:53,283 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:39:53,283 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327943310]
[2025-03-08 01:39:53,283 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:39:53,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:39:53,301 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-08 01:39:53,312 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-08 01:39:53,313 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:39:53,313 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:39:53,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 120 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:39:53,429 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:39:53,429 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327943310]
[2025-03-08 01:39:53,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327943310] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:39:53,429 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:39:53,429 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:39:53,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734680971]
[2025-03-08 01:39:53,429 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:39:53,430 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:39:53,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:39:53,430 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:39:53,430 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:53,430 INFO  L87              Difference]: Start difference. First operand 1255 states and 1562 transitions. Second operand  has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:53,788 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:39:53,788 INFO  L93              Difference]: Finished difference Result 2786 states and 3534 transitions.
[2025-03-08 01:39:53,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:39:53,789 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 213
[2025-03-08 01:39:53,789 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:39:53,793 INFO  L225             Difference]: With dead ends: 2786
[2025-03-08 01:39:53,793 INFO  L226             Difference]: Without dead ends: 1672
[2025-03-08 01:39:53,795 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:53,797 INFO  L435           NwaCegarLoop]: 184 mSDtfsCounter, 77 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 01:39:53,797 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 188 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 01:39:53,799 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1672 states.
[2025-03-08 01:39:53,815 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672.
[2025-03-08 01:39:53,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1672 states, 1671 states have (on average 1.1651705565529622) internal successors, (1947), 1671 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:53,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1947 transitions.
[2025-03-08 01:39:53,822 INFO  L78                 Accepts]: Start accepts. Automaton has 1672 states and 1947 transitions. Word has length 213
[2025-03-08 01:39:53,822 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:39:53,822 INFO  L471      AbstractCegarLoop]: Abstraction has 1672 states and 1947 transitions.
[2025-03-08 01:39:53,822 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:53,822 INFO  L276                IsEmpty]: Start isEmpty. Operand 1672 states and 1947 transitions.
[2025-03-08 01:39:53,825 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 306
[2025-03-08 01:39:53,826 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:39:53,827 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:39:53,827 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 01:39:53,827 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:39:53,828 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:39:53,829 INFO  L85        PathProgramCache]: Analyzing trace with hash -507542363, now seen corresponding path program 1 times
[2025-03-08 01:39:53,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:39:53,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663293676]
[2025-03-08 01:39:53,830 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:39:53,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:39:53,854 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes.
[2025-03-08 01:39:53,867 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements.
[2025-03-08 01:39:53,868 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:39:53,868 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:39:53,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 311 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked.
[2025-03-08 01:39:53,990 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:39:53,990 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663293676]
[2025-03-08 01:39:53,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663293676] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:39:53,991 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:39:53,991 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:39:53,991 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773400705]
[2025-03-08 01:39:53,991 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:39:53,991 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:39:53,991 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:39:53,992 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:39:53,992 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:53,992 INFO  L87              Difference]: Start difference. First operand 1672 states and 1947 transitions. Second operand  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:54,336 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:39:54,337 INFO  L93              Difference]: Finished difference Result 1952 states and 2274 transitions.
[2025-03-08 01:39:54,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:39:54,337 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 305
[2025-03-08 01:39:54,338 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:39:54,343 INFO  L225             Difference]: With dead ends: 1952
[2025-03-08 01:39:54,343 INFO  L226             Difference]: Without dead ends: 1950
[2025-03-08 01:39:54,343 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:54,344 INFO  L435           NwaCegarLoop]: 7 mSDtfsCounter, 160 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 01:39:54,344 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 11 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 01:39:54,346 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1950 states.
[2025-03-08 01:39:54,364 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1533.
[2025-03-08 01:39:54,366 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1533 states, 1532 states have (on average 1.1697127937336815) internal successors, (1792), 1532 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:54,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1792 transitions.
[2025-03-08 01:39:54,370 INFO  L78                 Accepts]: Start accepts. Automaton has 1533 states and 1792 transitions. Word has length 305
[2025-03-08 01:39:54,370 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:39:54,370 INFO  L471      AbstractCegarLoop]: Abstraction has 1533 states and 1792 transitions.
[2025-03-08 01:39:54,370 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:54,370 INFO  L276                IsEmpty]: Start isEmpty. Operand 1533 states and 1792 transitions.
[2025-03-08 01:39:54,373 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 324
[2025-03-08 01:39:54,373 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:39:54,374 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:39:54,374 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 01:39:54,374 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:39:54,374 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:39:54,374 INFO  L85        PathProgramCache]: Analyzing trace with hash 470100679, now seen corresponding path program 1 times
[2025-03-08 01:39:54,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:39:54,374 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175754557]
[2025-03-08 01:39:54,375 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:39:54,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:39:54,409 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes.
[2025-03-08 01:39:54,423 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements.
[2025-03-08 01:39:54,424 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:39:54,424 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:39:54,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 320 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked.
[2025-03-08 01:39:54,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:39:54,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175754557]
[2025-03-08 01:39:54,726 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175754557] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:39:54,726 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:39:54,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:39:54,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309824101]
[2025-03-08 01:39:54,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:39:54,726 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:39:54,726 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:39:54,726 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:39:54,727 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:54,727 INFO  L87              Difference]: Start difference. First operand 1533 states and 1792 transitions. Second operand  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:55,052 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:39:55,052 INFO  L93              Difference]: Finished difference Result 2923 states and 3438 transitions.
[2025-03-08 01:39:55,053 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:39:55,053 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 323
[2025-03-08 01:39:55,053 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:39:55,053 INFO  L225             Difference]: With dead ends: 2923
[2025-03-08 01:39:55,054 INFO  L226             Difference]: Without dead ends: 0
[2025-03-08 01:39:55,055 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:39:55,056 INFO  L435           NwaCegarLoop]: 40 mSDtfsCounter, 132 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 01:39:55,056 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 43 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 01:39:55,056 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-08 01:39:55,057 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-08 01:39:55,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:55,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-08 01:39:55,057 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 323
[2025-03-08 01:39:55,057 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:39:55,057 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-08 01:39:55,057 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:39:55,057 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-08 01:39:55,057 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-08 01:39:55,059 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 01:39:55,060 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 01:39:55,062 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:39:55,063 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-08 01:39:55,190 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 01:39:55,199 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:39:55 BoogieIcfgContainer
[2025-03-08 01:39:55,199 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 01:39:55,200 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 01:39:55,200 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 01:39:55,200 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 01:39:55,200 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:39:48" (3/4) ...
[2025-03-08 01:39:55,202 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-08 01:39:55,211 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2025-03-08 01:39:55,212 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-08 01:39:55,213 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-08 01:39:55,213 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-08 01:39:55,304 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-08 01:39:55,305 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-08 01:39:55,305 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 01:39:55,305 INFO  L158              Benchmark]: Toolchain (without parser) took 8642.18ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 122.5MB in the beginning and 175.2MB in the end (delta: -52.7MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB.
[2025-03-08 01:39:55,306 INFO  L158              Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 01:39:55,306 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 324.65ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 95.5MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2025-03-08 01:39:55,306 INFO  L158              Benchmark]: Boogie Procedure Inliner took 69.34ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 88.1MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 01:39:55,306 INFO  L158              Benchmark]: Boogie Preprocessor took 87.59ms. Allocated memory is still 167.8MB. Free memory was 88.1MB in the beginning and 78.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 01:39:55,306 INFO  L158              Benchmark]: IcfgBuilder took 986.80ms. Allocated memory is still 167.8MB. Free memory was 78.7MB in the beginning and 70.5MB in the end (delta: 8.2MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB.
[2025-03-08 01:39:55,306 INFO  L158              Benchmark]: TraceAbstraction took 7062.69ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 70.5MB in the beginning and 186.4MB in the end (delta: -115.9MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB.
[2025-03-08 01:39:55,307 INFO  L158              Benchmark]: Witness Printer took 105.19ms. Allocated memory is still 260.0MB. Free memory was 186.4MB in the beginning and 175.2MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 01:39:55,308 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 324.65ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 95.5MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 69.34ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 88.1MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 87.59ms. Allocated memory is still 167.8MB. Free memory was 88.1MB in the beginning and 78.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 986.80ms. Allocated memory is still 167.8MB. Free memory was 78.7MB in the beginning and 70.5MB in the end (delta: 8.2MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB.
 * TraceAbstraction took 7062.69ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 70.5MB in the beginning and 186.4MB in the end (delta: -115.9MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB.
 * Witness Printer took 105.19ms. Allocated memory is still 260.0MB. Free memory was 186.4MB in the beginning and 175.2MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 86]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 206 locations, 343 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1155 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1155 mSDsluCounter, 789 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 691 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4328 IncrementalHoareTripleChecker+Invalid, 5019 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 691 mSolverCounterUnsat, 734 mSDtfsCounter, 4328 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1672occurred in iteration=9, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1251 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1832 NumberOfCodeBlocks, 1832 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1821 ConstructedInterpolants, 0 QuantifiedInterpolants, 4357 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1180/1180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 592]: Location Invariant
    Derived location invariant: ((((((a19 <= 9) && (a10 != 1)) && (14 == a4)) && (a12 == 0)) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || ((((7 <= a19) && (a10 == 1)) && (14 == a4)) && (a12 == 0)))
RESULT: Ultimate proved your program to be correct!
[2025-03-08 01:39:55,320 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE