./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8373cb8fe582bc9cb45d9609c89b33bf31b030c114c7e7fdfee851d52974fb9
[2025-03-03 09:44:05,749 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:44:05,757 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:44:05,759 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:44:05,760 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:44:05,761 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:44:05,762 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c
[2025-03-03 09:44:06,910 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/022d663f3/5b63a040446e4d319e51efb62db16f87/FLAGc6fcdc0a4
[2025-03-03 09:44:07,191 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:44:07,192 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c
[2025-03-03 09:44:07,203 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/022d663f3/5b63a040446e4d319e51efb62db16f87/FLAGc6fcdc0a4
[2025-03-03 09:44:07,484 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/022d663f3/5b63a040446e4d319e51efb62db16f87
[2025-03-03 09:44:07,486 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:44:07,487 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:44:07,488 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:44:07,488 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:44:07,493 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:44:07,494 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,495 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c199b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07, skipping insertion in model container
[2025-03-03 09:44:07,496 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,514 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:44:07,674 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c[44494,44507]
[2025-03-03 09:44:07,683 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:44:07,689 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:44:07,736 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c[44494,44507]
[2025-03-03 09:44:07,742 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:44:07,756 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:44:07,756 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07 WrapperNode
[2025-03-03 09:44:07,757 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:44:07,757 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:44:07,758 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:44:07,758 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:44:07,763 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,772 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,806 INFO  L138                Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 649
[2025-03-03 09:44:07,807 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:44:07,807 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:44:07,808 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:44:07,808 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:44:07,813 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,813 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,816 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,825 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 09:44:07,825 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,826 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,831 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,832 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,833 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,833 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,835 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:44:07,836 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:44:07,836 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:44:07,836 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:44:07,837 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (1/1) ...
[2025-03-03 09:44:07,845 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:44:07,857 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:44:07,869 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 09:44:07,873 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 09:44:07,891 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:44:07,891 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 09:44:07,891 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:44:07,891 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:44:07,961 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:44:07,962 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:44:08,384 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume false;
[2025-03-03 09:44:08,384 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume !false;
[2025-03-03 09:44:08,421 INFO  L?                        ?]: Removed 119 outVars from TransFormulas that were not future-live.
[2025-03-03 09:44:08,422 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:44:08,449 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:44:08,450 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:44:08,450 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:08 BoogieIcfgContainer
[2025-03-03 09:44:08,450 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:44:08,452 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:44:08,452 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:44:08,456 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:44:08,457 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:44:07" (1/3) ...
[2025-03-03 09:44:08,457 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a75673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:08, skipping insertion in model container
[2025-03-03 09:44:08,457 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:44:07" (2/3) ...
[2025-03-03 09:44:08,458 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a75673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:44:08, skipping insertion in model container
[2025-03-03 09:44:08,458 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:08" (3/3) ...
[2025-03-03 09:44:08,459 INFO  L128   eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c
[2025-03-03 09:44:08,472 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:44:08,473 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG s3_srvr_3a.BV.c.cil.c that has 1 procedures, 171 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 09:44:08,531 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:44:08,542 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;@77ecc64f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:44:08,542 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:44:08,549 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 171 states, 169 states have (on average 1.7218934911242603) internal successors, (291), 170 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:08,554 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2025-03-03 09:44:08,555 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:08,555 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:08,555 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:08,559 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:08,559 INFO  L85        PathProgramCache]: Analyzing trace with hash 1577144144, now seen corresponding path program 1 times
[2025-03-03 09:44:08,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:08,565 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756075908]
[2025-03-03 09:44:08,565 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:08,565 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:08,616 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-03-03 09:44:08,643 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-03-03 09:44:08,643 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:08,644 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:08,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:44:08,830 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:08,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756075908]
[2025-03-03 09:44:08,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756075908] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:08,831 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:08,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:08,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472292089]
[2025-03-03 09:44:08,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:08,836 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:08,837 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:08,849 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:08,849 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:08,850 INFO  L87              Difference]: Start difference. First operand  has 171 states, 169 states have (on average 1.7218934911242603) internal successors, (291), 170 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:09,057 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:09,058 INFO  L93              Difference]: Finished difference Result 371 states and 639 transitions.
[2025-03-03 09:44:09,058 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:09,059 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45
[2025-03-03 09:44:09,060 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:09,066 INFO  L225             Difference]: With dead ends: 371
[2025-03-03 09:44:09,067 INFO  L226             Difference]: Without dead ends: 191
[2025-03-03 09:44:09,070 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:09,072 INFO  L435           NwaCegarLoop]: 200 mSDtfsCounter, 56 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:09,073 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 337 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 09:44:09,084 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2025-03-03 09:44:09,098 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189.
[2025-03-03 09:44:09,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 189 states, 188 states have (on average 1.6117021276595744) internal successors, (303), 188 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:09,104 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 303 transitions.
[2025-03-03 09:44:09,106 INFO  L78                 Accepts]: Start accepts. Automaton has 189 states and 303 transitions. Word has length 45
[2025-03-03 09:44:09,106 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:09,106 INFO  L471      AbstractCegarLoop]: Abstraction has 189 states and 303 transitions.
[2025-03-03 09:44:09,106 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:09,106 INFO  L276                IsEmpty]: Start isEmpty. Operand 189 states and 303 transitions.
[2025-03-03 09:44:09,107 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2025-03-03 09:44:09,107 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:09,107 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:09,107 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 09:44:09,108 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:09,108 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:09,108 INFO  L85        PathProgramCache]: Analyzing trace with hash 1654935582, now seen corresponding path program 1 times
[2025-03-03 09:44:09,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:09,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666509648]
[2025-03-03 09:44:09,108 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:09,109 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:09,115 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes.
[2025-03-03 09:44:09,121 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements.
[2025-03-03 09:44:09,121 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:09,121 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:09,173 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:44:09,173 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:09,173 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666509648]
[2025-03-03 09:44:09,173 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666509648] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:09,173 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:09,173 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:09,173 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553357204]
[2025-03-03 09:44:09,173 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:09,174 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:09,174 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:09,175 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:09,175 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:09,175 INFO  L87              Difference]: Start difference. First operand 189 states and 303 transitions. Second operand  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:09,220 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:09,220 INFO  L93              Difference]: Finished difference Result 536 states and 863 transitions.
[2025-03-03 09:44:09,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:09,220 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46
[2025-03-03 09:44:09,221 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:09,222 INFO  L225             Difference]: With dead ends: 536
[2025-03-03 09:44:09,222 INFO  L226             Difference]: Without dead ends: 361
[2025-03-03 09:44:09,223 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:09,223 INFO  L435           NwaCegarLoop]: 213 mSDtfsCounter, 177 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:09,223 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 402 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:44:09,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 361 states.
[2025-03-03 09:44:09,234 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361.
[2025-03-03 09:44:09,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 361 states, 360 states have (on average 1.6027777777777779) internal successors, (577), 360 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:09,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 577 transitions.
[2025-03-03 09:44:09,236 INFO  L78                 Accepts]: Start accepts. Automaton has 361 states and 577 transitions. Word has length 46
[2025-03-03 09:44:09,236 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:09,236 INFO  L471      AbstractCegarLoop]: Abstraction has 361 states and 577 transitions.
[2025-03-03 09:44:09,236 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:09,236 INFO  L276                IsEmpty]: Start isEmpty. Operand 361 states and 577 transitions.
[2025-03-03 09:44:09,239 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2025-03-03 09:44:09,239 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:09,240 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:09,240 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 09:44:09,240 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:09,240 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:09,240 INFO  L85        PathProgramCache]: Analyzing trace with hash 605997846, now seen corresponding path program 1 times
[2025-03-03 09:44:09,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:09,240 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922454867]
[2025-03-03 09:44:09,240 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:09,240 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:09,275 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes.
[2025-03-03 09:44:09,286 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements.
[2025-03-03 09:44:09,289 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:09,289 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:09,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:44:09,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:09,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922454867]
[2025-03-03 09:44:09,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922454867] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:09,332 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:09,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:09,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298553685]
[2025-03-03 09:44:09,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:09,332 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:09,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:09,333 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:09,333 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:09,333 INFO  L87              Difference]: Start difference. First operand 361 states and 577 transitions. Second operand  has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:09,448 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:09,448 INFO  L93              Difference]: Finished difference Result 557 states and 891 transitions.
[2025-03-03 09:44:09,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:09,449 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62
[2025-03-03 09:44:09,449 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:09,450 INFO  L225             Difference]: With dead ends: 557
[2025-03-03 09:44:09,450 INFO  L226             Difference]: Without dead ends: 382
[2025-03-03 09:44:09,451 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:09,451 INFO  L435           NwaCegarLoop]: 229 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:09,452 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 359 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:44:09,456 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 382 states.
[2025-03-03 09:44:09,470 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382.
[2025-03-03 09:44:09,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 382 states, 381 states have (on average 1.5826771653543308) internal successors, (603), 381 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:09,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 603 transitions.
[2025-03-03 09:44:09,475 INFO  L78                 Accepts]: Start accepts. Automaton has 382 states and 603 transitions. Word has length 62
[2025-03-03 09:44:09,475 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:09,476 INFO  L471      AbstractCegarLoop]: Abstraction has 382 states and 603 transitions.
[2025-03-03 09:44:09,476 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:09,476 INFO  L276                IsEmpty]: Start isEmpty. Operand 382 states and 603 transitions.
[2025-03-03 09:44:09,477 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-03-03 09:44:09,477 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:09,478 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 09:44:09,478 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 09:44:09,478 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:09,478 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:09,479 INFO  L85        PathProgramCache]: Analyzing trace with hash -679785160, now seen corresponding path program 1 times
[2025-03-03 09:44:09,479 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:09,479 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424449470]
[2025-03-03 09:44:09,479 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:09,479 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:09,491 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-03-03 09:44:09,500 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-03-03 09:44:09,501 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:09,504 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:09,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-03-03 09:44:09,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:09,549 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424449470]
[2025-03-03 09:44:09,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424449470] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:09,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:09,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:09,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479085833]
[2025-03-03 09:44:09,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:09,550 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:09,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:09,551 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:09,551 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:09,551 INFO  L87              Difference]: Start difference. First operand 382 states and 603 transitions. Second operand  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-03-03 09:44:09,688 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:09,688 INFO  L93              Difference]: Finished difference Result 834 states and 1330 transitions.
[2025-03-03 09:44:09,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:09,689 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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 83
[2025-03-03 09:44:09,689 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:09,691 INFO  L225             Difference]: With dead ends: 834
[2025-03-03 09:44:09,691 INFO  L226             Difference]: Without dead ends: 466
[2025-03-03 09:44:09,692 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:09,693 INFO  L435           NwaCegarLoop]: 230 mSDtfsCounter, 10 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:09,695 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 360 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:44:09,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 466 states.
[2025-03-03 09:44:09,706 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466.
[2025-03-03 09:44:09,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 466 states, 465 states have (on average 1.4989247311827958) internal successors, (697), 465 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:09,709 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 697 transitions.
[2025-03-03 09:44:09,709 INFO  L78                 Accepts]: Start accepts. Automaton has 466 states and 697 transitions. Word has length 83
[2025-03-03 09:44:09,710 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:09,710 INFO  L471      AbstractCegarLoop]: Abstraction has 466 states and 697 transitions.
[2025-03-03 09:44:09,710 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-03-03 09:44:09,710 INFO  L276                IsEmpty]: Start isEmpty. Operand 466 states and 697 transitions.
[2025-03-03 09:44:09,712 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-03-03 09:44:09,712 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:09,712 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-03-03 09:44:09,712 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 09:44:09,713 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:09,713 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:09,713 INFO  L85        PathProgramCache]: Analyzing trace with hash -1128481799, now seen corresponding path program 1 times
[2025-03-03 09:44:09,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:09,713 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346586067]
[2025-03-03 09:44:09,714 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:09,714 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:09,723 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-03-03 09:44:09,732 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-03-03 09:44:09,732 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:09,732 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:09,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-03-03 09:44:09,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:09,771 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346586067]
[2025-03-03 09:44:09,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346586067] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:09,771 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:09,771 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:09,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564347624]
[2025-03-03 09:44:09,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:09,771 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:09,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:09,772 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:09,773 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:09,773 INFO  L87              Difference]: Start difference. First operand 466 states and 697 transitions. Second operand  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-03-03 09:44:09,903 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:09,904 INFO  L93              Difference]: Finished difference Result 964 states and 1446 transitions.
[2025-03-03 09:44:09,904 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:09,904 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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 83
[2025-03-03 09:44:09,905 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:09,907 INFO  L225             Difference]: With dead ends: 964
[2025-03-03 09:44:09,908 INFO  L226             Difference]: Without dead ends: 512
[2025-03-03 09:44:09,908 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:09,909 INFO  L435           NwaCegarLoop]: 230 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:09,910 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 360 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:44:09,911 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 512 states.
[2025-03-03 09:44:09,916 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512.
[2025-03-03 09:44:09,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 512 states, 511 states have (on average 1.4735812133072408) internal successors, (753), 511 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:09,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 753 transitions.
[2025-03-03 09:44:09,919 INFO  L78                 Accepts]: Start accepts. Automaton has 512 states and 753 transitions. Word has length 83
[2025-03-03 09:44:09,919 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:09,919 INFO  L471      AbstractCegarLoop]: Abstraction has 512 states and 753 transitions.
[2025-03-03 09:44:09,919 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 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-03-03 09:44:09,919 INFO  L276                IsEmpty]: Start isEmpty. Operand 512 states and 753 transitions.
[2025-03-03 09:44:09,921 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2025-03-03 09:44:09,922 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:09,922 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:09,922 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 09:44:09,922 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:09,923 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:09,923 INFO  L85        PathProgramCache]: Analyzing trace with hash -1824721535, now seen corresponding path program 1 times
[2025-03-03 09:44:09,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:09,923 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478508717]
[2025-03-03 09:44:09,923 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:09,923 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:09,936 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes.
[2025-03-03 09:44:09,949 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements.
[2025-03-03 09:44:09,950 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:09,950 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:09,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2025-03-03 09:44:09,990 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:09,990 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478508717]
[2025-03-03 09:44:09,990 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478508717] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:09,990 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:09,990 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:09,990 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169925182]
[2025-03-03 09:44:09,990 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:09,990 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:09,990 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:09,990 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:09,991 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:09,991 INFO  L87              Difference]: Start difference. First operand 512 states and 753 transitions. Second operand  has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,095 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:10,095 INFO  L93              Difference]: Finished difference Result 1060 states and 1566 transitions.
[2025-03-03 09:44:10,095 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:10,096 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 104
[2025-03-03 09:44:10,096 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:10,098 INFO  L225             Difference]: With dead ends: 1060
[2025-03-03 09:44:10,098 INFO  L226             Difference]: Without dead ends: 562
[2025-03-03 09:44:10,098 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:10,099 INFO  L435           NwaCegarLoop]: 229 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:10,099 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 359 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:44:10,100 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 562 states.
[2025-03-03 09:44:10,106 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562.
[2025-03-03 09:44:10,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 562 states, 561 states have (on average 1.4491978609625669) internal successors, (813), 561 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 813 transitions.
[2025-03-03 09:44:10,108 INFO  L78                 Accepts]: Start accepts. Automaton has 562 states and 813 transitions. Word has length 104
[2025-03-03 09:44:10,108 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:10,109 INFO  L471      AbstractCegarLoop]: Abstraction has 562 states and 813 transitions.
[2025-03-03 09:44:10,109 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,109 INFO  L276                IsEmpty]: Start isEmpty. Operand 562 states and 813 transitions.
[2025-03-03 09:44:10,110 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-03-03 09:44:10,110 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:10,110 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:10,110 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 09:44:10,110 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:10,111 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:10,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -208962759, now seen corresponding path program 1 times
[2025-03-03 09:44:10,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:10,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838936418]
[2025-03-03 09:44:10,111 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:10,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:10,118 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-03-03 09:44:10,124 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-03-03 09:44:10,124 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:10,124 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:10,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2025-03-03 09:44:10,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:10,182 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838936418]
[2025-03-03 09:44:10,182 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838936418] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:10,182 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:10,182 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:10,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388213965]
[2025-03-03 09:44:10,182 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:10,183 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:10,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:10,183 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:10,183 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:10,183 INFO  L87              Difference]: Start difference. First operand 562 states and 813 transitions. Second operand  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,229 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:10,229 INFO  L93              Difference]: Finished difference Result 1128 states and 1631 transitions.
[2025-03-03 09:44:10,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:10,230 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 122
[2025-03-03 09:44:10,230 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:10,232 INFO  L225             Difference]: With dead ends: 1128
[2025-03-03 09:44:10,232 INFO  L226             Difference]: Without dead ends: 842
[2025-03-03 09:44:10,233 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:10,234 INFO  L435           NwaCegarLoop]: 399 mSDtfsCounter, 156 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:10,234 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 606 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:44:10,235 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 842 states.
[2025-03-03 09:44:10,244 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842.
[2025-03-03 09:44:10,245 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 842 states, 841 states have (on average 1.4435196195005946) internal successors, (1214), 841 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1214 transitions.
[2025-03-03 09:44:10,248 INFO  L78                 Accepts]: Start accepts. Automaton has 842 states and 1214 transitions. Word has length 122
[2025-03-03 09:44:10,248 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:10,248 INFO  L471      AbstractCegarLoop]: Abstraction has 842 states and 1214 transitions.
[2025-03-03 09:44:10,248 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,248 INFO  L276                IsEmpty]: Start isEmpty. Operand 842 states and 1214 transitions.
[2025-03-03 09:44:10,249 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-03-03 09:44:10,249 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:10,250 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:10,250 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 09:44:10,250 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:10,250 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:10,250 INFO  L85        PathProgramCache]: Analyzing trace with hash -657659398, now seen corresponding path program 1 times
[2025-03-03 09:44:10,250 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:10,251 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213367825]
[2025-03-03 09:44:10,251 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:10,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:10,278 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-03-03 09:44:10,288 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-03-03 09:44:10,288 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:10,288 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:10,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-03-03 09:44:10,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:10,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213367825]
[2025-03-03 09:44:10,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213367825] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:10,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:10,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:10,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019329411]
[2025-03-03 09:44:10,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:10,336 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:10,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:10,337 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:10,337 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:10,337 INFO  L87              Difference]: Start difference. First operand 842 states and 1214 transitions. Second operand  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,386 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:10,387 INFO  L93              Difference]: Finished difference Result 1690 states and 2436 transitions.
[2025-03-03 09:44:10,387 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:10,387 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122
[2025-03-03 09:44:10,387 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:10,390 INFO  L225             Difference]: With dead ends: 1690
[2025-03-03 09:44:10,391 INFO  L226             Difference]: Without dead ends: 1124
[2025-03-03 09:44:10,391 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:10,392 INFO  L435           NwaCegarLoop]: 402 mSDtfsCounter, 158 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:10,392 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 609 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:44:10,393 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1124 states.
[2025-03-03 09:44:10,405 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1124.
[2025-03-03 09:44:10,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1124 states, 1123 states have (on average 1.4407836153161175) internal successors, (1618), 1123 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1618 transitions.
[2025-03-03 09:44:10,410 INFO  L78                 Accepts]: Start accepts. Automaton has 1124 states and 1618 transitions. Word has length 122
[2025-03-03 09:44:10,410 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:10,410 INFO  L471      AbstractCegarLoop]: Abstraction has 1124 states and 1618 transitions.
[2025-03-03 09:44:10,410 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,410 INFO  L276                IsEmpty]: Start isEmpty. Operand 1124 states and 1618 transitions.
[2025-03-03 09:44:10,412 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-03-03 09:44:10,412 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:10,412 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:10,412 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 09:44:10,412 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:10,413 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:10,413 INFO  L85        PathProgramCache]: Analyzing trace with hash 550258777, now seen corresponding path program 1 times
[2025-03-03 09:44:10,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:10,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637575160]
[2025-03-03 09:44:10,413 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:10,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:10,420 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-03-03 09:44:10,423 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-03-03 09:44:10,424 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:10,424 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:10,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2025-03-03 09:44:10,446 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:10,446 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637575160]
[2025-03-03 09:44:10,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637575160] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:10,446 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:10,446 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:10,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791370968]
[2025-03-03 09:44:10,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:10,447 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:10,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:10,447 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:10,447 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:10,447 INFO  L87              Difference]: Start difference. First operand 1124 states and 1618 transitions. Second operand  has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,484 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:10,484 INFO  L93              Difference]: Finished difference Result 1996 states and 2865 transitions.
[2025-03-03 09:44:10,484 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:10,484 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 122
[2025-03-03 09:44:10,484 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:10,488 INFO  L225             Difference]: With dead ends: 1996
[2025-03-03 09:44:10,488 INFO  L226             Difference]: Without dead ends: 1148
[2025-03-03 09:44:10,489 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:10,489 INFO  L435           NwaCegarLoop]: 244 mSDtfsCounter, 10 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:10,490 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 451 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:44:10,491 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1148 states.
[2025-03-03 09:44:10,504 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148.
[2025-03-03 09:44:10,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1148 states, 1147 states have (on average 1.4359197907585004) internal successors, (1647), 1147 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1647 transitions.
[2025-03-03 09:44:10,509 INFO  L78                 Accepts]: Start accepts. Automaton has 1148 states and 1647 transitions. Word has length 122
[2025-03-03 09:44:10,509 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:10,509 INFO  L471      AbstractCegarLoop]: Abstraction has 1148 states and 1647 transitions.
[2025-03-03 09:44:10,509 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,509 INFO  L276                IsEmpty]: Start isEmpty. Operand 1148 states and 1647 transitions.
[2025-03-03 09:44:10,511 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2025-03-03 09:44:10,511 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:10,511 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:10,511 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 09:44:10,511 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:10,512 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:10,512 INFO  L85        PathProgramCache]: Analyzing trace with hash 1887356289, now seen corresponding path program 1 times
[2025-03-03 09:44:10,512 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:10,512 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308400333]
[2025-03-03 09:44:10,512 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:10,512 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:10,540 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes.
[2025-03-03 09:44:10,548 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements.
[2025-03-03 09:44:10,549 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:10,549 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:10,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2025-03-03 09:44:10,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:10,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308400333]
[2025-03-03 09:44:10,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308400333] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:10,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:10,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:10,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501366051]
[2025-03-03 09:44:10,605 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:10,605 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:10,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:10,606 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:10,606 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:10,606 INFO  L87              Difference]: Start difference. First operand 1148 states and 1647 transitions. Second operand  has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,748 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:10,748 INFO  L93              Difference]: Finished difference Result 2411 states and 3500 transitions.
[2025-03-03 09:44:10,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:10,749 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 161
[2025-03-03 09:44:10,749 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:10,752 INFO  L225             Difference]: With dead ends: 2411
[2025-03-03 09:44:10,753 INFO  L226             Difference]: Without dead ends: 1277
[2025-03-03 09:44:10,754 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:10,754 INFO  L435           NwaCegarLoop]: 229 mSDtfsCounter, 14 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:10,754 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 358 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:44:10,756 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1277 states.
[2025-03-03 09:44:10,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1271.
[2025-03-03 09:44:10,776 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1271 states, 1270 states have (on average 1.405511811023622) internal successors, (1785), 1270 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1785 transitions.
[2025-03-03 09:44:10,780 INFO  L78                 Accepts]: Start accepts. Automaton has 1271 states and 1785 transitions. Word has length 161
[2025-03-03 09:44:10,780 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:10,780 INFO  L471      AbstractCegarLoop]: Abstraction has 1271 states and 1785 transitions.
[2025-03-03 09:44:10,780 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,781 INFO  L276                IsEmpty]: Start isEmpty. Operand 1271 states and 1785 transitions.
[2025-03-03 09:44:10,783 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 204
[2025-03-03 09:44:10,783 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:10,784 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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]
[2025-03-03 09:44:10,784 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 09:44:10,784 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:10,784 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:10,784 INFO  L85        PathProgramCache]: Analyzing trace with hash -279457178, now seen corresponding path program 1 times
[2025-03-03 09:44:10,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:10,785 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343299397]
[2025-03-03 09:44:10,785 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:10,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:10,797 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes.
[2025-03-03 09:44:10,806 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements.
[2025-03-03 09:44:10,807 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:10,807 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:10,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 327 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked.
[2025-03-03 09:44:10,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:10,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343299397]
[2025-03-03 09:44:10,869 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343299397] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:10,869 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:10,869 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:10,869 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428704723]
[2025-03-03 09:44:10,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:10,870 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:10,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:10,870 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:10,870 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:10,870 INFO  L87              Difference]: Start difference. First operand 1271 states and 1785 transitions. Second operand  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:10,990 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:10,991 INFO  L93              Difference]: Finished difference Result 2652 states and 3760 transitions.
[2025-03-03 09:44:10,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:10,991 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203
[2025-03-03 09:44:10,992 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:10,995 INFO  L225             Difference]: With dead ends: 2652
[2025-03-03 09:44:10,996 INFO  L226             Difference]: Without dead ends: 1395
[2025-03-03 09:44:10,997 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:10,997 INFO  L435           NwaCegarLoop]: 217 mSDtfsCounter, 10 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:10,998 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 344 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:44:10,999 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1395 states.
[2025-03-03 09:44:11,019 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1395.
[2025-03-03 09:44:11,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1395 states, 1394 states have (on average 1.3837876614060258) internal successors, (1929), 1394 states have internal predecessors, (1929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:11,025 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1929 transitions.
[2025-03-03 09:44:11,025 INFO  L78                 Accepts]: Start accepts. Automaton has 1395 states and 1929 transitions. Word has length 203
[2025-03-03 09:44:11,025 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:11,025 INFO  L471      AbstractCegarLoop]: Abstraction has 1395 states and 1929 transitions.
[2025-03-03 09:44:11,025 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:11,026 INFO  L276                IsEmpty]: Start isEmpty. Operand 1395 states and 1929 transitions.
[2025-03-03 09:44:11,029 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-03 09:44:11,029 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:11,029 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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]
[2025-03-03 09:44:11,029 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 09:44:11,029 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:11,030 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:11,030 INFO  L85        PathProgramCache]: Analyzing trace with hash 1056433970, now seen corresponding path program 1 times
[2025-03-03 09:44:11,030 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:11,030 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050676476]
[2025-03-03 09:44:11,030 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:11,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:11,043 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-03 09:44:11,056 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-03 09:44:11,056 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:11,056 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:11,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked.
[2025-03-03 09:44:11,161 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:11,161 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050676476]
[2025-03-03 09:44:11,161 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050676476] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:11,161 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:11,161 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:11,162 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988825678]
[2025-03-03 09:44:11,162 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:11,162 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:11,162 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:11,162 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:11,163 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:11,163 INFO  L87              Difference]: Start difference. First operand 1395 states and 1929 transitions. Second operand  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:11,301 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:11,301 INFO  L93              Difference]: Finished difference Result 2948 states and 4136 transitions.
[2025-03-03 09:44:11,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:11,302 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 231
[2025-03-03 09:44:11,303 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:11,307 INFO  L225             Difference]: With dead ends: 2948
[2025-03-03 09:44:11,307 INFO  L226             Difference]: Without dead ends: 1388
[2025-03-03 09:44:11,309 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:11,310 INFO  L435           NwaCegarLoop]: 229 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:11,310 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 359 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:44:11,311 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1388 states.
[2025-03-03 09:44:11,345 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1388.
[2025-03-03 09:44:11,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1388 states, 1387 states have (on average 1.3777937995674117) internal successors, (1911), 1387 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:11,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1911 transitions.
[2025-03-03 09:44:11,350 INFO  L78                 Accepts]: Start accepts. Automaton has 1388 states and 1911 transitions. Word has length 231
[2025-03-03 09:44:11,351 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:11,351 INFO  L471      AbstractCegarLoop]: Abstraction has 1388 states and 1911 transitions.
[2025-03-03 09:44:11,351 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:11,351 INFO  L276                IsEmpty]: Start isEmpty. Operand 1388 states and 1911 transitions.
[2025-03-03 09:44:11,353 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 271
[2025-03-03 09:44:11,353 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:11,353 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:11,354 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 09:44:11,354 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:11,354 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:11,354 INFO  L85        PathProgramCache]: Analyzing trace with hash 1689572575, now seen corresponding path program 1 times
[2025-03-03 09:44:11,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:11,354 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284320296]
[2025-03-03 09:44:11,354 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:11,354 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:11,369 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes.
[2025-03-03 09:44:11,382 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements.
[2025-03-03 09:44:11,383 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:11,383 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:11,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked.
[2025-03-03 09:44:11,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:11,450 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284320296]
[2025-03-03 09:44:11,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284320296] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:11,450 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:11,450 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:11,450 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648836518]
[2025-03-03 09:44:11,450 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:11,451 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:11,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:11,451 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:11,451 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:11,452 INFO  L87              Difference]: Start difference. First operand 1388 states and 1911 transitions. Second operand  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:11,500 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:11,501 INFO  L93              Difference]: Finished difference Result 3993 states and 5521 transitions.
[2025-03-03 09:44:11,501 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:11,501 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270
[2025-03-03 09:44:11,501 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:11,506 INFO  L225             Difference]: With dead ends: 3993
[2025-03-03 09:44:11,506 INFO  L226             Difference]: Without dead ends: 1671
[2025-03-03 09:44:11,508 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:11,509 INFO  L435           NwaCegarLoop]: 400 mSDtfsCounter, 143 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:11,510 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 609 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 09:44:11,511 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1671 states.
[2025-03-03 09:44:11,532 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1669.
[2025-03-03 09:44:11,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1669 states, 1668 states have (on average 1.3788968824940049) internal successors, (2300), 1668 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:11,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2300 transitions.
[2025-03-03 09:44:11,539 INFO  L78                 Accepts]: Start accepts. Automaton has 1669 states and 2300 transitions. Word has length 270
[2025-03-03 09:44:11,539 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:11,539 INFO  L471      AbstractCegarLoop]: Abstraction has 1669 states and 2300 transitions.
[2025-03-03 09:44:11,539 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:11,539 INFO  L276                IsEmpty]: Start isEmpty. Operand 1669 states and 2300 transitions.
[2025-03-03 09:44:11,542 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 319
[2025-03-03 09:44:11,542 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:11,542 INFO  L218           NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:11,543 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 09:44:11,543 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:11,543 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:11,543 INFO  L85        PathProgramCache]: Analyzing trace with hash -2076379157, now seen corresponding path program 1 times
[2025-03-03 09:44:11,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:11,543 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196750135]
[2025-03-03 09:44:11,543 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:11,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:11,559 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes.
[2025-03-03 09:44:11,569 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements.
[2025-03-03 09:44:11,569 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:11,569 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:11,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked.
[2025-03-03 09:44:11,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:11,645 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196750135]
[2025-03-03 09:44:11,645 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196750135] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:11,645 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:11,645 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:11,645 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690313284]
[2025-03-03 09:44:11,645 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:11,645 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:11,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:11,646 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:11,646 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:11,646 INFO  L87              Difference]: Start difference. First operand 1669 states and 2300 transitions. Second operand  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:11,752 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:11,752 INFO  L93              Difference]: Finished difference Result 3459 states and 4798 transitions.
[2025-03-03 09:44:11,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:11,753 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 318
[2025-03-03 09:44:11,753 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:11,757 INFO  L225             Difference]: With dead ends: 3459
[2025-03-03 09:44:11,757 INFO  L226             Difference]: Without dead ends: 1804
[2025-03-03 09:44:11,759 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:11,760 INFO  L435           NwaCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:11,760 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 356 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:44:11,761 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1804 states.
[2025-03-03 09:44:11,782 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804.
[2025-03-03 09:44:11,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1804 states, 1803 states have (on average 1.3643926788685523) internal successors, (2460), 1803 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:11,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2460 transitions.
[2025-03-03 09:44:11,789 INFO  L78                 Accepts]: Start accepts. Automaton has 1804 states and 2460 transitions. Word has length 318
[2025-03-03 09:44:11,789 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:11,789 INFO  L471      AbstractCegarLoop]: Abstraction has 1804 states and 2460 transitions.
[2025-03-03 09:44:11,789 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:11,789 INFO  L276                IsEmpty]: Start isEmpty. Operand 1804 states and 2460 transitions.
[2025-03-03 09:44:11,792 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 342
[2025-03-03 09:44:11,792 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:11,792 INFO  L218           NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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]
[2025-03-03 09:44:11,792 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 09:44:11,792 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:11,793 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:11,793 INFO  L85        PathProgramCache]: Analyzing trace with hash 2109241771, now seen corresponding path program 1 times
[2025-03-03 09:44:11,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:11,793 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635190363]
[2025-03-03 09:44:11,793 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:11,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:11,806 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes.
[2025-03-03 09:44:11,818 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements.
[2025-03-03 09:44:11,819 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:11,819 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:11,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked.
[2025-03-03 09:44:11,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:11,909 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635190363]
[2025-03-03 09:44:11,909 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635190363] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:11,909 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:11,909 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:11,910 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469922116]
[2025-03-03 09:44:11,910 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:11,910 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:11,910 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:11,910 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:11,910 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:11,910 INFO  L87              Difference]: Start difference. First operand 1804 states and 2460 transitions. Second operand  has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:12,029 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:12,030 INFO  L93              Difference]: Finished difference Result 3739 states and 5138 transitions.
[2025-03-03 09:44:12,030 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:12,030 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 341
[2025-03-03 09:44:12,030 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:12,035 INFO  L225             Difference]: With dead ends: 3739
[2025-03-03 09:44:12,035 INFO  L226             Difference]: Without dead ends: 1949
[2025-03-03 09:44:12,037 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:12,037 INFO  L435           NwaCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:12,038 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 356 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:44:12,039 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1949 states.
[2025-03-03 09:44:12,065 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1949.
[2025-03-03 09:44:12,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1949 states, 1948 states have (on average 1.3501026694045175) internal successors, (2630), 1948 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:12,070 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2630 transitions.
[2025-03-03 09:44:12,071 INFO  L78                 Accepts]: Start accepts. Automaton has 1949 states and 2630 transitions. Word has length 341
[2025-03-03 09:44:12,071 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:12,071 INFO  L471      AbstractCegarLoop]: Abstraction has 1949 states and 2630 transitions.
[2025-03-03 09:44:12,071 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:12,071 INFO  L276                IsEmpty]: Start isEmpty. Operand 1949 states and 2630 transitions.
[2025-03-03 09:44:12,074 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 375
[2025-03-03 09:44:12,074 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:12,074 INFO  L218           NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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]
[2025-03-03 09:44:12,075 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 09:44:12,075 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:12,075 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:12,075 INFO  L85        PathProgramCache]: Analyzing trace with hash 2034076826, now seen corresponding path program 1 times
[2025-03-03 09:44:12,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:12,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034600665]
[2025-03-03 09:44:12,075 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:12,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:12,091 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes.
[2025-03-03 09:44:12,102 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements.
[2025-03-03 09:44:12,103 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:12,103 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:12,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked.
[2025-03-03 09:44:12,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:12,209 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034600665]
[2025-03-03 09:44:12,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034600665] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:44:12,210 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549091036]
[2025-03-03 09:44:12,210 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:12,210 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:44:12,210 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:44:12,212 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:44:12,214 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 09:44:12,269 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes.
[2025-03-03 09:44:12,328 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements.
[2025-03-03 09:44:12,329 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:12,329 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:12,335 INFO  L256         TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:44:12,344 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:44:12,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked.
[2025-03-03 09:44:12,466 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:44:12,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked.
[2025-03-03 09:44:12,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [549091036] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:44:12,568 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:44:12,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2025-03-03 09:44:12,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489306147]
[2025-03-03 09:44:12,568 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:44:12,569 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 09:44:12,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:12,570 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 09:44:12,570 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:44:12,570 INFO  L87              Difference]: Start difference. First operand 1949 states and 2630 transitions. Second operand  has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:13,114 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:13,115 INFO  L93              Difference]: Finished difference Result 5109 states and 6993 transitions.
[2025-03-03 09:44:13,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-03 09:44:13,115 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 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 374
[2025-03-03 09:44:13,115 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:13,123 INFO  L225             Difference]: With dead ends: 5109
[2025-03-03 09:44:13,124 INFO  L226             Difference]: Without dead ends: 3010
[2025-03-03 09:44:13,126 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90
[2025-03-03 09:44:13,126 INFO  L435           NwaCegarLoop]: 277 mSDtfsCounter, 487 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:13,126 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1123 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:44:13,128 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3010 states.
[2025-03-03 09:44:13,158 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 2109.
[2025-03-03 09:44:13,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2109 states, 2108 states have (on average 1.3572106261859582) internal successors, (2861), 2108 states have internal predecessors, (2861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:13,163 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2861 transitions.
[2025-03-03 09:44:13,163 INFO  L78                 Accepts]: Start accepts. Automaton has 2109 states and 2861 transitions. Word has length 374
[2025-03-03 09:44:13,164 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:13,164 INFO  L471      AbstractCegarLoop]: Abstraction has 2109 states and 2861 transitions.
[2025-03-03 09:44:13,164 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:13,164 INFO  L276                IsEmpty]: Start isEmpty. Operand 2109 states and 2861 transitions.
[2025-03-03 09:44:13,168 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 475
[2025-03-03 09:44:13,169 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:13,169 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:13,176 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-03 09:44:13,373 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-03-03 09:44:13,373 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:13,373 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:13,373 INFO  L85        PathProgramCache]: Analyzing trace with hash -1594086298, now seen corresponding path program 1 times
[2025-03-03 09:44:13,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:13,374 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327394522]
[2025-03-03 09:44:13,374 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:13,374 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:13,391 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes.
[2025-03-03 09:44:13,400 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements.
[2025-03-03 09:44:13,400 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:13,400 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:13,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked.
[2025-03-03 09:44:13,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:13,538 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327394522]
[2025-03-03 09:44:13,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327394522] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:13,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:13,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:13,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300348731]
[2025-03-03 09:44:13,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:13,538 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:13,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:13,539 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:13,539 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:13,539 INFO  L87              Difference]: Start difference. First operand 2109 states and 2861 transitions. Second operand  has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:13,666 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:13,666 INFO  L93              Difference]: Finished difference Result 4442 states and 6106 transitions.
[2025-03-03 09:44:13,666 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:13,667 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 474
[2025-03-03 09:44:13,667 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:13,673 INFO  L225             Difference]: With dead ends: 4442
[2025-03-03 09:44:13,673 INFO  L226             Difference]: Without dead ends: 2347
[2025-03-03 09:44:13,675 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:13,676 INFO  L435           NwaCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:13,676 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 356 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:44:13,678 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2347 states.
[2025-03-03 09:44:13,706 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 2347.
[2025-03-03 09:44:13,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2347 states, 2346 states have (on average 1.3358908780903667) internal successors, (3134), 2346 states have internal predecessors, (3134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:13,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3134 transitions.
[2025-03-03 09:44:13,714 INFO  L78                 Accepts]: Start accepts. Automaton has 2347 states and 3134 transitions. Word has length 474
[2025-03-03 09:44:13,714 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:13,714 INFO  L471      AbstractCegarLoop]: Abstraction has 2347 states and 3134 transitions.
[2025-03-03 09:44:13,714 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:13,714 INFO  L276                IsEmpty]: Start isEmpty. Operand 2347 states and 3134 transitions.
[2025-03-03 09:44:13,739 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 537
[2025-03-03 09:44:13,739 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:13,739 INFO  L218           NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:13,739 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 09:44:13,740 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:13,741 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:13,741 INFO  L85        PathProgramCache]: Analyzing trace with hash -1971949014, now seen corresponding path program 1 times
[2025-03-03 09:44:13,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:13,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131854725]
[2025-03-03 09:44:13,741 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:13,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:13,759 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes.
[2025-03-03 09:44:13,769 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements.
[2025-03-03 09:44:13,769 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:13,769 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:13,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked.
[2025-03-03 09:44:13,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:13,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131854725]
[2025-03-03 09:44:13,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131854725] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:44:13,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:44:13,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:44:13,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103194846]
[2025-03-03 09:44:13,864 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:44:13,865 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:44:13,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:13,865 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:44:13,866 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:13,866 INFO  L87              Difference]: Start difference. First operand 2347 states and 3134 transitions. Second operand  has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:14,013 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:14,014 INFO  L93              Difference]: Finished difference Result 4932 states and 6680 transitions.
[2025-03-03 09:44:14,014 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:44:14,014 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 536
[2025-03-03 09:44:14,014 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:14,022 INFO  L225             Difference]: With dead ends: 4932
[2025-03-03 09:44:14,022 INFO  L226             Difference]: Without dead ends: 2599
[2025-03-03 09:44:14,025 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:44:14,025 INFO  L435           NwaCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:14,025 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 356 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:44:14,027 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2599 states.
[2025-03-03 09:44:14,070 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2599.
[2025-03-03 09:44:14,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2599 states, 2598 states have (on average 1.3167821401077753) internal successors, (3421), 2598 states have internal predecessors, (3421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:14,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 3421 transitions.
[2025-03-03 09:44:14,079 INFO  L78                 Accepts]: Start accepts. Automaton has 2599 states and 3421 transitions. Word has length 536
[2025-03-03 09:44:14,080 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:14,080 INFO  L471      AbstractCegarLoop]: Abstraction has 2599 states and 3421 transitions.
[2025-03-03 09:44:14,080 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:14,080 INFO  L276                IsEmpty]: Start isEmpty. Operand 2599 states and 3421 transitions.
[2025-03-03 09:44:14,090 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 603
[2025-03-03 09:44:14,091 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:44:14,091 INFO  L218           NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:14,091 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 09:44:14,091 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:44:14,092 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:44:14,092 INFO  L85        PathProgramCache]: Analyzing trace with hash 1344576422, now seen corresponding path program 1 times
[2025-03-03 09:44:14,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:44:14,092 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895565965]
[2025-03-03 09:44:14,092 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:14,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:44:14,121 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes.
[2025-03-03 09:44:14,138 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements.
[2025-03-03 09:44:14,139 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:14,139 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:14,309 INFO  L134       CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked.
[2025-03-03 09:44:14,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:44:14,309 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895565965]
[2025-03-03 09:44:14,309 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895565965] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:44:14,309 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153928355]
[2025-03-03 09:44:14,309 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:44:14,309 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:44:14,309 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:44:14,311 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:44:14,313 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 09:44:14,382 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes.
[2025-03-03 09:44:14,487 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements.
[2025-03-03 09:44:14,487 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:44:14,487 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:44:14,491 INFO  L256         TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:44:14,500 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:44:14,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked.
[2025-03-03 09:44:14,578 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 09:44:14,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked.
[2025-03-03 09:44:14,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153928355] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 09:44:14,665 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 09:44:14,665 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2025-03-03 09:44:14,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330104753]
[2025-03-03 09:44:14,666 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 09:44:14,666 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 09:44:14,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:44:14,667 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 09:44:14,667 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-03-03 09:44:14,667 INFO  L87              Difference]: Start difference. First operand 2599 states and 3421 transitions. Second operand  has 8 states, 8 states have (on average 41.875) internal successors, (335), 8 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:14,963 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:44:14,964 INFO  L93              Difference]: Finished difference Result 4428 states and 5873 transitions.
[2025-03-03 09:44:14,964 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 09:44:14,964 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 41.875) internal successors, (335), 8 states have internal predecessors, (335), 0 states have call successors, (0), 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 602
[2025-03-03 09:44:14,965 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:44:14,965 INFO  L225             Difference]: With dead ends: 4428
[2025-03-03 09:44:14,965 INFO  L226             Difference]: Without dead ends: 0
[2025-03-03 09:44:14,968 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1212 GetRequests, 1203 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2025-03-03 09:44:14,968 INFO  L435           NwaCegarLoop]: 284 mSDtfsCounter, 208 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 09:44:14,968 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 775 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 09:44:14,968 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-03-03 09:44:14,969 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-03-03 09:44:14,969 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:14,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-03-03 09:44:14,969 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 602
[2025-03-03 09:44:14,969 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:44:14,969 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-03-03 09:44:14,969 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 41.875) internal successors, (335), 8 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:44:14,969 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-03-03 09:44:14,970 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-03-03 09:44:14,972 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 09:44:14,979 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-03 09:44:15,173 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:44:15,175 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:44:15,176 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-03-03 09:44:15,542 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 09:44:15,557 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:44:15 BoogieIcfgContainer
[2025-03-03 09:44:15,557 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 09:44:15,557 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 09:44:15,557 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 09:44:15,558 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 09:44:15,558 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:44:08" (3/4) ...
[2025-03-03 09:44:15,560 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-03 09:44:15,573 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges
[2025-03-03 09:44:15,574 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-03-03 09:44:15,574 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-03 09:44:15,575 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-03 09:44:15,667 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-03 09:44:15,668 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-03 09:44:15,668 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 09:44:15,669 INFO  L158              Benchmark]: Toolchain (without parser) took 8181.81ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 105.5MB in the beginning and 162.1MB in the end (delta: -56.5MB). Peak memory consumption was 221.2MB. Max. memory is 16.1GB.
[2025-03-03 09:44:15,669 INFO  L158              Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:44:15,669 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 269.14ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 89.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-03 09:44:15,670 INFO  L158              Benchmark]: Boogie Procedure Inliner took 49.58ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 86.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 09:44:15,670 INFO  L158              Benchmark]: Boogie Preprocessor took 27.92ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 84.3MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:44:15,671 INFO  L158              Benchmark]: IcfgBuilder took 614.34ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 40.0MB in the end (delta: 44.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2025-03-03 09:44:15,671 INFO  L158              Benchmark]: TraceAbstraction took 7104.66ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 38.8MB in the beginning and 170.3MB in the end (delta: -131.5MB). Peak memory consumption was 145.7MB. Max. memory is 16.1GB.
[2025-03-03 09:44:15,672 INFO  L158              Benchmark]: Witness Printer took 110.62ms. Allocated memory is still 419.4MB. Free memory was 170.3MB in the beginning and 162.1MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 09:44:15,674 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 269.14ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 89.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 49.58ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 86.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 27.92ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 84.3MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 614.34ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 40.0MB in the end (delta: 44.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 7104.66ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 38.8MB in the beginning and 170.3MB in the end (delta: -131.5MB). Peak memory consumption was 145.7MB. Max. memory is 16.1GB.
 * Witness Printer took 110.62ms. Allocated memory is still 419.4MB. Free memory was 170.3MB in the beginning and 162.1MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 677]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 19, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1501 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1501 mSDsluCounter, 8835 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3919 mSDsCounter, 314 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3041 IncrementalHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 314 mSolverCounterUnsat, 4916 mSDtfsCounter, 3041 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2021 GetRequests, 1987 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2599occurred in iteration=18, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 911 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 5275 NumberOfCodeBlocks, 5275 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 6228 ConstructedInterpolants, 0 QuantifiedInterpolants, 8390 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1508 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 25710/25866 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 109]: Location Invariant
    Derived location invariant: ((((((((((((((2 == blastFlag) && (8560 == s__state)) || ((2 == blastFlag) && (s__state == 8512))) || ((2 == blastFlag) && (0 != s__hit))) || ((2 == blastFlag) && (8544 == s__state))) || (((s__state == 8656) && (2 == blastFlag)) && (s__s3__tmp__next_state___0 <= 8576))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || ((3 == blastFlag) && (0 != s__hit))) || (s__state == 3)) || (((2 == blastFlag) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8655))) || (((8672 <= s__state) && (3 == blastFlag)) && (s__s3__tmp__next_state___0 <= 8576))) || ((8496 == s__state) && (blastFlag == 1))) || (blastFlag == 0)) || ((s__state == 8528) && (2 == blastFlag)))
RESULT: Ultimate proved your program to be correct!
[2025-03-03 09:44:15,686 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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