./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c
[2025-02-05 16:18:49,106 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 16:18:49,122 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 16:18:49,124 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 16:18:49,125 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 16:18:49,125 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 16:18:49,131 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c
[2025-02-05 16:18:50,442 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02cbc4ce2/c2db5d6a3891402f8f922a639a68b6c4/FLAG962ef3da5
[2025-02-05 16:18:50,728 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 16:18:50,739 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c
[2025-02-05 16:18:50,752 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02cbc4ce2/c2db5d6a3891402f8f922a639a68b6c4/FLAG962ef3da5
[2025-02-05 16:18:50,771 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02cbc4ce2/c2db5d6a3891402f8f922a639a68b6c4
[2025-02-05 16:18:50,774 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 16:18:50,775 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 16:18:50,777 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 16:18:50,777 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 16:18:50,780 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 16:18:50,781 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:18:50" (1/1) ...
[2025-02-05 16:18:50,782 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11563375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:50, skipping insertion in model container
[2025-02-05 16:18:50,782 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:18:50" (1/1) ...
[2025-02-05 16:18:50,805 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 16:18:51,010 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524]
[2025-02-05 16:18:51,017 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:18:51,026 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 16:18:51,091 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524]
[2025-02-05 16:18:51,091 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 16:18:51,107 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 16:18:51,107 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51 WrapperNode
[2025-02-05 16:18:51,108 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 16:18:51,109 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 16:18:51,109 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 16:18:51,109 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 16:18:51,113 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (1/1) ...
[2025-02-05 16:18:51,123 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (1/1) ...
[2025-02-05 16:18:51,161 INFO  L138                Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 493
[2025-02-05 16:18:51,166 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 16:18:51,166 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 16:18:51,166 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 16:18:51,166 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 16:18:51,173 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (1/1) ...
[2025-02-05 16:18:51,174 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (1/1) ...
[2025-02-05 16:18:51,182 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (1/1) ...
[2025-02-05 16:18:51,202 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 16:18:51,207 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (1/1) ...
[2025-02-05 16:18:51,207 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (1/1) ...
[2025-02-05 16:18:51,221 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (1/1) ...
[2025-02-05 16:18:51,222 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (1/1) ...
[2025-02-05 16:18:51,224 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (1/1) ...
[2025-02-05 16:18:51,229 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (1/1) ...
[2025-02-05 16:18:51,235 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 16:18:51,235 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 16:18:51,235 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 16:18:51,235 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 16:18:51,236 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (1/1) ...
[2025-02-05 16:18:51,244 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 16:18:51,254 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 16:18:51,267 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 16:18:51,273 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 16:18:51,291 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 16:18:51,291 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 16:18:51,291 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 16:18:51,292 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 16:18:51,402 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 16:18:51,404 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 16:18:51,999 INFO  L?                        ?]: Removed 48 outVars from TransFormulas that were not future-live.
[2025-02-05 16:18:52,003 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 16:18:52,016 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 16:18:52,020 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 16:18:52,020 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:18:52 BoogieIcfgContainer
[2025-02-05 16:18:52,020 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 16:18:52,022 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 16:18:52,022 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 16:18:52,030 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 16:18:52,031 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:18:50" (1/3) ...
[2025-02-05 16:18:52,031 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a737c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:18:52, skipping insertion in model container
[2025-02-05 16:18:52,034 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:18:51" (2/3) ...
[2025-02-05 16:18:52,035 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a737c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:18:52, skipping insertion in model container
[2025-02-05 16:18:52,035 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:18:52" (3/3) ...
[2025-02-05 16:18:52,036 INFO  L128   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c
[2025-02-05 16:18:52,050 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 16:18:52,053 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c that has 1 procedures, 136 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 16:18:52,106 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 16:18:52,122 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;@392fdc1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 16:18:52,122 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 16:18:52,129 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:52,141 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-02-05 16:18:52,141 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:52,142 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:52,142 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:52,150 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:52,155 INFO  L85        PathProgramCache]: Analyzing trace with hash 1452200164, now seen corresponding path program 1 times
[2025-02-05 16:18:52,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:52,165 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778215948]
[2025-02-05 16:18:52,166 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:52,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:52,287 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-02-05 16:18:52,355 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-02-05 16:18:52,357 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:52,357 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:52,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:52,487 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:52,487 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778215948]
[2025-02-05 16:18:52,487 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778215948] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:52,488 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:52,488 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 16:18:52,489 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737151063]
[2025-02-05 16:18:52,490 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:52,493 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 16:18:52,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:52,510 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 16:18:52,511 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 16:18:52,514 INFO  L87              Difference]: Start difference. First operand  has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:52,531 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:52,531 INFO  L93              Difference]: Finished difference Result 210 states and 364 transitions.
[2025-02-05 16:18:52,532 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 16:18:52,533 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37
[2025-02-05 16:18:52,534 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:52,539 INFO  L225             Difference]: With dead ends: 210
[2025-02-05 16:18:52,539 INFO  L226             Difference]: Without dead ends: 133
[2025-02-05 16:18:52,542 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 16:18:52,545 INFO  L435           NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:52,546 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:52,557 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2025-02-05 16:18:52,574 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133.
[2025-02-05 16:18:52,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 132 states have (on average 1.7575757575757576) internal successors, (232), 132 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:52,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 232 transitions.
[2025-02-05 16:18:52,581 INFO  L78                 Accepts]: Start accepts. Automaton has 133 states and 232 transitions. Word has length 37
[2025-02-05 16:18:52,582 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:52,582 INFO  L471      AbstractCegarLoop]: Abstraction has 133 states and 232 transitions.
[2025-02-05 16:18:52,582 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:52,582 INFO  L276                IsEmpty]: Start isEmpty. Operand 133 states and 232 transitions.
[2025-02-05 16:18:52,583 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-02-05 16:18:52,584 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:52,584 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:52,585 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 16:18:52,585 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:52,585 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:52,586 INFO  L85        PathProgramCache]: Analyzing trace with hash 1043375939, now seen corresponding path program 1 times
[2025-02-05 16:18:52,586 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:52,586 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573711766]
[2025-02-05 16:18:52,586 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:52,586 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:52,609 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-02-05 16:18:52,656 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-02-05 16:18:52,656 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:52,656 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:52,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:52,886 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:52,886 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573711766]
[2025-02-05 16:18:52,886 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573711766] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:52,887 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:52,887 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:18:52,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131806437]
[2025-02-05 16:18:52,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:52,888 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:18:52,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:52,888 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:18:52,888 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:52,889 INFO  L87              Difference]: Start difference. First operand 133 states and 232 transitions. Second operand  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:52,979 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:52,979 INFO  L93              Difference]: Finished difference Result 210 states and 360 transitions.
[2025-02-05 16:18:52,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:18:52,980 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37
[2025-02-05 16:18:52,980 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:52,981 INFO  L225             Difference]: With dead ends: 210
[2025-02-05 16:18:52,983 INFO  L226             Difference]: Without dead ends: 133
[2025-02-05 16:18:52,983 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:52,984 INFO  L435           NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:52,984 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:18:52,985 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2025-02-05 16:18:53,007 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133.
[2025-02-05 16:18:53,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 132 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:53,011 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions.
[2025-02-05 16:18:53,011 INFO  L78                 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 37
[2025-02-05 16:18:53,011 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:53,011 INFO  L471      AbstractCegarLoop]: Abstraction has 133 states and 202 transitions.
[2025-02-05 16:18:53,011 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:53,011 INFO  L276                IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions.
[2025-02-05 16:18:53,012 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-02-05 16:18:53,012 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:53,012 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:53,012 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 16:18:53,012 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:53,016 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:53,017 INFO  L85        PathProgramCache]: Analyzing trace with hash 1970382673, now seen corresponding path program 1 times
[2025-02-05 16:18:53,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:53,017 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207011294]
[2025-02-05 16:18:53,017 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:53,017 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:53,035 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-02-05 16:18:53,062 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-02-05 16:18:53,063 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:53,063 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:53,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:53,143 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:53,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207011294]
[2025-02-05 16:18:53,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207011294] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:53,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:53,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:53,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795097868]
[2025-02-05 16:18:53,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:53,144 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:53,144 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:53,145 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:53,145 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:53,145 INFO  L87              Difference]: Start difference. First operand 133 states and 202 transitions. Second operand  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:53,204 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:53,205 INFO  L93              Difference]: Finished difference Result 265 states and 424 transitions.
[2025-02-05 16:18:53,205 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:53,205 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66
[2025-02-05 16:18:53,205 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:53,206 INFO  L225             Difference]: With dead ends: 265
[2025-02-05 16:18:53,206 INFO  L226             Difference]: Without dead ends: 192
[2025-02-05 16:18:53,207 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:53,207 INFO  L435           NwaCegarLoop]: 195 mSDtfsCounter, 97 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:53,208 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 344 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:18:53,208 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 192 states.
[2025-02-05 16:18:53,214 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189.
[2025-02-05 16:18:53,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 189 states, 188 states have (on average 1.553191489361702) internal successors, (292), 188 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:53,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 292 transitions.
[2025-02-05 16:18:53,216 INFO  L78                 Accepts]: Start accepts. Automaton has 189 states and 292 transitions. Word has length 66
[2025-02-05 16:18:53,216 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:53,216 INFO  L471      AbstractCegarLoop]: Abstraction has 189 states and 292 transitions.
[2025-02-05 16:18:53,216 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:53,216 INFO  L276                IsEmpty]: Start isEmpty. Operand 189 states and 292 transitions.
[2025-02-05 16:18:53,218 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-02-05 16:18:53,218 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:53,218 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:53,218 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 16:18:53,218 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:53,219 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:53,219 INFO  L85        PathProgramCache]: Analyzing trace with hash 1529305302, now seen corresponding path program 1 times
[2025-02-05 16:18:53,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:53,219 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470650385]
[2025-02-05 16:18:53,219 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:53,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:53,231 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-02-05 16:18:53,243 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-02-05 16:18:53,243 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:53,243 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:53,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:53,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:53,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470650385]
[2025-02-05 16:18:53,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470650385] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:53,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:53,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:53,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361125179]
[2025-02-05 16:18:53,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:53,361 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:53,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:53,362 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:53,362 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:53,362 INFO  L87              Difference]: Start difference. First operand 189 states and 292 transitions. Second operand  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:53,423 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:53,424 INFO  L93              Difference]: Finished difference Result 431 states and 692 transitions.
[2025-02-05 16:18:53,427 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:53,428 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68
[2025-02-05 16:18:53,428 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:53,429 INFO  L225             Difference]: With dead ends: 431
[2025-02-05 16:18:53,429 INFO  L226             Difference]: Without dead ends: 302
[2025-02-05 16:18:53,430 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:53,430 INFO  L435           NwaCegarLoop]: 199 mSDtfsCounter, 99 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:53,430 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 365 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:53,431 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 302 states.
[2025-02-05 16:18:53,445 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298.
[2025-02-05 16:18:53,450 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 298 states, 297 states have (on average 1.5858585858585859) internal successors, (471), 297 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:53,451 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 471 transitions.
[2025-02-05 16:18:53,451 INFO  L78                 Accepts]: Start accepts. Automaton has 298 states and 471 transitions. Word has length 68
[2025-02-05 16:18:53,451 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:53,451 INFO  L471      AbstractCegarLoop]: Abstraction has 298 states and 471 transitions.
[2025-02-05 16:18:53,451 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:53,451 INFO  L276                IsEmpty]: Start isEmpty. Operand 298 states and 471 transitions.
[2025-02-05 16:18:53,453 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2025-02-05 16:18:53,453 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:53,453 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:53,453 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 16:18:53,453 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:53,455 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:53,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 814568027, now seen corresponding path program 1 times
[2025-02-05 16:18:53,456 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:53,456 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404470590]
[2025-02-05 16:18:53,456 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:53,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:53,477 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes.
[2025-02-05 16:18:53,492 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements.
[2025-02-05 16:18:53,493 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:53,493 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:53,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:53,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:53,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404470590]
[2025-02-05 16:18:53,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404470590] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:53,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:53,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:53,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482812672]
[2025-02-05 16:18:53,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:53,585 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:53,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:53,586 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:53,586 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:53,586 INFO  L87              Difference]: Start difference. First operand 298 states and 471 transitions. Second operand  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:53,623 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:53,623 INFO  L93              Difference]: Finished difference Result 742 states and 1201 transitions.
[2025-02-05 16:18:53,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:53,626 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70
[2025-02-05 16:18:53,626 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:53,628 INFO  L225             Difference]: With dead ends: 742
[2025-02-05 16:18:53,628 INFO  L226             Difference]: Without dead ends: 504
[2025-02-05 16:18:53,628 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:53,629 INFO  L435           NwaCegarLoop]: 199 mSDtfsCounter, 93 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:53,629 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 366 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:53,632 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 504 states.
[2025-02-05 16:18:53,648 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498.
[2025-02-05 16:18:53,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 498 states, 497 states have (on average 1.5995975855130784) internal successors, (795), 497 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:53,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 795 transitions.
[2025-02-05 16:18:53,657 INFO  L78                 Accepts]: Start accepts. Automaton has 498 states and 795 transitions. Word has length 70
[2025-02-05 16:18:53,658 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:53,658 INFO  L471      AbstractCegarLoop]: Abstraction has 498 states and 795 transitions.
[2025-02-05 16:18:53,658 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:53,658 INFO  L276                IsEmpty]: Start isEmpty. Operand 498 states and 795 transitions.
[2025-02-05 16:18:53,659 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2025-02-05 16:18:53,661 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:53,662 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:53,662 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 16:18:53,662 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:53,662 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:53,662 INFO  L85        PathProgramCache]: Analyzing trace with hash -842124320, now seen corresponding path program 1 times
[2025-02-05 16:18:53,663 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:53,663 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680023225]
[2025-02-05 16:18:53,663 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:53,663 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:53,678 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes.
[2025-02-05 16:18:53,690 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements.
[2025-02-05 16:18:53,691 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:53,691 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:53,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:53,827 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:53,827 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680023225]
[2025-02-05 16:18:53,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680023225] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:53,828 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:53,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:18:53,828 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547875198]
[2025-02-05 16:18:53,828 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:53,828 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:18:53,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:53,832 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:18:53,832 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:53,832 INFO  L87              Difference]: Start difference. First operand 498 states and 795 transitions. Second operand  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:54,013 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:54,013 INFO  L93              Difference]: Finished difference Result 2494 states and 4085 transitions.
[2025-02-05 16:18:54,015 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-02-05 16:18:54,015 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72
[2025-02-05 16:18:54,015 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:54,027 INFO  L225             Difference]: With dead ends: 2494
[2025-02-05 16:18:54,027 INFO  L226             Difference]: Without dead ends: 2056
[2025-02-05 16:18:54,029 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-02-05 16:18:54,030 INFO  L435           NwaCegarLoop]: 198 mSDtfsCounter, 716 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:54,030 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1358 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:18:54,033 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2056 states.
[2025-02-05 16:18:54,072 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 918.
[2025-02-05 16:18:54,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 918 states, 917 states have (on average 1.612868047982552) internal successors, (1479), 917 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:54,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1479 transitions.
[2025-02-05 16:18:54,081 INFO  L78                 Accepts]: Start accepts. Automaton has 918 states and 1479 transitions. Word has length 72
[2025-02-05 16:18:54,081 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:54,081 INFO  L471      AbstractCegarLoop]: Abstraction has 918 states and 1479 transitions.
[2025-02-05 16:18:54,082 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:54,082 INFO  L276                IsEmpty]: Start isEmpty. Operand 918 states and 1479 transitions.
[2025-02-05 16:18:54,083 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-02-05 16:18:54,084 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:54,084 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:54,084 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 16:18:54,084 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:54,085 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:54,085 INFO  L85        PathProgramCache]: Analyzing trace with hash -285194949, now seen corresponding path program 1 times
[2025-02-05 16:18:54,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:54,085 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484406161]
[2025-02-05 16:18:54,085 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:54,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:54,103 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-02-05 16:18:54,117 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-02-05 16:18:54,117 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:54,117 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:54,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:54,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:54,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484406161]
[2025-02-05 16:18:54,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484406161] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:54,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:54,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:18:54,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081064971]
[2025-02-05 16:18:54,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:54,221 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:18:54,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:54,221 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:18:54,221 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:18:54,221 INFO  L87              Difference]: Start difference. First operand 918 states and 1479 transitions. Second operand  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:54,308 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:54,309 INFO  L93              Difference]: Finished difference Result 3318 states and 5402 transitions.
[2025-02-05 16:18:54,309 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:18:54,309 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73
[2025-02-05 16:18:54,310 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:54,318 INFO  L225             Difference]: With dead ends: 3318
[2025-02-05 16:18:54,318 INFO  L226             Difference]: Without dead ends: 2460
[2025-02-05 16:18:54,320 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:54,320 INFO  L435           NwaCegarLoop]: 197 mSDtfsCounter, 357 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:54,320 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 654 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:54,322 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2460 states.
[2025-02-05 16:18:54,362 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 1680.
[2025-02-05 16:18:54,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1680 states, 1679 states have (on average 1.614651578320429) internal successors, (2711), 1679 states have internal predecessors, (2711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:54,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2711 transitions.
[2025-02-05 16:18:54,371 INFO  L78                 Accepts]: Start accepts. Automaton has 1680 states and 2711 transitions. Word has length 73
[2025-02-05 16:18:54,371 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:54,371 INFO  L471      AbstractCegarLoop]: Abstraction has 1680 states and 2711 transitions.
[2025-02-05 16:18:54,371 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:54,372 INFO  L276                IsEmpty]: Start isEmpty. Operand 1680 states and 2711 transitions.
[2025-02-05 16:18:54,373 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2025-02-05 16:18:54,373 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:54,373 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:54,373 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 16:18:54,373 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:54,373 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:54,373 INFO  L85        PathProgramCache]: Analyzing trace with hash -202100674, now seen corresponding path program 1 times
[2025-02-05 16:18:54,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:54,374 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662901561]
[2025-02-05 16:18:54,374 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:54,374 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:54,386 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes.
[2025-02-05 16:18:54,397 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements.
[2025-02-05 16:18:54,398 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:54,398 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:54,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:54,482 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:54,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662901561]
[2025-02-05 16:18:54,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662901561] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:54,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:54,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:18:54,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787998447]
[2025-02-05 16:18:54,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:54,483 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:18:54,483 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:54,484 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:18:54,484 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:18:54,484 INFO  L87              Difference]: Start difference. First operand 1680 states and 2711 transitions. Second operand  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:54,584 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:54,584 INFO  L93              Difference]: Finished difference Result 4944 states and 8046 transitions.
[2025-02-05 16:18:54,584 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:18:54,585 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74
[2025-02-05 16:18:54,586 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:54,596 INFO  L225             Difference]: With dead ends: 4944
[2025-02-05 16:18:54,597 INFO  L226             Difference]: Without dead ends: 3324
[2025-02-05 16:18:54,601 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:54,602 INFO  L435           NwaCegarLoop]: 193 mSDtfsCounter, 357 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:54,603 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 652 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:18:54,606 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3324 states.
[2025-02-05 16:18:54,666 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 2486.
[2025-02-05 16:18:54,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2486 states, 2485 states have (on average 1.6116700201207244) internal successors, (4005), 2485 states have internal predecessors, (4005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:54,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4005 transitions.
[2025-02-05 16:18:54,678 INFO  L78                 Accepts]: Start accepts. Automaton has 2486 states and 4005 transitions. Word has length 74
[2025-02-05 16:18:54,679 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:54,679 INFO  L471      AbstractCegarLoop]: Abstraction has 2486 states and 4005 transitions.
[2025-02-05 16:18:54,679 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:54,679 INFO  L276                IsEmpty]: Start isEmpty. Operand 2486 states and 4005 transitions.
[2025-02-05 16:18:54,681 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2025-02-05 16:18:54,682 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:54,683 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:54,683 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 16:18:54,683 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:54,684 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:54,684 INFO  L85        PathProgramCache]: Analyzing trace with hash -1922992487, now seen corresponding path program 1 times
[2025-02-05 16:18:54,684 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:54,684 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112521462]
[2025-02-05 16:18:54,684 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:54,684 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:54,699 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes.
[2025-02-05 16:18:54,711 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements.
[2025-02-05 16:18:54,711 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:54,711 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:54,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:54,774 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:54,774 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112521462]
[2025-02-05 16:18:54,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112521462] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:54,774 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:54,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:18:54,774 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753227036]
[2025-02-05 16:18:54,774 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:54,775 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:18:54,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:54,775 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:18:54,775 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:18:54,776 INFO  L87              Difference]: Start difference. First operand 2486 states and 4005 transitions. Second operand  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:54,910 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:54,911 INFO  L93              Difference]: Finished difference Result 7296 states and 11834 transitions.
[2025-02-05 16:18:54,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:18:54,911 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75
[2025-02-05 16:18:54,911 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:54,926 INFO  L225             Difference]: With dead ends: 7296
[2025-02-05 16:18:54,926 INFO  L226             Difference]: Without dead ends: 4870
[2025-02-05 16:18:54,929 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:54,931 INFO  L435           NwaCegarLoop]: 193 mSDtfsCounter, 355 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:54,931 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 654 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:54,936 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4870 states.
[2025-02-05 16:18:55,008 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 3656.
[2025-02-05 16:18:55,013 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3656 states, 3655 states have (on average 1.6073871409028728) internal successors, (5875), 3655 states have internal predecessors, (5875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:55,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 5875 transitions.
[2025-02-05 16:18:55,027 INFO  L78                 Accepts]: Start accepts. Automaton has 3656 states and 5875 transitions. Word has length 75
[2025-02-05 16:18:55,027 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:55,027 INFO  L471      AbstractCegarLoop]: Abstraction has 3656 states and 5875 transitions.
[2025-02-05 16:18:55,027 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:55,027 INFO  L276                IsEmpty]: Start isEmpty. Operand 3656 states and 5875 transitions.
[2025-02-05 16:18:55,028 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-02-05 16:18:55,028 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:55,028 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:55,028 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 16:18:55,028 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:55,029 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:55,029 INFO  L85        PathProgramCache]: Analyzing trace with hash 40102235, now seen corresponding path program 1 times
[2025-02-05 16:18:55,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:55,029 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479113309]
[2025-02-05 16:18:55,029 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:55,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:55,043 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-02-05 16:18:55,054 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-02-05 16:18:55,055 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:55,055 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:55,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:55,087 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:55,087 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479113309]
[2025-02-05 16:18:55,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479113309] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:55,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:55,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:55,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092016603]
[2025-02-05 16:18:55,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:55,088 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:55,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:55,088 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:55,089 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:55,089 INFO  L87              Difference]: Start difference. First operand 3656 states and 5875 transitions. Second operand  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:55,166 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:55,166 INFO  L93              Difference]: Finished difference Result 8816 states and 14246 transitions.
[2025-02-05 16:18:55,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:55,167 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2025-02-05 16:18:55,167 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:55,183 INFO  L225             Difference]: With dead ends: 8816
[2025-02-05 16:18:55,183 INFO  L226             Difference]: Without dead ends: 5220
[2025-02-05 16:18:55,188 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:55,188 INFO  L435           NwaCegarLoop]: 285 mSDtfsCounter, 104 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:55,189 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 461 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:55,193 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5220 states.
[2025-02-05 16:18:55,268 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5220 to 5218.
[2025-02-05 16:18:55,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5218 states, 5217 states have (on average 1.6129959746981024) internal successors, (8415), 5217 states have internal predecessors, (8415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:55,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 8415 transitions.
[2025-02-05 16:18:55,293 INFO  L78                 Accepts]: Start accepts. Automaton has 5218 states and 8415 transitions. Word has length 76
[2025-02-05 16:18:55,293 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:55,293 INFO  L471      AbstractCegarLoop]: Abstraction has 5218 states and 8415 transitions.
[2025-02-05 16:18:55,293 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:55,293 INFO  L276                IsEmpty]: Start isEmpty. Operand 5218 states and 8415 transitions.
[2025-02-05 16:18:55,294 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-02-05 16:18:55,294 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:55,294 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:55,294 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 16:18:55,294 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:55,295 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:55,295 INFO  L85        PathProgramCache]: Analyzing trace with hash 1065286811, now seen corresponding path program 1 times
[2025-02-05 16:18:55,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:55,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884142432]
[2025-02-05 16:18:55,295 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:55,295 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:55,304 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-02-05 16:18:55,342 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-02-05 16:18:55,343 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:55,343 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:55,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:55,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:55,376 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884142432]
[2025-02-05 16:18:55,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884142432] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:55,376 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:55,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:55,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599906131]
[2025-02-05 16:18:55,377 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:55,377 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:55,377 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:55,377 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:55,377 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:55,377 INFO  L87              Difference]: Start difference. First operand 5218 states and 8415 transitions. Second operand  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:55,463 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:55,464 INFO  L93              Difference]: Finished difference Result 11633 states and 18769 transitions.
[2025-02-05 16:18:55,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:55,464 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2025-02-05 16:18:55,464 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:55,487 INFO  L225             Difference]: With dead ends: 11633
[2025-02-05 16:18:55,487 INFO  L226             Difference]: Without dead ends: 7916
[2025-02-05 16:18:55,493 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:55,493 INFO  L435           NwaCegarLoop]: 281 mSDtfsCounter, 98 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:55,494 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 458 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:55,500 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7916 states.
[2025-02-05 16:18:55,618 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7916 to 7914.
[2025-02-05 16:18:55,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7914 states, 7913 states have (on average 1.596865916845697) internal successors, (12636), 7913 states have internal predecessors, (12636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:55,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7914 states to 7914 states and 12636 transitions.
[2025-02-05 16:18:55,655 INFO  L78                 Accepts]: Start accepts. Automaton has 7914 states and 12636 transitions. Word has length 76
[2025-02-05 16:18:55,655 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:55,655 INFO  L471      AbstractCegarLoop]: Abstraction has 7914 states and 12636 transitions.
[2025-02-05 16:18:55,656 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:55,656 INFO  L276                IsEmpty]: Start isEmpty. Operand 7914 states and 12636 transitions.
[2025-02-05 16:18:55,656 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-02-05 16:18:55,656 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:55,656 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:55,656 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 16:18:55,657 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:55,657 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:55,657 INFO  L85        PathProgramCache]: Analyzing trace with hash -432439333, now seen corresponding path program 1 times
[2025-02-05 16:18:55,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:55,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529119681]
[2025-02-05 16:18:55,657 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:55,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:55,666 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-02-05 16:18:55,673 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-02-05 16:18:55,674 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:55,674 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:55,741 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:55,745 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:55,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529119681]
[2025-02-05 16:18:55,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529119681] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:55,746 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:55,746 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:18:55,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843245477]
[2025-02-05 16:18:55,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:55,746 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:18:55,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:55,747 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:18:55,747 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:55,747 INFO  L87              Difference]: Start difference. First operand 7914 states and 12636 transitions. Second operand  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:55,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:55,923 INFO  L93              Difference]: Finished difference Result 17538 states and 27984 transitions.
[2025-02-05 16:18:55,923 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:18:55,924 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2025-02-05 16:18:55,924 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:55,945 INFO  L225             Difference]: With dead ends: 17538
[2025-02-05 16:18:55,946 INFO  L226             Difference]: Without dead ends: 11867
[2025-02-05 16:18:55,955 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:18:55,956 INFO  L435           NwaCegarLoop]: 269 mSDtfsCounter, 92 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:55,956 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 447 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:55,965 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11867 states.
[2025-02-05 16:18:56,221 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 11865.
[2025-02-05 16:18:56,237 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11865 states, 11864 states have (on average 1.5761968981793661) internal successors, (18700), 11864 states have internal predecessors, (18700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:56,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11865 states to 11865 states and 18700 transitions.
[2025-02-05 16:18:56,267 INFO  L78                 Accepts]: Start accepts. Automaton has 11865 states and 18700 transitions. Word has length 76
[2025-02-05 16:18:56,267 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:56,268 INFO  L471      AbstractCegarLoop]: Abstraction has 11865 states and 18700 transitions.
[2025-02-05 16:18:56,268 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:56,268 INFO  L276                IsEmpty]: Start isEmpty. Operand 11865 states and 18700 transitions.
[2025-02-05 16:18:56,268 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2025-02-05 16:18:56,268 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:56,269 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:56,269 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 16:18:56,269 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:56,269 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:56,269 INFO  L85        PathProgramCache]: Analyzing trace with hash 288360439, now seen corresponding path program 1 times
[2025-02-05 16:18:56,269 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:56,269 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081742926]
[2025-02-05 16:18:56,270 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:56,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:56,280 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes.
[2025-02-05 16:18:56,289 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements.
[2025-02-05 16:18:56,289 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:56,290 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:56,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:56,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:56,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081742926]
[2025-02-05 16:18:56,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081742926] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:56,479 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:56,479 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:18:56,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411354802]
[2025-02-05 16:18:56,479 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:56,480 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:18:56,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:56,480 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:18:56,480 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:56,480 INFO  L87              Difference]: Start difference. First operand 11865 states and 18700 transitions. Second operand  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:56,715 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:56,715 INFO  L93              Difference]: Finished difference Result 23654 states and 37297 transitions.
[2025-02-05 16:18:56,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:18:56,716 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2025-02-05 16:18:56,716 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:56,740 INFO  L225             Difference]: With dead ends: 23654
[2025-02-05 16:18:56,741 INFO  L226             Difference]: Without dead ends: 11867
[2025-02-05 16:18:56,754 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:18:56,755 INFO  L435           NwaCegarLoop]: 200 mSDtfsCounter, 283 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:56,755 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 538 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:56,766 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11867 states.
[2025-02-05 16:18:57,023 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 11865.
[2025-02-05 16:18:57,040 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11865 states, 11864 states have (on average 1.563553607552259) internal successors, (18550), 11864 states have internal predecessors, (18550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:57,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11865 states to 11865 states and 18550 transitions.
[2025-02-05 16:18:57,068 INFO  L78                 Accepts]: Start accepts. Automaton has 11865 states and 18550 transitions. Word has length 77
[2025-02-05 16:18:57,068 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:57,069 INFO  L471      AbstractCegarLoop]: Abstraction has 11865 states and 18550 transitions.
[2025-02-05 16:18:57,069 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:57,070 INFO  L276                IsEmpty]: Start isEmpty. Operand 11865 states and 18550 transitions.
[2025-02-05 16:18:57,070 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-02-05 16:18:57,070 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:57,070 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:57,070 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 16:18:57,070 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:57,071 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:57,071 INFO  L85        PathProgramCache]: Analyzing trace with hash -2017343017, now seen corresponding path program 1 times
[2025-02-05 16:18:57,071 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:57,071 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979983071]
[2025-02-05 16:18:57,071 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:57,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:57,081 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-02-05 16:18:57,092 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-02-05 16:18:57,093 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:57,093 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:57,217 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:57,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:57,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979983071]
[2025-02-05 16:18:57,218 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979983071] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:57,218 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:57,218 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:18:57,218 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035473642]
[2025-02-05 16:18:57,218 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:57,218 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:18:57,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:57,219 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:18:57,219 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:57,219 INFO  L87              Difference]: Start difference. First operand 11865 states and 18550 transitions. Second operand  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:57,553 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:57,554 INFO  L93              Difference]: Finished difference Result 34237 states and 53673 transitions.
[2025-02-05 16:18:57,554 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:18:57,554 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 80
[2025-02-05 16:18:57,554 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:57,597 INFO  L225             Difference]: With dead ends: 34237
[2025-02-05 16:18:57,598 INFO  L226             Difference]: Without dead ends: 22450
[2025-02-05 16:18:57,611 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-02-05 16:18:57,612 INFO  L435           NwaCegarLoop]: 192 mSDtfsCounter, 277 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:57,612 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 540 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:57,629 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22450 states.
[2025-02-05 16:18:58,052 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22450 to 22448.
[2025-02-05 16:18:58,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22448 states, 22447 states have (on average 1.5508531206842786) internal successors, (34812), 22447 states have internal predecessors, (34812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:58,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22448 states to 22448 states and 34812 transitions.
[2025-02-05 16:18:58,124 INFO  L78                 Accepts]: Start accepts. Automaton has 22448 states and 34812 transitions. Word has length 80
[2025-02-05 16:18:58,124 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:58,124 INFO  L471      AbstractCegarLoop]: Abstraction has 22448 states and 34812 transitions.
[2025-02-05 16:18:58,125 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:58,125 INFO  L276                IsEmpty]: Start isEmpty. Operand 22448 states and 34812 transitions.
[2025-02-05 16:18:58,126 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-02-05 16:18:58,126 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:58,126 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 16:18:58,126 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 16:18:58,126 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:58,126 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:58,127 INFO  L85        PathProgramCache]: Analyzing trace with hash 1919260688, now seen corresponding path program 1 times
[2025-02-05 16:18:58,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:58,127 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597768291]
[2025-02-05 16:18:58,127 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:58,127 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:58,139 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-02-05 16:18:58,162 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-02-05 16:18:58,163 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:58,163 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:58,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:18:58,320 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:58,320 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597768291]
[2025-02-05 16:18:58,320 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597768291] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:58,320 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:58,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:18:58,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947905219]
[2025-02-05 16:18:58,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:58,321 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:18:58,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:58,321 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:18:58,322 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:58,322 INFO  L87              Difference]: Start difference. First operand 22448 states and 34812 transitions. Second operand  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:58,630 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:58,630 INFO  L93              Difference]: Finished difference Result 23611 states and 36361 transitions.
[2025-02-05 16:18:58,631 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:18:58,631 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2025-02-05 16:18:58,631 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:18:58,679 INFO  L225             Difference]: With dead ends: 23611
[2025-02-05 16:18:58,680 INFO  L226             Difference]: Without dead ends: 23609
[2025-02-05 16:18:58,692 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:58,692 INFO  L435           NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:18:58,693 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 782 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:18:58,716 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23609 states.
[2025-02-05 16:18:59,174 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23609 to 23609.
[2025-02-05 16:18:59,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23609 states, 23608 states have (on average 1.5233819044391732) internal successors, (35964), 23608 states have internal predecessors, (35964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:59,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23609 states to 23609 states and 35964 transitions.
[2025-02-05 16:18:59,244 INFO  L78                 Accepts]: Start accepts. Automaton has 23609 states and 35964 transitions. Word has length 81
[2025-02-05 16:18:59,244 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:18:59,244 INFO  L471      AbstractCegarLoop]: Abstraction has 23609 states and 35964 transitions.
[2025-02-05 16:18:59,244 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:59,244 INFO  L276                IsEmpty]: Start isEmpty. Operand 23609 states and 35964 transitions.
[2025-02-05 16:18:59,246 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-02-05 16:18:59,246 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:18:59,247 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:18:59,247 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 16:18:59,247 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:18:59,247 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:18:59,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -460291343, now seen corresponding path program 1 times
[2025-02-05 16:18:59,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:18:59,248 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421478517]
[2025-02-05 16:18:59,248 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:18:59,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:18:59,259 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-02-05 16:18:59,269 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-02-05 16:18:59,269 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:18:59,269 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:18:59,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:18:59,368 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:18:59,368 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421478517]
[2025-02-05 16:18:59,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421478517] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:18:59,369 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:18:59,369 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:18:59,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818495952]
[2025-02-05 16:18:59,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:18:59,370 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:18:59,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:18:59,371 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:18:59,371 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:18:59,371 INFO  L87              Difference]: Start difference. First operand 23609 states and 35964 transitions. Second operand  has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:18:59,907 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:18:59,907 INFO  L93              Difference]: Finished difference Result 61773 states and 94270 transitions.
[2025-02-05 16:18:59,908 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:18:59,908 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-02-05 16:18:59,908 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:00,001 INFO  L225             Difference]: With dead ends: 61773
[2025-02-05 16:19:00,001 INFO  L226             Difference]: Without dead ends: 48161
[2025-02-05 16:19:00,029 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:19:00,030 INFO  L435           NwaCegarLoop]: 310 mSDtfsCounter, 439 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:00,030 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 948 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:00,060 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48161 states.
[2025-02-05 16:19:00,566 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48161 to 36809.
[2025-02-05 16:19:00,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36809 states, 36808 states have (on average 1.5208106933275376) internal successors, (55978), 36808 states have internal predecessors, (55978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,803 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36809 states to 36809 states and 55978 transitions.
[2025-02-05 16:19:00,805 INFO  L78                 Accepts]: Start accepts. Automaton has 36809 states and 55978 transitions. Word has length 109
[2025-02-05 16:19:00,806 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:00,806 INFO  L471      AbstractCegarLoop]: Abstraction has 36809 states and 55978 transitions.
[2025-02-05 16:19:00,806 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:00,806 INFO  L276                IsEmpty]: Start isEmpty. Operand 36809 states and 55978 transitions.
[2025-02-05 16:19:00,808 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-02-05 16:19:00,808 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:00,808 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:19:00,808 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 16:19:00,808 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:00,808 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:00,809 INFO  L85        PathProgramCache]: Analyzing trace with hash 564893233, now seen corresponding path program 1 times
[2025-02-05 16:19:00,809 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:00,809 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439696633]
[2025-02-05 16:19:00,809 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:00,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:00,820 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-02-05 16:19:00,830 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-02-05 16:19:00,830 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:00,830 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:00,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-02-05 16:19:00,931 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:00,931 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439696633]
[2025-02-05 16:19:00,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439696633] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:00,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:00,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:00,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169535389]
[2025-02-05 16:19:00,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:00,931 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:00,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:00,932 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:00,932 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:00,932 INFO  L87              Difference]: Start difference. First operand 36809 states and 55978 transitions. Second operand  has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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-02-05 16:19:01,500 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:01,500 INFO  L93              Difference]: Finished difference Result 67875 states and 103681 transitions.
[2025-02-05 16:19:01,501 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:01,501 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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 109
[2025-02-05 16:19:01,501 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:01,590 INFO  L225             Difference]: With dead ends: 67875
[2025-02-05 16:19:01,590 INFO  L226             Difference]: Without dead ends: 56929
[2025-02-05 16:19:01,607 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:19:01,608 INFO  L435           NwaCegarLoop]: 316 mSDtfsCounter, 446 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:01,608 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 862 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:01,641 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56929 states.
[2025-02-05 16:19:02,513 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56929 to 51431.
[2025-02-05 16:19:02,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51431 states, 51430 states have (on average 1.5198716702313824) internal successors, (78167), 51430 states have internal predecessors, (78167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:02,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51431 states to 51431 states and 78167 transitions.
[2025-02-05 16:19:02,642 INFO  L78                 Accepts]: Start accepts. Automaton has 51431 states and 78167 transitions. Word has length 109
[2025-02-05 16:19:02,642 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:02,642 INFO  L471      AbstractCegarLoop]: Abstraction has 51431 states and 78167 transitions.
[2025-02-05 16:19:02,642 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 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-02-05 16:19:02,643 INFO  L276                IsEmpty]: Start isEmpty. Operand 51431 states and 78167 transitions.
[2025-02-05 16:19:02,644 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-02-05 16:19:02,644 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:02,644 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:19:02,644 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 16:19:02,645 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:02,645 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:02,645 INFO  L85        PathProgramCache]: Analyzing trace with hash -932832911, now seen corresponding path program 1 times
[2025-02-05 16:19:02,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:02,645 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844641882]
[2025-02-05 16:19:02,645 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:02,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:02,655 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-02-05 16:19:02,665 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-02-05 16:19:02,665 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:02,665 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:02,752 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-02-05 16:19:02,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:02,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844641882]
[2025-02-05 16:19:02,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844641882] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:02,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:02,753 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 16:19:02,753 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234247951]
[2025-02-05 16:19:02,753 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:02,753 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 16:19:02,753 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:02,753 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 16:19:02,754 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 16:19:02,754 INFO  L87              Difference]: Start difference. First operand 51431 states and 78167 transitions. Second operand  has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:03,439 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:03,439 INFO  L93              Difference]: Finished difference Result 72291 states and 110449 transitions.
[2025-02-05 16:19:03,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 16:19:03,440 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109
[2025-02-05 16:19:03,440 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:03,666 INFO  L225             Difference]: With dead ends: 72291
[2025-02-05 16:19:03,667 INFO  L226             Difference]: Without dead ends: 61345
[2025-02-05 16:19:03,685 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 16:19:03,685 INFO  L435           NwaCegarLoop]: 317 mSDtfsCounter, 456 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:03,685 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 882 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 16:19:03,719 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61345 states.
[2025-02-05 16:19:04,394 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61345 to 59123.
[2025-02-05 16:19:04,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 59123 states, 59122 states have (on average 1.5219546023476878) internal successors, (89981), 59122 states have internal predecessors, (89981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:04,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59123 states to 59123 states and 89981 transitions.
[2025-02-05 16:19:04,539 INFO  L78                 Accepts]: Start accepts. Automaton has 59123 states and 89981 transitions. Word has length 109
[2025-02-05 16:19:04,539 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:04,539 INFO  L471      AbstractCegarLoop]: Abstraction has 59123 states and 89981 transitions.
[2025-02-05 16:19:04,539 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:04,539 INFO  L276                IsEmpty]: Start isEmpty. Operand 59123 states and 89981 transitions.
[2025-02-05 16:19:04,541 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-02-05 16:19:04,541 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:04,541 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:19:04,542 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 16:19:04,542 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:04,542 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:04,542 INFO  L85        PathProgramCache]: Analyzing trace with hash -1333274550, now seen corresponding path program 1 times
[2025-02-05 16:19:04,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:04,542 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704924852]
[2025-02-05 16:19:04,542 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:04,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:04,551 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-02-05 16:19:04,560 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-02-05 16:19:04,560 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:04,560 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:04,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:19:04,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:04,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704924852]
[2025-02-05 16:19:04,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704924852] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:04,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:04,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 16:19:04,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956739499]
[2025-02-05 16:19:04,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:04,623 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 16:19:04,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:04,623 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 16:19:04,623 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:19:04,623 INFO  L87              Difference]: Start difference. First operand 59123 states and 89981 transitions. Second operand  has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:05,439 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:05,439 INFO  L93              Difference]: Finished difference Result 101592 states and 155179 transitions.
[2025-02-05 16:19:05,439 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 16:19:05,440 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110
[2025-02-05 16:19:05,440 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:05,587 INFO  L225             Difference]: With dead ends: 101592
[2025-02-05 16:19:05,587 INFO  L226             Difference]: Without dead ends: 79212
[2025-02-05 16:19:05,631 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 16:19:05,632 INFO  L435           NwaCegarLoop]: 305 mSDtfsCounter, 187 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:05,632 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 676 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:05,701 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79212 states.
[2025-02-05 16:19:07,139 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79212 to 76992.
[2025-02-05 16:19:07,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76992 states, 76991 states have (on average 1.519671130391864) internal successors, (117001), 76991 states have internal predecessors, (117001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:07,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76992 states to 76992 states and 117001 transitions.
[2025-02-05 16:19:07,377 INFO  L78                 Accepts]: Start accepts. Automaton has 76992 states and 117001 transitions. Word has length 110
[2025-02-05 16:19:07,378 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:07,378 INFO  L471      AbstractCegarLoop]: Abstraction has 76992 states and 117001 transitions.
[2025-02-05 16:19:07,378 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:07,378 INFO  L276                IsEmpty]: Start isEmpty. Operand 76992 states and 117001 transitions.
[2025-02-05 16:19:07,380 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-02-05 16:19:07,380 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:07,380 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:19:07,381 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 16:19:07,381 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:07,381 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:07,381 INFO  L85        PathProgramCache]: Analyzing trace with hash -1121923637, now seen corresponding path program 1 times
[2025-02-05 16:19:07,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:07,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468604302]
[2025-02-05 16:19:07,382 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:07,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:07,394 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-02-05 16:19:07,405 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-02-05 16:19:07,406 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:07,406 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:07,458 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-02-05 16:19:07,458 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:07,458 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468604302]
[2025-02-05 16:19:07,458 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468604302] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:07,458 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:07,458 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:07,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89100750]
[2025-02-05 16:19:07,459 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:07,459 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:07,459 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:07,459 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:07,460 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:07,460 INFO  L87              Difference]: Start difference. First operand 76992 states and 117001 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:08,746 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:08,747 INFO  L93              Difference]: Finished difference Result 176286 states and 268200 transitions.
[2025-02-05 16:19:08,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:08,748 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110
[2025-02-05 16:19:08,748 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:09,071 INFO  L225             Difference]: With dead ends: 176286
[2025-02-05 16:19:09,072 INFO  L226             Difference]: Without dead ends: 135992
[2025-02-05 16:19:09,116 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:09,117 INFO  L435           NwaCegarLoop]: 201 mSDtfsCounter, 81 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:09,117 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 371 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:09,195 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 135992 states.
[2025-02-05 16:19:11,128 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 135992 to 135714.
[2025-02-05 16:19:11,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 135714 states, 135713 states have (on average 1.516988055676317) internal successors, (205875), 135713 states have internal predecessors, (205875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:11,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 135714 states to 135714 states and 205875 transitions.
[2025-02-05 16:19:11,446 INFO  L78                 Accepts]: Start accepts. Automaton has 135714 states and 205875 transitions. Word has length 110
[2025-02-05 16:19:11,447 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:11,447 INFO  L471      AbstractCegarLoop]: Abstraction has 135714 states and 205875 transitions.
[2025-02-05 16:19:11,447 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:11,447 INFO  L276                IsEmpty]: Start isEmpty. Operand 135714 states and 205875 transitions.
[2025-02-05 16:19:11,449 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-02-05 16:19:11,449 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:11,449 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:19:11,449 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-05 16:19:11,449 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:11,449 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:11,449 INFO  L85        PathProgramCache]: Analyzing trace with hash 665586502, now seen corresponding path program 1 times
[2025-02-05 16:19:11,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:11,450 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711355145]
[2025-02-05 16:19:11,450 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:11,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:11,461 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-02-05 16:19:11,468 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-02-05 16:19:11,468 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:11,468 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:11,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:11,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:11,516 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711355145]
[2025-02-05 16:19:11,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711355145] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:11,517 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:11,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:11,517 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320852705]
[2025-02-05 16:19:11,517 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:11,517 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:11,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:11,518 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:11,518 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:11,518 INFO  L87              Difference]: Start difference. First operand 135714 states and 205875 transitions. Second operand  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:14,318 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:14,318 INFO  L93              Difference]: Finished difference Result 404346 states and 612088 transitions.
[2025-02-05 16:19:14,319 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:14,319 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111
[2025-02-05 16:19:14,319 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:14,840 INFO  L225             Difference]: With dead ends: 404346
[2025-02-05 16:19:14,841 INFO  L226             Difference]: Without dead ends: 268704
[2025-02-05 16:19:14,943 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:14,946 INFO  L435           NwaCegarLoop]: 258 mSDtfsCounter, 132 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:14,947 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 452 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:15,201 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 268704 states.
[2025-02-05 16:19:19,407 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 268704 to 268702.
[2025-02-05 16:19:19,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 268702 states, 268701 states have (on average 1.5020561888493158) internal successors, (403604), 268701 states have internal predecessors, (403604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:20,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 268702 states to 268702 states and 403604 transitions.
[2025-02-05 16:19:20,036 INFO  L78                 Accepts]: Start accepts. Automaton has 268702 states and 403604 transitions. Word has length 111
[2025-02-05 16:19:20,037 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 16:19:20,037 INFO  L471      AbstractCegarLoop]: Abstraction has 268702 states and 403604 transitions.
[2025-02-05 16:19:20,037 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:20,037 INFO  L276                IsEmpty]: Start isEmpty. Operand 268702 states and 403604 transitions.
[2025-02-05 16:19:20,040 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-02-05 16:19:20,040 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 16:19:20,040 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 16:19:20,040 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-05 16:19:20,040 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 16:19:20,041 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 16:19:20,041 INFO  L85        PathProgramCache]: Analyzing trace with hash 757077958, now seen corresponding path program 1 times
[2025-02-05 16:19:20,041 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 16:19:20,041 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75767162]
[2025-02-05 16:19:20,041 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 16:19:20,041 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 16:19:20,050 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-02-05 16:19:20,057 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-02-05 16:19:20,057 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 16:19:20,057 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 16:19:20,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 16:19:20,085 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 16:19:20,085 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75767162]
[2025-02-05 16:19:20,086 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75767162] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 16:19:20,086 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 16:19:20,086 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 16:19:20,086 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620129663]
[2025-02-05 16:19:20,086 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 16:19:20,086 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 16:19:20,086 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 16:19:20,086 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 16:19:20,086 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:20,087 INFO  L87              Difference]: Start difference. First operand 268702 states and 403604 transitions. Second operand  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 16:19:26,313 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 16:19:26,313 INFO  L93              Difference]: Finished difference Result 800555 states and 1199813 transitions.
[2025-02-05 16:19:26,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 16:19:26,314 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111
[2025-02-05 16:19:26,314 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 16:19:27,417 INFO  L225             Difference]: With dead ends: 800555
[2025-02-05 16:19:27,418 INFO  L226             Difference]: Without dead ends: 531987
[2025-02-05 16:19:27,606 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 16:19:27,607 INFO  L435           NwaCegarLoop]: 284 mSDtfsCounter, 151 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 16:19:27,607 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 478 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 16:19:28,051 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 531987 states.