./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i --full-output --architecture 32bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6abe9611945b9347dad66f4454ebe10d21d58cf2fa4c1fd6e8973cdda78a961e
[2025-02-05 22:25:53,491 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 22:25:53,499 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 22:25:53,500 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 22:25:53,501 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 22:25:53,501 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 22:25:53,503 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i
[2025-02-05 22:25:54,653 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e7c872fc/f2350cc237154a51a9f1417a40b836b6/FLAG29372d2ba
[2025-02-05 22:25:54,899 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 22:25:54,900 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i
[2025-02-05 22:25:54,930 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e7c872fc/f2350cc237154a51a9f1417a40b836b6/FLAG29372d2ba
[2025-02-05 22:25:55,227 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e7c872fc/f2350cc237154a51a9f1417a40b836b6
[2025-02-05 22:25:55,229 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 22:25:55,229 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 22:25:55,233 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 22:25:55,233 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 22:25:55,235 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 22:25:55,236 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,238 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55, skipping insertion in model container
[2025-02-05 22:25:55,238 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,252 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 22:25:55,332 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i[919,932]
[2025-02-05 22:25:55,367 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 22:25:55,377 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 22:25:55,383 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i[919,932]
[2025-02-05 22:25:55,403 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 22:25:55,413 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 22:25:55,413 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55 WrapperNode
[2025-02-05 22:25:55,414 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 22:25:55,414 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 22:25:55,414 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 22:25:55,414 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 22:25:55,418 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,423 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,459 INFO  L138                Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233
[2025-02-05 22:25:55,459 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 22:25:55,460 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 22:25:55,460 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 22:25:55,460 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 22:25:55,465 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,466 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,468 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,479 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 22:25:55,479 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,479 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,485 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,486 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,487 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,488 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,490 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 22:25:55,492 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 22:25:55,496 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 22:25:55,496 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 22:25:55,497 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (1/1) ...
[2025-02-05 22:25:55,503 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 22:25:55,513 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 22:25:55,532 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 22:25:55,535 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 22:25:55,550 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 22:25:55,550 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-05 22:25:55,550 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-05 22:25:55,550 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 22:25:55,550 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 22:25:55,550 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 22:25:55,598 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 22:25:55,599 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 22:25:56,003 INFO  L?                        ?]: Removed 23 outVars from TransFormulas that were not future-live.
[2025-02-05 22:25:56,004 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 22:25:56,021 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 22:25:56,021 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 22:25:56,022 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:25:56 BoogieIcfgContainer
[2025-02-05 22:25:56,022 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 22:25:56,025 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 22:25:56,025 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 22:25:56,028 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 22:25:56,029 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:25:55" (1/3) ...
[2025-02-05 22:25:56,029 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3835781c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:25:56, skipping insertion in model container
[2025-02-05 22:25:56,030 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:55" (2/3) ...
[2025-02-05 22:25:56,030 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3835781c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:25:56, skipping insertion in model container
[2025-02-05 22:25:56,030 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:25:56" (3/3) ...
[2025-02-05 22:25:56,031 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i
[2025-02-05 22:25:56,041 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 22:25:56,044 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 22:25:56,089 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 22:25:56,095 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;@12702eb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 22:25:56,096 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 22:25:56,098 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 96 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27)
[2025-02-05 22:25:56,106 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-02-05 22:25:56,106 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:25:56,107 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:25:56,107 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:25:56,110 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:25:56,110 INFO  L85        PathProgramCache]: Analyzing trace with hash -548486849, now seen corresponding path program 1 times
[2025-02-05 22:25:56,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:25:56,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798769919]
[2025-02-05 22:25:56,115 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:25:56,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:25:56,198 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-02-05 22:25:56,225 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-02-05 22:25:56,226 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:25:56,226 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:25:56,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked.
[2025-02-05 22:25:56,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:25:56,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798769919]
[2025-02-05 22:25:56,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798769919] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 22:25:56,357 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275014204]
[2025-02-05 22:25:56,357 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:25:56,357 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 22:25:56,357 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 22:25:56,359 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 22:25:56,360 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 22:25:56,427 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-02-05 22:25:56,499 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-02-05 22:25:56,500 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:25:56,500 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:25:56,503 INFO  L256         TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-05 22:25:56,511 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 22:25:56,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked.
[2025-02-05 22:25:56,541 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 22:25:56,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275014204] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:25:56,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 22:25:56,542 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-05 22:25:56,543 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295499917]
[2025-02-05 22:25:56,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:25:56,546 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 22:25:56,547 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:25:56,561 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 22:25:56,562 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 22:25:56,564 INFO  L87              Difference]: Start difference. First operand  has 96 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand  has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27)
[2025-02-05 22:25:56,589 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:25:56,589 INFO  L93              Difference]: Finished difference Result 186 states and 326 transitions.
[2025-02-05 22:25:56,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 22:25:56,591 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174
[2025-02-05 22:25:56,591 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:25:56,595 INFO  L225             Difference]: With dead ends: 186
[2025-02-05 22:25:56,596 INFO  L226             Difference]: Without dead ends: 93
[2025-02-05 22:25:56,598 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 22:25:56,599 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 22:25:56,600 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 22:25:56,616 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2025-02-05 22:25:56,642 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2025-02-05 22:25:56,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 93 states, 64 states have (on average 1.4375) internal successors, (92), 64 states have internal predecessors, (92), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27)
[2025-02-05 22:25:56,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions.
[2025-02-05 22:25:56,649 INFO  L78                 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 174
[2025-02-05 22:25:56,649 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:25:56,649 INFO  L471      AbstractCegarLoop]: Abstraction has 93 states and 146 transitions.
[2025-02-05 22:25:56,649 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27)
[2025-02-05 22:25:56,649 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions.
[2025-02-05 22:25:56,652 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-02-05 22:25:56,653 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:25:56,653 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:25:56,661 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 22:25:56,854 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-05 22:25:56,855 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:25:56,856 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:25:56,856 INFO  L85        PathProgramCache]: Analyzing trace with hash -231186818, now seen corresponding path program 1 times
[2025-02-05 22:25:56,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:25:56,856 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960479740]
[2025-02-05 22:25:56,856 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:25:56,856 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:25:56,878 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-02-05 22:25:56,971 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-02-05 22:25:56,971 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:25:56,971 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:25:57,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:25:57,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:25:57,206 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960479740]
[2025-02-05 22:25:57,206 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960479740] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:25:57,206 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:25:57,206 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 22:25:57,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715145382]
[2025-02-05 22:25:57,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:25:57,207 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 22:25:57,207 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:25:57,207 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 22:25:57,207 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 22:25:57,207 INFO  L87              Difference]: Start difference. First operand 93 states and 146 transitions. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:25:57,244 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:25:57,244 INFO  L93              Difference]: Finished difference Result 184 states and 291 transitions.
[2025-02-05 22:25:57,246 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 22:25:57,247 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174
[2025-02-05 22:25:57,247 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:25:57,248 INFO  L225             Difference]: With dead ends: 184
[2025-02-05 22:25:57,248 INFO  L226             Difference]: Without dead ends: 94
[2025-02-05 22:25:57,249 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 22:25:57,249 INFO  L435           NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 22:25:57,251 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 22:25:57,252 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-02-05 22:25:57,259 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2025-02-05 22:25:57,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27)
[2025-02-05 22:25:57,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions.
[2025-02-05 22:25:57,264 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 174
[2025-02-05 22:25:57,265 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:25:57,265 INFO  L471      AbstractCegarLoop]: Abstraction has 94 states and 147 transitions.
[2025-02-05 22:25:57,265 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:25:57,265 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions.
[2025-02-05 22:25:57,271 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-02-05 22:25:57,271 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:25:57,271 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:25:57,271 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 22:25:57,271 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:25:57,271 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:25:57,271 INFO  L85        PathProgramCache]: Analyzing trace with hash 656316863, now seen corresponding path program 1 times
[2025-02-05 22:25:57,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:25:57,271 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974142392]
[2025-02-05 22:25:57,272 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:25:57,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:25:57,285 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-02-05 22:25:57,324 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-02-05 22:25:57,324 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:25:57,324 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:25:57,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:25:57,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:25:57,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974142392]
[2025-02-05 22:25:57,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974142392] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:25:57,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:25:57,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 22:25:57,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921696077]
[2025-02-05 22:25:57,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:25:57,505 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 22:25:57,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:25:57,506 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 22:25:57,506 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 22:25:57,506 INFO  L87              Difference]: Start difference. First operand 94 states and 147 transitions. Second operand  has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:25:57,721 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:25:57,722 INFO  L93              Difference]: Finished difference Result 277 states and 436 transitions.
[2025-02-05 22:25:57,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 22:25:57,722 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174
[2025-02-05 22:25:57,723 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:25:57,725 INFO  L225             Difference]: With dead ends: 277
[2025-02-05 22:25:57,725 INFO  L226             Difference]: Without dead ends: 186
[2025-02-05 22:25:57,726 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-02-05 22:25:57,727 INFO  L435           NwaCegarLoop]: 137 mSDtfsCounter, 114 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 22:25:57,727 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 484 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 22:25:57,728 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 186 states.
[2025-02-05 22:25:57,750 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 141.
[2025-02-05 22:25:57,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 141 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 84 states have internal predecessors, (112), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54)
[2025-02-05 22:25:57,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 220 transitions.
[2025-02-05 22:25:57,755 INFO  L78                 Accepts]: Start accepts. Automaton has 141 states and 220 transitions. Word has length 174
[2025-02-05 22:25:57,756 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:25:57,756 INFO  L471      AbstractCegarLoop]: Abstraction has 141 states and 220 transitions.
[2025-02-05 22:25:57,756 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:25:57,756 INFO  L276                IsEmpty]: Start isEmpty. Operand 141 states and 220 transitions.
[2025-02-05 22:25:57,757 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-02-05 22:25:57,759 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:25:57,760 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:25:57,760 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 22:25:57,760 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:25:57,760 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:25:57,760 INFO  L85        PathProgramCache]: Analyzing trace with hash 867667776, now seen corresponding path program 1 times
[2025-02-05 22:25:57,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:25:57,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816927202]
[2025-02-05 22:25:57,760 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:25:57,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:25:57,773 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-02-05 22:25:57,969 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-02-05 22:25:57,969 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:25:57,969 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:26:04,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:26:04,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:26:04,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816927202]
[2025-02-05 22:26:04,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816927202] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:26:04,380 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:26:04,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2025-02-05 22:26:04,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424025967]
[2025-02-05 22:26:04,380 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:26:04,381 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-02-05 22:26:04,381 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:26:04,381 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-02-05 22:26:04,381 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210
[2025-02-05 22:26:04,382 INFO  L87              Difference]: Start difference. First operand 141 states and 220 transitions. Second operand  has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:06,514 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:26:06,515 INFO  L93              Difference]: Finished difference Result 464 states and 727 transitions.
[2025-02-05 22:26:06,515 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-02-05 22:26:06,515 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174
[2025-02-05 22:26:06,516 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:26:06,518 INFO  L225             Difference]: With dead ends: 464
[2025-02-05 22:26:06,518 INFO  L226             Difference]: Without dead ends: 373
[2025-02-05 22:26:06,519 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756
[2025-02-05 22:26:06,519 INFO  L435           NwaCegarLoop]: 112 mSDtfsCounter, 1023 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 22:26:06,520 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 962 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 22:26:06,520 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 373 states.
[2025-02-05 22:26:06,532 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 183.
[2025-02-05 22:26:06,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 183 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54)
[2025-02-05 22:26:06,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 285 transitions.
[2025-02-05 22:26:06,534 INFO  L78                 Accepts]: Start accepts. Automaton has 183 states and 285 transitions. Word has length 174
[2025-02-05 22:26:06,534 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:26:06,534 INFO  L471      AbstractCegarLoop]: Abstraction has 183 states and 285 transitions.
[2025-02-05 22:26:06,534 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:06,534 INFO  L276                IsEmpty]: Start isEmpty. Operand 183 states and 285 transitions.
[2025-02-05 22:26:06,535 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-02-05 22:26:06,535 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:26:06,535 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:26:06,536 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 22:26:06,536 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:26:06,536 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:26:06,536 INFO  L85        PathProgramCache]: Analyzing trace with hash -929283583, now seen corresponding path program 1 times
[2025-02-05 22:26:06,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:26:06,537 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105376386]
[2025-02-05 22:26:06,537 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:26:06,537 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:26:06,545 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-02-05 22:26:06,585 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-02-05 22:26:06,585 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:26:06,586 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:26:06,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:26:06,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:26:06,771 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105376386]
[2025-02-05 22:26:06,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105376386] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:26:06,771 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:26:06,771 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 22:26:06,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322940970]
[2025-02-05 22:26:06,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:26:06,771 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 22:26:06,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:26:06,772 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 22:26:06,772 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 22:26:06,772 INFO  L87              Difference]: Start difference. First operand 183 states and 285 transitions. Second operand  has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:06,857 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:26:06,857 INFO  L93              Difference]: Finished difference Result 357 states and 557 transitions.
[2025-02-05 22:26:06,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 22:26:06,858 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174
[2025-02-05 22:26:06,858 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:26:06,859 INFO  L225             Difference]: With dead ends: 357
[2025-02-05 22:26:06,859 INFO  L226             Difference]: Without dead ends: 266
[2025-02-05 22:26:06,860 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 22:26:06,860 INFO  L435           NwaCegarLoop]: 135 mSDtfsCounter, 116 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 22:26:06,861 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 385 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 22:26:06,861 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2025-02-05 22:26:06,881 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 197.
[2025-02-05 22:26:06,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 197 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 140 states have internal predecessors, (197), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54)
[2025-02-05 22:26:06,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 305 transitions.
[2025-02-05 22:26:06,889 INFO  L78                 Accepts]: Start accepts. Automaton has 197 states and 305 transitions. Word has length 174
[2025-02-05 22:26:06,889 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:26:06,889 INFO  L471      AbstractCegarLoop]: Abstraction has 197 states and 305 transitions.
[2025-02-05 22:26:06,889 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:06,889 INFO  L276                IsEmpty]: Start isEmpty. Operand 197 states and 305 transitions.
[2025-02-05 22:26:06,890 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2025-02-05 22:26:06,890 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:26:06,890 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:26:06,890 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 22:26:06,890 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:26:06,891 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:26:06,891 INFO  L85        PathProgramCache]: Analyzing trace with hash -129404577, now seen corresponding path program 1 times
[2025-02-05 22:26:06,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:26:06,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096368008]
[2025-02-05 22:26:06,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:26:06,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:26:06,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes.
[2025-02-05 22:26:06,921 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements.
[2025-02-05 22:26:06,922 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:26:06,922 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:26:06,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:26:06,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:26:06,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096368008]
[2025-02-05 22:26:06,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096368008] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:26:06,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:26:06,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 22:26:06,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669551418]
[2025-02-05 22:26:06,962 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:26:06,962 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 22:26:06,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:26:06,963 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 22:26:06,963 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 22:26:06,963 INFO  L87              Difference]: Start difference. First operand 197 states and 305 transitions. Second operand  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:07,003 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:26:07,004 INFO  L93              Difference]: Finished difference Result 388 states and 605 transitions.
[2025-02-05 22:26:07,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 22:26:07,004 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174
[2025-02-05 22:26:07,004 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:26:07,006 INFO  L225             Difference]: With dead ends: 388
[2025-02-05 22:26:07,006 INFO  L226             Difference]: Without dead ends: 279
[2025-02-05 22:26:07,006 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 22:26:07,007 INFO  L435           NwaCegarLoop]: 192 mSDtfsCounter, 138 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 22:26:07,007 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 320 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 22:26:07,008 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 279 states.
[2025-02-05 22:26:07,022 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277.
[2025-02-05 22:26:07,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 277 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 192 states have internal predecessors, (268), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81)
[2025-02-05 22:26:07,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 430 transitions.
[2025-02-05 22:26:07,024 INFO  L78                 Accepts]: Start accepts. Automaton has 277 states and 430 transitions. Word has length 174
[2025-02-05 22:26:07,025 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:26:07,025 INFO  L471      AbstractCegarLoop]: Abstraction has 277 states and 430 transitions.
[2025-02-05 22:26:07,025 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:07,025 INFO  L276                IsEmpty]: Start isEmpty. Operand 277 states and 430 transitions.
[2025-02-05 22:26:07,026 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2025-02-05 22:26:07,026 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:26:07,026 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:26:07,026 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 22:26:07,027 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:26:07,027 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:26:07,027 INFO  L85        PathProgramCache]: Analyzing trace with hash -113271249, now seen corresponding path program 1 times
[2025-02-05 22:26:07,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:26:07,027 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145105413]
[2025-02-05 22:26:07,027 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:26:07,027 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:26:07,034 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-02-05 22:26:07,087 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-02-05 22:26:07,088 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:26:07,088 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:26:07,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:26:07,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:26:07,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145105413]
[2025-02-05 22:26:07,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145105413] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:26:07,294 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:26:07,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 22:26:07,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593601278]
[2025-02-05 22:26:07,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:26:07,295 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 22:26:07,295 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:26:07,295 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 22:26:07,295 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 22:26:07,295 INFO  L87              Difference]: Start difference. First operand 277 states and 430 transitions. Second operand  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:07,338 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:26:07,338 INFO  L93              Difference]: Finished difference Result 528 states and 826 transitions.
[2025-02-05 22:26:07,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 22:26:07,338 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175
[2025-02-05 22:26:07,339 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:26:07,340 INFO  L225             Difference]: With dead ends: 528
[2025-02-05 22:26:07,340 INFO  L226             Difference]: Without dead ends: 339
[2025-02-05 22:26:07,341 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 22:26:07,342 INFO  L435           NwaCegarLoop]: 133 mSDtfsCounter, 47 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 22:26:07,342 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 300 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 22:26:07,342 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 339 states.
[2025-02-05 22:26:07,353 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 277.
[2025-02-05 22:26:07,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 277 states, 192 states have (on average 1.3802083333333333) internal successors, (265), 192 states have internal predecessors, (265), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81)
[2025-02-05 22:26:07,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 427 transitions.
[2025-02-05 22:26:07,355 INFO  L78                 Accepts]: Start accepts. Automaton has 277 states and 427 transitions. Word has length 175
[2025-02-05 22:26:07,355 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:26:07,355 INFO  L471      AbstractCegarLoop]: Abstraction has 277 states and 427 transitions.
[2025-02-05 22:26:07,355 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:07,355 INFO  L276                IsEmpty]: Start isEmpty. Operand 277 states and 427 transitions.
[2025-02-05 22:26:07,356 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2025-02-05 22:26:07,357 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:26:07,357 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:26:07,357 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 22:26:07,357 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:26:07,357 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:26:07,357 INFO  L85        PathProgramCache]: Analyzing trace with hash -618829874, now seen corresponding path program 1 times
[2025-02-05 22:26:07,358 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:26:07,358 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643657423]
[2025-02-05 22:26:07,358 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:26:07,358 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:26:07,364 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-02-05 22:26:07,413 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-02-05 22:26:07,413 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:26:07,413 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:26:09,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:26:09,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:26:09,950 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643657423]
[2025-02-05 22:26:09,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643657423] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:26:09,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:26:09,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2025-02-05 22:26:09,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742851204]
[2025-02-05 22:26:09,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:26:09,952 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-02-05 22:26:09,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:26:09,952 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-02-05 22:26:09,952 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240
[2025-02-05 22:26:09,953 INFO  L87              Difference]: Start difference. First operand 277 states and 427 transitions. Second operand  has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27)
[2025-02-05 22:26:11,664 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:26:11,664 INFO  L93              Difference]: Finished difference Result 463 states and 702 transitions.
[2025-02-05 22:26:11,665 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-02-05 22:26:11,665 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175
[2025-02-05 22:26:11,665 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:26:11,667 INFO  L225             Difference]: With dead ends: 463
[2025-02-05 22:26:11,667 INFO  L226             Difference]: Without dead ends: 461
[2025-02-05 22:26:11,668 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122
[2025-02-05 22:26:11,668 INFO  L435           NwaCegarLoop]: 128 mSDtfsCounter, 1066 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 22:26:11,669 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1137 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 22:26:11,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 461 states.
[2025-02-05 22:26:11,686 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 278.
[2025-02-05 22:26:11,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 278 states, 193 states have (on average 1.378238341968912) internal successors, (266), 193 states have internal predecessors, (266), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81)
[2025-02-05 22:26:11,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 428 transitions.
[2025-02-05 22:26:11,688 INFO  L78                 Accepts]: Start accepts. Automaton has 278 states and 428 transitions. Word has length 175
[2025-02-05 22:26:11,689 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:26:11,689 INFO  L471      AbstractCegarLoop]: Abstraction has 278 states and 428 transitions.
[2025-02-05 22:26:11,689 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27)
[2025-02-05 22:26:11,689 INFO  L276                IsEmpty]: Start isEmpty. Operand 278 states and 428 transitions.
[2025-02-05 22:26:11,690 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2025-02-05 22:26:11,690 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:26:11,690 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:26:11,690 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 22:26:11,691 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:26:11,691 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:26:11,691 INFO  L85        PathProgramCache]: Analyzing trace with hash 1092643596, now seen corresponding path program 1 times
[2025-02-05 22:26:11,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:26:11,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813625760]
[2025-02-05 22:26:11,691 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:26:11,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:26:11,698 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-02-05 22:26:11,768 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-02-05 22:26:11,770 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:26:11,771 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:26:17,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:26:17,296 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:26:17,296 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813625760]
[2025-02-05 22:26:17,296 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813625760] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:26:17,296 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:26:17,296 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2025-02-05 22:26:17,296 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448086523]
[2025-02-05 22:26:17,296 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:26:17,297 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-02-05 22:26:17,297 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:26:17,297 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-02-05 22:26:17,297 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210
[2025-02-05 22:26:17,297 INFO  L87              Difference]: Start difference. First operand 278 states and 428 transitions. Second operand  has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:21,218 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:26:21,218 INFO  L93              Difference]: Finished difference Result 459 states and 698 transitions.
[2025-02-05 22:26:21,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-02-05 22:26:21,219 INFO  L78                 Accepts]: Start accepts. Automaton has  has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175
[2025-02-05 22:26:21,219 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:26:21,221 INFO  L225             Difference]: With dead ends: 459
[2025-02-05 22:26:21,221 INFO  L226             Difference]: Without dead ends: 457
[2025-02-05 22:26:21,222 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756
[2025-02-05 22:26:21,223 INFO  L435           NwaCegarLoop]: 130 mSDtfsCounter, 858 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 22:26:21,223 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1040 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 22:26:21,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 457 states.
[2025-02-05 22:26:21,251 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 281.
[2025-02-05 22:26:21,252 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 281 states, 196 states have (on average 1.3775510204081634) internal successors, (270), 196 states have internal predecessors, (270), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81)
[2025-02-05 22:26:21,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 432 transitions.
[2025-02-05 22:26:21,261 INFO  L78                 Accepts]: Start accepts. Automaton has 281 states and 432 transitions. Word has length 175
[2025-02-05 22:26:21,261 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:26:21,261 INFO  L471      AbstractCegarLoop]: Abstraction has 281 states and 432 transitions.
[2025-02-05 22:26:21,261 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:21,261 INFO  L276                IsEmpty]: Start isEmpty. Operand 281 states and 432 transitions.
[2025-02-05 22:26:21,262 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2025-02-05 22:26:21,262 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:26:21,262 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:26:21,263 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 22:26:21,263 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:26:21,263 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:26:21,263 INFO  L85        PathProgramCache]: Analyzing trace with hash -808476560, now seen corresponding path program 1 times
[2025-02-05 22:26:21,263 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:26:21,266 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836364152]
[2025-02-05 22:26:21,266 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:26:21,266 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:26:21,285 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-02-05 22:26:21,335 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-02-05 22:26:21,338 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:26:21,338 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:26:21,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:26:21,451 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:26:21,451 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836364152]
[2025-02-05 22:26:21,451 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836364152] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:26:21,451 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:26:21,451 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 22:26:21,451 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573039756]
[2025-02-05 22:26:21,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:26:21,452 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 22:26:21,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:26:21,453 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 22:26:21,453 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 22:26:21,453 INFO  L87              Difference]: Start difference. First operand 281 states and 432 transitions. Second operand  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:21,533 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:26:21,533 INFO  L93              Difference]: Finished difference Result 544 states and 835 transitions.
[2025-02-05 22:26:21,533 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 22:26:21,533 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175
[2025-02-05 22:26:21,534 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:26:21,536 INFO  L225             Difference]: With dead ends: 544
[2025-02-05 22:26:21,536 INFO  L226             Difference]: Without dead ends: 355
[2025-02-05 22:26:21,537 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 22:26:21,537 INFO  L435           NwaCegarLoop]: 182 mSDtfsCounter, 115 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 22:26:21,537 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 357 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 22:26:21,538 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 355 states.
[2025-02-05 22:26:21,554 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 291.
[2025-02-05 22:26:21,554 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 291 states, 206 states have (on average 1.3737864077669903) internal successors, (283), 206 states have internal predecessors, (283), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81)
[2025-02-05 22:26:21,555 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 445 transitions.
[2025-02-05 22:26:21,555 INFO  L78                 Accepts]: Start accepts. Automaton has 291 states and 445 transitions. Word has length 175
[2025-02-05 22:26:21,556 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:26:21,556 INFO  L471      AbstractCegarLoop]: Abstraction has 291 states and 445 transitions.
[2025-02-05 22:26:21,556 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:21,556 INFO  L276                IsEmpty]: Start isEmpty. Operand 291 states and 445 transitions.
[2025-02-05 22:26:21,557 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2025-02-05 22:26:21,557 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:26:21,557 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:26:21,558 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 22:26:21,558 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:26:21,558 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:26:21,558 INFO  L85        PathProgramCache]: Analyzing trace with hash 1689539377, now seen corresponding path program 1 times
[2025-02-05 22:26:21,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:26:21,558 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670304079]
[2025-02-05 22:26:21,558 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:26:21,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:26:21,564 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-02-05 22:26:21,596 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-02-05 22:26:21,596 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:26:21,596 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:26:27,440 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:26:27,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:26:27,440 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670304079]
[2025-02-05 22:26:27,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670304079] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:26:27,440 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:26:27,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2025-02-05 22:26:27,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197637259]
[2025-02-05 22:26:27,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:26:27,441 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-02-05 22:26:27,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:26:27,441 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-02-05 22:26:27,441 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240
[2025-02-05 22:26:27,441 INFO  L87              Difference]: Start difference. First operand 291 states and 445 transitions. Second operand  has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:34,256 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:26:34,256 INFO  L93              Difference]: Finished difference Result 524 states and 790 transitions.
[2025-02-05 22:26:34,257 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-02-05 22:26:34,257 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175
[2025-02-05 22:26:34,257 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:26:34,259 INFO  L225             Difference]: With dead ends: 524
[2025-02-05 22:26:34,259 INFO  L226             Difference]: Without dead ends: 522
[2025-02-05 22:26:34,260 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992
[2025-02-05 22:26:34,260 INFO  L435           NwaCegarLoop]: 156 mSDtfsCounter, 498 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time
[2025-02-05 22:26:34,260 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1266 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time]
[2025-02-05 22:26:34,261 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 522 states.
[2025-02-05 22:26:34,272 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 335.
[2025-02-05 22:26:34,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 335 states, 250 states have (on average 1.4) internal successors, (350), 250 states have internal predecessors, (350), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81)
[2025-02-05 22:26:34,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 512 transitions.
[2025-02-05 22:26:34,275 INFO  L78                 Accepts]: Start accepts. Automaton has 335 states and 512 transitions. Word has length 175
[2025-02-05 22:26:34,275 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:26:34,275 INFO  L471      AbstractCegarLoop]: Abstraction has 335 states and 512 transitions.
[2025-02-05 22:26:34,275 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)
[2025-02-05 22:26:34,275 INFO  L276                IsEmpty]: Start isEmpty. Operand 335 states and 512 transitions.
[2025-02-05 22:26:34,276 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 176
[2025-02-05 22:26:34,276 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:26:34,276 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:26:34,276 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 22:26:34,277 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:26:34,277 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:26:34,277 INFO  L85        PathProgramCache]: Analyzing trace with hash 1179005200, now seen corresponding path program 1 times
[2025-02-05 22:26:34,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:26:34,277 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544646994]
[2025-02-05 22:26:34,277 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:26:34,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:26:34,283 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes.
[2025-02-05 22:26:34,311 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements.
[2025-02-05 22:26:34,311 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:26:34,311 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:26:49,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:26:49,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:26:49,722 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544646994]
[2025-02-05 22:26:49,722 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544646994] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:26:49,722 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:26:49,722 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2025-02-05 22:26:49,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338855560]
[2025-02-05 22:26:49,723 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:26:49,723 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-02-05 22:26:49,723 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:26:49,723 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-02-05 22:26:49,723 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380
[2025-02-05 22:26:49,724 INFO  L87              Difference]: Start difference. First operand 335 states and 512 transitions. Second operand  has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27)
[2025-02-05 22:27:07,967 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:27:07,970 INFO  L93              Difference]: Finished difference Result 520 states and 785 transitions.
[2025-02-05 22:27:07,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-02-05 22:27:07,971 INFO  L78                 Accepts]: Start accepts. Automaton has  has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 175
[2025-02-05 22:27:07,971 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:27:07,973 INFO  L225             Difference]: With dead ends: 520
[2025-02-05 22:27:07,977 INFO  L226             Difference]: Without dead ends: 518
[2025-02-05 22:27:07,978 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=358, Invalid=1048, Unknown=0, NotChecked=0, Total=1406
[2025-02-05 22:27:07,978 INFO  L435           NwaCegarLoop]: 139 mSDtfsCounter, 680 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time
[2025-02-05 22:27:07,979 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1402 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time]
[2025-02-05 22:27:07,979 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 518 states.
[2025-02-05 22:27:07,993 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 339.
[2025-02-05 22:27:07,994 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 339 states, 253 states have (on average 1.3952569169960474) internal successors, (353), 253 states have internal predecessors, (353), 81 states have call successors, (81), 4 states have call predecessors, (81), 4 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81)
[2025-02-05 22:27:07,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 515 transitions.
[2025-02-05 22:27:07,996 INFO  L78                 Accepts]: Start accepts. Automaton has 339 states and 515 transitions. Word has length 175
[2025-02-05 22:27:07,996 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:27:07,996 INFO  L471      AbstractCegarLoop]: Abstraction has 339 states and 515 transitions.
[2025-02-05 22:27:07,996 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27)
[2025-02-05 22:27:07,996 INFO  L276                IsEmpty]: Start isEmpty. Operand 339 states and 515 transitions.
[2025-02-05 22:27:07,998 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2025-02-05 22:27:07,998 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:27:07,999 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:27:07,999 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 22:27:07,999 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:27:07,999 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:27:07,999 INFO  L85        PathProgramCache]: Analyzing trace with hash -2039110594, now seen corresponding path program 1 times
[2025-02-05 22:27:07,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:27:08,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769266406]
[2025-02-05 22:27:08,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:27:08,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:27:08,006 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes.
[2025-02-05 22:27:08,057 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements.
[2025-02-05 22:27:08,057 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:27:08,057 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:27:13,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:27:13,998 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:27:13,998 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769266406]
[2025-02-05 22:27:13,998 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769266406] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:27:13,998 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:27:13,998 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2025-02-05 22:27:13,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172006645]
[2025-02-05 22:27:13,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:27:13,998 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-02-05 22:27:13,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:27:13,999 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-02-05 22:27:14,000 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306
[2025-02-05 22:27:14,000 INFO  L87              Difference]: Start difference. First operand 339 states and 515 transitions. Second operand  has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27)
[2025-02-05 22:27:17,862 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:27:17,862 INFO  L93              Difference]: Finished difference Result 503 states and 762 transitions.
[2025-02-05 22:27:17,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-02-05 22:27:17,865 INFO  L78                 Accepts]: Start accepts. Automaton has  has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 176
[2025-02-05 22:27:17,865 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:27:17,870 INFO  L225             Difference]: With dead ends: 503
[2025-02-05 22:27:17,870 INFO  L226             Difference]: Without dead ends: 501
[2025-02-05 22:27:17,871 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992
[2025-02-05 22:27:17,871 INFO  L435           NwaCegarLoop]: 165 mSDtfsCounter, 989 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 22:27:17,871 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1354 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 22:27:17,873 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 501 states.
[2025-02-05 22:27:17,896 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 337.
[2025-02-05 22:27:17,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 337 states, 251 states have (on average 1.3944223107569722) internal successors, (350), 251 states have internal predecessors, (350), 81 states have call successors, (81), 4 states have call predecessors, (81), 4 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81)
[2025-02-05 22:27:17,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 512 transitions.
[2025-02-05 22:27:17,903 INFO  L78                 Accepts]: Start accepts. Automaton has 337 states and 512 transitions. Word has length 176
[2025-02-05 22:27:17,903 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:27:17,903 INFO  L471      AbstractCegarLoop]: Abstraction has 337 states and 512 transitions.
[2025-02-05 22:27:17,903 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27)
[2025-02-05 22:27:17,903 INFO  L276                IsEmpty]: Start isEmpty. Operand 337 states and 512 transitions.
[2025-02-05 22:27:17,905 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2025-02-05 22:27:17,908 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:27:17,908 INFO  L218           NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:27:17,909 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 22:27:17,909 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:27:17,909 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:27:17,909 INFO  L85        PathProgramCache]: Analyzing trace with hash 1458319199, now seen corresponding path program 1 times
[2025-02-05 22:27:17,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:27:17,909 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789319194]
[2025-02-05 22:27:17,909 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:27:17,909 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:27:17,916 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes.
[2025-02-05 22:27:17,933 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements.
[2025-02-05 22:27:17,933 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:27:17,933 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:27:26,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked.
[2025-02-05 22:27:26,453 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:27:26,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789319194]
[2025-02-05 22:27:26,453 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789319194] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:27:26,453 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:27:26,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2025-02-05 22:27:26,454 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187765960]
[2025-02-05 22:27:26,454 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:27:26,454 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-02-05 22:27:26,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:27:26,455 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-02-05 22:27:26,455 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272
[2025-02-05 22:27:26,455 INFO  L87              Difference]: Start difference. First operand 337 states and 512 transitions. Second operand  has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)