./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i -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 0cc8a0783ec7e65aec5bb1b8ce7f7837d17a7d27f4f67ff4962ce15c1b498ac3
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 14:07:39,400 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 14:07:39,454 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 14:07:39,458 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 14:07:39,460 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 14:07:39,475 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 14:07:39,476 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 14:07:39,476 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 14:07:39,476 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 14:07:39,477 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 14:07:39,477 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 14:07:39,477 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 14:07:39,478 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 14:07:39,478 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 14:07:39,478 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 14:07:39,479 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 14:07:39,479 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 14:07:39,479 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 14:07:39,479 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 14:07:39,479 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 14:07:39,479 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 14:07:39,479 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 14:07:39,480 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 14:07:39,480 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 14:07:39,480 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 14:07:39,480 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 14:07:39,480 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 14:07:39,480 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 14:07:39,480 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 14:07:39,480 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 14:07:39,480 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 14:07:39,481 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 14:07:39,481 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 14:07:39,481 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 14:07:39,481 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 14:07:39,481 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 14:07:39,481 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 14:07:39,482 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 14:07:39,482 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 14:07:39,482 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 14:07:39,482 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 14:07:39,482 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 14:07:39,482 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 14:07:39,482 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 -> 0cc8a0783ec7e65aec5bb1b8ce7f7837d17a7d27f4f67ff4962ce15c1b498ac3
[2025-03-08 14:07:39,725 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 14:07:39,734 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 14:07:39,736 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 14:07:39,737 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 14:07:39,737 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 14:07:39,738 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i
[2025-03-08 14:07:40,925 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add8e0b8c/346905fa2e4e4107b752080467107fbb/FLAGda6bdf660
[2025-03-08 14:07:41,140 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 14:07:41,144 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i
[2025-03-08 14:07:41,153 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add8e0b8c/346905fa2e4e4107b752080467107fbb/FLAGda6bdf660
[2025-03-08 14:07:41,167 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/add8e0b8c/346905fa2e4e4107b752080467107fbb
[2025-03-08 14:07:41,169 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 14:07:41,170 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 14:07:41,171 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 14:07:41,171 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 14:07:41,174 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 14:07:41,175 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,176 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a864e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41, skipping insertion in model container
[2025-03-08 14:07:41,176 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,196 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 14:07:41,285 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i[916,929]
[2025-03-08 14:07:41,366 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 14:07:41,379 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 14:07:41,387 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i[916,929]
[2025-03-08 14:07:41,431 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 14:07:41,449 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 14:07:41,450 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41 WrapperNode
[2025-03-08 14:07:41,451 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 14:07:41,452 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 14:07:41,452 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 14:07:41,452 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 14:07:41,456 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,471 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,511 INFO  L138                Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233
[2025-03-08 14:07:41,512 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 14:07:41,513 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 14:07:41,514 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 14:07:41,514 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 14:07:41,521 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,521 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,528 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,552 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 14:07:41,552 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,553 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,565 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,569 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,571 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,575 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,578 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 14:07:41,581 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 14:07:41,581 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 14:07:41,582 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 14:07:41,582 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (1/1) ...
[2025-03-08 14:07:41,586 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 14:07:41,595 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 14:07:41,609 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 14:07:41,612 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 14:07:41,631 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 14:07:41,631 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 14:07:41,631 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 14:07:41,631 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 14:07:41,631 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 14:07:41,631 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 14:07:41,695 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 14:07:41,697 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 14:07:42,030 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L205: havoc property_#t~ite22#1;havoc property_#t~bitwise21#1;havoc property_#t~short23#1;
[2025-03-08 14:07:42,063 INFO  L?                        ?]: Removed 27 outVars from TransFormulas that were not future-live.
[2025-03-08 14:07:42,063 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 14:07:42,082 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 14:07:42,083 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 14:07:42,084 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:07:42 BoogieIcfgContainer
[2025-03-08 14:07:42,084 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 14:07:42,086 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 14:07:42,086 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 14:07:42,089 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 14:07:42,089 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:07:41" (1/3) ...
[2025-03-08 14:07:42,090 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab49635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:07:42, skipping insertion in model container
[2025-03-08 14:07:42,090 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:41" (2/3) ...
[2025-03-08 14:07:42,091 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab49635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:07:42, skipping insertion in model container
[2025-03-08 14:07:42,091 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:07:42" (3/3) ...
[2025-03-08 14:07:42,092 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-26.i
[2025-03-08 14:07:42,102 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 14:07:42,103 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-26.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 14:07:42,156 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 14:07:42,167 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;@772ac7ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 14:07:42,167 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 14:07:42,170 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 101 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-08 14:07:42,194 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 198
[2025-03-08 14:07:42,197 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:07:42,198 INFO  L218           NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 14:07:42,198 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:07:42,204 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:07:42,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -621787247, now seen corresponding path program 1 times
[2025-03-08 14:07:42,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:07:42,211 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148165401]
[2025-03-08 14:07:42,211 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:07:42,212 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:07:42,287 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-08 14:07:42,313 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-08 14:07:42,314 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:07:42,314 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:07:42,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked.
[2025-03-08 14:07:42,530 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:07:42,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148165401]
[2025-03-08 14:07:42,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148165401] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 14:07:42,531 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273427348]
[2025-03-08 14:07:42,531 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:07:42,531 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 14:07:42,532 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 14:07:42,534 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-08 14:07:42,537 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-08 14:07:42,612 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-08 14:07:42,702 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-08 14:07:42,702 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:07:42,702 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:07:42,705 INFO  L256         TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 14:07:42,711 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 14:07:42,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked.
[2025-03-08 14:07:42,734 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 14:07:42,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273427348] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:07:42,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 14:07:42,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 14:07:42,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975770483]
[2025-03-08 14:07:42,737 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:07:42,741 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 14:07:42,741 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:07:42,754 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 14:07:42,754 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 14:07:42,756 INFO  L87              Difference]: Start difference. First operand  has 101 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand  has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30)
[2025-03-08 14:07:42,780 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:07:42,780 INFO  L93              Difference]: Finished difference Result 196 states and 339 transitions.
[2025-03-08 14:07:42,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 14:07:42,782 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 197
[2025-03-08 14:07:42,782 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:07:42,786 INFO  L225             Difference]: With dead ends: 196
[2025-03-08 14:07:42,787 INFO  L226             Difference]: Without dead ends: 98
[2025-03-08 14:07:42,789 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 14:07:42,791 INFO  L435           NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 14:07:42,791 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 14:07:42,800 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2025-03-08 14:07:42,815 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98.
[2025-03-08 14:07:42,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-08 14:07:42,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions.
[2025-03-08 14:07:42,825 INFO  L78                 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 197
[2025-03-08 14:07:42,826 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:07:42,826 INFO  L471      AbstractCegarLoop]: Abstraction has 98 states and 152 transitions.
[2025-03-08 14:07:42,826 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30)
[2025-03-08 14:07:42,826 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions.
[2025-03-08 14:07:42,831 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 198
[2025-03-08 14:07:42,831 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:07:42,831 INFO  L218           NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 14:07:42,839 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 14:07:43,032 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,SelfDestructingSolverStorable0
[2025-03-08 14:07:43,032 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:07:43,033 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:07:43,033 INFO  L85        PathProgramCache]: Analyzing trace with hash 1715708559, now seen corresponding path program 1 times
[2025-03-08 14:07:43,033 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:07:43,033 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046269499]
[2025-03-08 14:07:43,033 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:07:43,033 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:07:43,055 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-08 14:07:43,157 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-08 14:07:43,157 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:07:43,157 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:07:43,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked.
[2025-03-08 14:07:43,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:07:43,547 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046269499]
[2025-03-08 14:07:43,547 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046269499] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:07:43,547 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:07:43,547 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 14:07:43,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934551663]
[2025-03-08 14:07:43,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:07:43,548 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 14:07:43,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:07:43,549 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 14:07:43,549 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 14:07:43,549 INFO  L87              Difference]: Start difference. First operand 98 states and 152 transitions. Second operand  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30)
[2025-03-08 14:07:43,601 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:07:43,601 INFO  L93              Difference]: Finished difference Result 288 states and 450 transitions.
[2025-03-08 14:07:43,602 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 14:07:43,602 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197
[2025-03-08 14:07:43,603 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:07:43,605 INFO  L225             Difference]: With dead ends: 288
[2025-03-08 14:07:43,605 INFO  L226             Difference]: Without dead ends: 193
[2025-03-08 14:07:43,605 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 14:07:43,606 INFO  L435           NwaCegarLoop]: 251 mSDtfsCounter, 146 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 14:07:43,606 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 395 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 14:07:43,606 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 193 states.
[2025-03-08 14:07:43,625 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 99.
[2025-03-08 14:07:43,627 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 67 states have internal predecessors, (93), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-08 14:07:43,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions.
[2025-03-08 14:07:43,631 INFO  L78                 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 197
[2025-03-08 14:07:43,632 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:07:43,632 INFO  L471      AbstractCegarLoop]: Abstraction has 99 states and 153 transitions.
[2025-03-08 14:07:43,633 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30)
[2025-03-08 14:07:43,633 INFO  L276                IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions.
[2025-03-08 14:07:43,634 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 198
[2025-03-08 14:07:43,637 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:07:43,637 INFO  L218           NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 14:07:43,637 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 14:07:43,637 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:07:43,638 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:07:43,638 INFO  L85        PathProgramCache]: Analyzing trace with hash 1205174382, now seen corresponding path program 1 times
[2025-03-08 14:07:43,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:07:43,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041479392]
[2025-03-08 14:07:43,638 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:07:43,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:07:43,651 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes.
[2025-03-08 14:07:43,690 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements.
[2025-03-08 14:07:43,692 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:07:43,692 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:07:44,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked.
[2025-03-08 14:07:44,454 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:07:44,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041479392]
[2025-03-08 14:07:44,455 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041479392] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:07:44,455 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:07:44,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 14:07:44,456 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946636819]
[2025-03-08 14:07:44,456 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:07:44,456 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 14:07:44,456 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:07:44,457 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 14:07:44,457 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-08 14:07:44,457 INFO  L87              Difference]: Start difference. First operand 99 states and 153 transitions. Second operand  has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30)
[2025-03-08 14:07:44,636 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:07:44,636 INFO  L93              Difference]: Finished difference Result 301 states and 459 transitions.
[2025-03-08 14:07:44,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 14:07:44,637 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197
[2025-03-08 14:07:44,638 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:07:44,639 INFO  L225             Difference]: With dead ends: 301
[2025-03-08 14:07:44,639 INFO  L226             Difference]: Without dead ends: 205
[2025-03-08 14:07:44,640 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-08 14:07:44,640 INFO  L435           NwaCegarLoop]: 160 mSDtfsCounter, 130 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 14:07:44,641 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 514 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 14:07:44,641 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 205 states.
[2025-03-08 14:07:44,659 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 173.
[2025-03-08 14:07:44,660 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 173 states, 134 states have (on average 1.455223880597015) internal successors, (195), 135 states have internal predecessors, (195), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36)
[2025-03-08 14:07:44,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 267 transitions.
[2025-03-08 14:07:44,664 INFO  L78                 Accepts]: Start accepts. Automaton has 173 states and 267 transitions. Word has length 197
[2025-03-08 14:07:44,664 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:07:44,664 INFO  L471      AbstractCegarLoop]: Abstraction has 173 states and 267 transitions.
[2025-03-08 14:07:44,665 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30)
[2025-03-08 14:07:44,665 INFO  L276                IsEmpty]: Start isEmpty. Operand 173 states and 267 transitions.
[2025-03-08 14:07:44,667 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-08 14:07:44,667 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:07:44,667 INFO  L218           NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 14:07:44,667 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 14:07:44,667 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:07:44,668 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:07:44,668 INFO  L85        PathProgramCache]: Analyzing trace with hash 1309325759, now seen corresponding path program 1 times
[2025-03-08 14:07:44,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:07:44,668 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394619858]
[2025-03-08 14:07:44,668 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:07:44,668 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:07:44,682 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-08 14:07:44,741 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-08 14:07:44,741 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:07:44,741 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:07:44,929 INFO  L134       CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked.
[2025-03-08 14:07:44,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:07:44,930 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394619858]
[2025-03-08 14:07:44,930 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394619858] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:07:44,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:07:44,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 14:07:44,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720565433]
[2025-03-08 14:07:44,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:07:44,931 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 14:07:44,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:07:44,932 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 14:07:44,932 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 14:07:44,932 INFO  L87              Difference]: Start difference. First operand 173 states and 267 transitions. Second operand  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30)
[2025-03-08 14:07:45,158 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:07:45,158 INFO  L93              Difference]: Finished difference Result 561 states and 864 transitions.
[2025-03-08 14:07:45,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 14:07:45,159 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198
[2025-03-08 14:07:45,160 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:07:45,164 INFO  L225             Difference]: With dead ends: 561
[2025-03-08 14:07:45,164 INFO  L226             Difference]: Without dead ends: 391
[2025-03-08 14:07:45,165 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 14:07:45,166 INFO  L435           NwaCegarLoop]: 177 mSDtfsCounter, 157 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 14:07:45,166 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 574 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 14:07:45,167 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 391 states.
[2025-03-08 14:07:45,192 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 321.
[2025-03-08 14:07:45,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 321 states, 244 states have (on average 1.4467213114754098) internal successors, (353), 246 states have internal predecessors, (353), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72)
[2025-03-08 14:07:45,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 497 transitions.
[2025-03-08 14:07:45,195 INFO  L78                 Accepts]: Start accepts. Automaton has 321 states and 497 transitions. Word has length 198
[2025-03-08 14:07:45,195 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:07:45,195 INFO  L471      AbstractCegarLoop]: Abstraction has 321 states and 497 transitions.
[2025-03-08 14:07:45,195 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30)
[2025-03-08 14:07:45,196 INFO  L276                IsEmpty]: Start isEmpty. Operand 321 states and 497 transitions.
[2025-03-08 14:07:45,197 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-08 14:07:45,197 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:07:45,197 INFO  L218           NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 14:07:45,197 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 14:07:45,197 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:07:45,198 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:07:45,198 INFO  L85        PathProgramCache]: Analyzing trace with hash -767883584, now seen corresponding path program 1 times
[2025-03-08 14:07:45,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:07:45,198 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883546521]
[2025-03-08 14:07:45,198 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:07:45,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:07:45,209 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-08 14:07:45,254 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-08 14:07:45,254 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:07:45,254 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:07:45,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked.
[2025-03-08 14:07:45,530 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:07:45,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883546521]
[2025-03-08 14:07:45,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883546521] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:07:45,530 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:07:45,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 14:07:45,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385522325]
[2025-03-08 14:07:45,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:07:45,531 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 14:07:45,532 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:07:45,532 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 14:07:45,532 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-08 14:07:45,533 INFO  L87              Difference]: Start difference. First operand 321 states and 497 transitions. Second operand  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30)
[2025-03-08 14:07:45,774 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:07:45,774 INFO  L93              Difference]: Finished difference Result 809 states and 1255 transitions.
[2025-03-08 14:07:45,774 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 14:07:45,775 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198
[2025-03-08 14:07:45,775 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:07:45,778 INFO  L225             Difference]: With dead ends: 809
[2025-03-08 14:07:45,778 INFO  L226             Difference]: Without dead ends: 491
[2025-03-08 14:07:45,779 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 14:07:45,780 INFO  L435           NwaCegarLoop]: 135 mSDtfsCounter, 116 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 14:07:45,780 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 586 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 14:07:45,781 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 491 states.
[2025-03-08 14:07:45,819 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489.
[2025-03-08 14:07:45,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 489 states, 374 states have (on average 1.4411764705882353) internal successors, (539), 377 states have internal predecessors, (539), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108)
[2025-03-08 14:07:45,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 755 transitions.
[2025-03-08 14:07:45,825 INFO  L78                 Accepts]: Start accepts. Automaton has 489 states and 755 transitions. Word has length 198
[2025-03-08 14:07:45,825 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:07:45,825 INFO  L471      AbstractCegarLoop]: Abstraction has 489 states and 755 transitions.
[2025-03-08 14:07:45,825 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30)
[2025-03-08 14:07:45,826 INFO  L276                IsEmpty]: Start isEmpty. Operand 489 states and 755 transitions.
[2025-03-08 14:07:45,827 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-08 14:07:45,827 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:07:45,827 INFO  L218           NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 14:07:45,827 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 14:07:45,827 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:07:45,828 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:07:45,828 INFO  L85        PathProgramCache]: Analyzing trace with hash -1176707809, now seen corresponding path program 1 times
[2025-03-08 14:07:45,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:07:45,828 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731394280]
[2025-03-08 14:07:45,828 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:07:45,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:07:45,842 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-08 14:07:45,908 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-08 14:07:45,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:07:45,909 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:07:51,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked.
[2025-03-08 14:07:51,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:07:51,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731394280]
[2025-03-08 14:07:51,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731394280] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:07:51,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:07:51,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-08 14:07:51,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635643640]
[2025-03-08 14:07:51,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:07:51,370 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-08 14:07:51,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:07:51,371 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-08 14:07:51,371 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156
[2025-03-08 14:07:51,371 INFO  L87              Difference]: Start difference. First operand 489 states and 755 transitions. Second operand  has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30)
[2025-03-08 14:07:52,818 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:07:52,819 INFO  L93              Difference]: Finished difference Result 1639 states and 2511 transitions.
[2025-03-08 14:07:52,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 14:07:52,819 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 198
[2025-03-08 14:07:52,820 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:07:52,826 INFO  L225             Difference]: With dead ends: 1639
[2025-03-08 14:07:52,826 INFO  L226             Difference]: Without dead ends: 1153
[2025-03-08 14:07:52,829 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272
[2025-03-08 14:07:52,830 INFO  L435           NwaCegarLoop]: 132 mSDtfsCounter, 894 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 14:07:52,831 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 856 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 14:07:52,832 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1153 states.
[2025-03-08 14:07:52,907 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 885.
[2025-03-08 14:07:52,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 885 states, 694 states have (on average 1.4524495677233429) internal successors, (1008), 699 states have internal predecessors, (1008), 180 states have call successors, (180), 10 states have call predecessors, (180), 10 states have return successors, (180), 175 states have call predecessors, (180), 180 states have call successors, (180)
[2025-03-08 14:07:52,915 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1368 transitions.
[2025-03-08 14:07:52,916 INFO  L78                 Accepts]: Start accepts. Automaton has 885 states and 1368 transitions. Word has length 198
[2025-03-08 14:07:52,916 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:07:52,916 INFO  L471      AbstractCegarLoop]: Abstraction has 885 states and 1368 transitions.
[2025-03-08 14:07:52,916 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30)
[2025-03-08 14:07:52,917 INFO  L276                IsEmpty]: Start isEmpty. Operand 885 states and 1368 transitions.
[2025-03-08 14:07:52,919 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-08 14:07:52,919 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:07:52,919 INFO  L218           NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 14:07:52,919 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 14:07:52,920 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:07:52,920 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:07:52,920 INFO  L85        PathProgramCache]: Analyzing trace with hash -1470110816, now seen corresponding path program 1 times
[2025-03-08 14:07:52,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:07:52,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123691242]
[2025-03-08 14:07:52,920 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:07:52,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:07:52,932 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-08 14:07:52,982 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-08 14:07:52,982 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:07:52,982 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:07:53,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked.
[2025-03-08 14:07:53,387 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:07:53,387 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123691242]
[2025-03-08 14:07:53,387 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123691242] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:07:53,387 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:07:53,387 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 14:07:53,387 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710458979]
[2025-03-08 14:07:53,387 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:07:53,387 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 14:07:53,388 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:07:53,388 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 14:07:53,388 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2025-03-08 14:07:53,388 INFO  L87              Difference]: Start difference. First operand 885 states and 1368 transitions. Second operand  has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30)
[2025-03-08 14:07:54,250 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:07:54,251 INFO  L93              Difference]: Finished difference Result 2191 states and 3380 transitions.
[2025-03-08 14:07:54,251 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 14:07:54,251 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198
[2025-03-08 14:07:54,252 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:07:54,257 INFO  L225             Difference]: With dead ends: 2191
[2025-03-08 14:07:54,258 INFO  L226             Difference]: Without dead ends: 1309
[2025-03-08 14:07:54,260 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210
[2025-03-08 14:07:54,260 INFO  L435           NwaCegarLoop]: 229 mSDtfsCounter, 426 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 14:07:54,261 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 915 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 14:07:54,262 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1309 states.
[2025-03-08 14:07:54,320 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1281.
[2025-03-08 14:07:54,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1281 states, 1014 states have (on average 1.4487179487179487) internal successors, (1469), 1021 states have internal predecessors, (1469), 252 states have call successors, (252), 14 states have call predecessors, (252), 14 states have return successors, (252), 245 states have call predecessors, (252), 252 states have call successors, (252)
[2025-03-08 14:07:54,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1973 transitions.
[2025-03-08 14:07:54,329 INFO  L78                 Accepts]: Start accepts. Automaton has 1281 states and 1973 transitions. Word has length 198
[2025-03-08 14:07:54,330 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:07:54,330 INFO  L471      AbstractCegarLoop]: Abstraction has 1281 states and 1973 transitions.
[2025-03-08 14:07:54,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30)
[2025-03-08 14:07:54,330 INFO  L276                IsEmpty]: Start isEmpty. Operand 1281 states and 1973 transitions.
[2025-03-08 14:07:54,334 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-08 14:07:54,335 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:07:54,335 INFO  L218           NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 14:07:54,335 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 14:07:54,336 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:07:54,336 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:07:54,336 INFO  L85        PathProgramCache]: Analyzing trace with hash 272699519, now seen corresponding path program 1 times
[2025-03-08 14:07:54,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:07:54,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76629085]
[2025-03-08 14:07:54,337 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:07:54,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:07:54,347 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-08 14:07:54,429 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-08 14:07:54,429 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:07:54,429 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 14:08:02,636 INFO  L134       CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked.
[2025-03-08 14:08:02,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 14:08:02,637 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76629085]
[2025-03-08 14:08:02,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76629085] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 14:08:02,637 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 14:08:02,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2025-03-08 14:08:02,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24937945]
[2025-03-08 14:08:02,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 14:08:02,637 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-03-08 14:08:02,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 14:08:02,638 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-03-08 14:08:02,638 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306
[2025-03-08 14:08:02,638 INFO  L87              Difference]: Start difference. First operand 1281 states and 1973 transitions. Second operand  has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30)
[2025-03-08 14:08:07,936 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 14:08:07,939 INFO  L93              Difference]: Finished difference Result 5252 states and 7919 transitions.
[2025-03-08 14:08:07,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2025-03-08 14:08:07,943 INFO  L78                 Accepts]: Start accepts. Automaton has  has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198
[2025-03-08 14:08:07,944 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 14:08:07,959 INFO  L225             Difference]: With dead ends: 5252
[2025-03-08 14:08:07,960 INFO  L226             Difference]: Without dead ends: 3974
[2025-03-08 14:08:07,964 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560
[2025-03-08 14:08:07,965 INFO  L435           NwaCegarLoop]: 121 mSDtfsCounter, 1356 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-03-08 14:08:07,965 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 1073 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-03-08 14:08:07,968 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3974 states.
[2025-03-08 14:08:08,083 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 1723.
[2025-03-08 14:08:08,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1723 states, 1418 states have (on average 1.464033850493653) internal successors, (2076), 1426 states have internal predecessors, (2076), 288 states have call successors, (288), 16 states have call predecessors, (288), 16 states have return successors, (288), 280 states have call predecessors, (288), 288 states have call successors, (288)
[2025-03-08 14:08:08,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2652 transitions.
[2025-03-08 14:08:08,091 INFO  L78                 Accepts]: Start accepts. Automaton has 1723 states and 2652 transitions. Word has length 198
[2025-03-08 14:08:08,091 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 14:08:08,092 INFO  L471      AbstractCegarLoop]: Abstraction has 1723 states and 2652 transitions.
[2025-03-08 14:08:08,092 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30)
[2025-03-08 14:08:08,092 INFO  L276                IsEmpty]: Start isEmpty. Operand 1723 states and 2652 transitions.
[2025-03-08 14:08:08,094 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2025-03-08 14:08:08,094 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 14:08:08,094 INFO  L218           NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 14:08:08,094 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 14:08:08,094 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 14:08:08,095 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 14:08:08,095 INFO  L85        PathProgramCache]: Analyzing trace with hash 1160203200, now seen corresponding path program 1 times
[2025-03-08 14:08:08,095 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 14:08:08,095 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897637738]
[2025-03-08 14:08:08,095 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 14:08:08,095 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 14:08:08,102 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes.
[2025-03-08 14:08:08,172 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements.
[2025-03-08 14:08:08,173 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 14:08:08,173 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat