./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i --full-output --architecture 32bit


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20b89f8a60d2f6d2584628c0d5624c8090542a805d1f710cb23a05b88ce8a600
[2025-03-08 11:13:44,261 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 11:13:44,272 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 11:13:44,274 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 11:13:44,275 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 11:13:44,276 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 11:13:44,277 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i
[2025-03-08 11:13:45,497 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c75deb81/e4d28db19fd14342ad768d0c41096144/FLAGb675ec353
[2025-03-08 11:13:45,713 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 11:13:45,713 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i
[2025-03-08 11:13:45,724 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c75deb81/e4d28db19fd14342ad768d0c41096144/FLAGb675ec353
[2025-03-08 11:13:45,746 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c75deb81/e4d28db19fd14342ad768d0c41096144
[2025-03-08 11:13:45,748 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 11:13:45,750 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 11:13:45,751 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 11:13:45,752 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 11:13:45,755 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 11:13:45,755 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:13:45" (1/1) ...
[2025-03-08 11:13:45,757 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d5e064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:45, skipping insertion in model container
[2025-03-08 11:13:45,757 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:13:45" (1/1) ...
[2025-03-08 11:13:45,778 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 11:13:45,894 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i[915,928]
[2025-03-08 11:13:45,955 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 11:13:45,974 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 11:13:45,984 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-81.i[915,928]
[2025-03-08 11:13:46,016 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 11:13:46,032 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 11:13:46,032 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46 WrapperNode
[2025-03-08 11:13:46,032 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 11:13:46,034 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 11:13:46,034 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 11:13:46,034 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 11:13:46,038 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (1/1) ...
[2025-03-08 11:13:46,048 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (1/1) ...
[2025-03-08 11:13:46,072 INFO  L138                Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247
[2025-03-08 11:13:46,073 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 11:13:46,073 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 11:13:46,073 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 11:13:46,074 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 11:13:46,079 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (1/1) ...
[2025-03-08 11:13:46,080 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (1/1) ...
[2025-03-08 11:13:46,087 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (1/1) ...
[2025-03-08 11:13:46,109 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 11:13:46,109 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (1/1) ...
[2025-03-08 11:13:46,109 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (1/1) ...
[2025-03-08 11:13:46,118 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (1/1) ...
[2025-03-08 11:13:46,124 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (1/1) ...
[2025-03-08 11:13:46,125 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (1/1) ...
[2025-03-08 11:13:46,126 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (1/1) ...
[2025-03-08 11:13:46,130 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 11:13:46,132 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 11:13:46,133 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 11:13:46,133 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 11:13:46,134 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (1/1) ...
[2025-03-08 11:13:46,139 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 11:13:46,150 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:13:46,163 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 11:13:46,166 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 11:13:46,189 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 11:13:46,189 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 11:13:46,189 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 11:13:46,189 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 11:13:46,189 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 11:13:46,189 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 11:13:46,260 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 11:13:46,261 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 11:13:46,604 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L183: havoc property_#t~bitwise26#1;havoc property_#t~short27#1;
[2025-03-08 11:13:46,649 INFO  L?                        ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2025-03-08 11:13:46,650 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 11:13:46,669 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 11:13:46,670 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 11:13:46,670 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:13:46 BoogieIcfgContainer
[2025-03-08 11:13:46,670 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 11:13:46,672 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 11:13:46,672 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 11:13:46,675 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 11:13:46,675 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:13:45" (1/3) ...
[2025-03-08 11:13:46,676 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57437eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:13:46, skipping insertion in model container
[2025-03-08 11:13:46,676 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:13:46" (2/3) ...
[2025-03-08 11:13:46,677 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57437eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:13:46, skipping insertion in model container
[2025-03-08 11:13:46,677 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:13:46" (3/3) ...
[2025-03-08 11:13:46,678 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-81.i
[2025-03-08 11:13:46,688 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 11:13:46,690 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-81.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 11:13:46,737 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 11:13:46,751 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;@5a443c29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 11:13:46,751 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 11:13:46,754 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 108 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41)
[2025-03-08 11:13:46,767 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2025-03-08 11:13:46,768 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:13:46,769 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:13:46,769 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:13:46,773 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:13:46,774 INFO  L85        PathProgramCache]: Analyzing trace with hash 197515483, now seen corresponding path program 1 times
[2025-03-08 11:13:46,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:13:46,781 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470650385]
[2025-03-08 11:13:46,781 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:13:46,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:13:46,888 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-03-08 11:13:46,914 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-03-08 11:13:46,915 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:13:46,915 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:13:47,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked.
[2025-03-08 11:13:47,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:13:47,146 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470650385]
[2025-03-08 11:13:47,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470650385] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 11:13:47,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206357055]
[2025-03-08 11:13:47,148 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:13:47,148 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 11:13:47,148 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 11:13:47,151 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 11:13:47,152 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 11:13:47,226 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-03-08 11:13:47,320 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-03-08 11:13:47,320 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:13:47,320 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:13:47,324 INFO  L256         TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 11:13:47,333 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 11:13:47,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked.
[2025-03-08 11:13:47,372 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 11:13:47,372 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206357055] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:13:47,372 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 11:13:47,373 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 11:13:47,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152984691]
[2025-03-08 11:13:47,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:13:47,378 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 11:13:47,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:13:47,393 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 11:13:47,394 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 11:13:47,396 INFO  L87              Difference]: Start difference. First operand  has 108 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand  has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41)
[2025-03-08 11:13:47,434 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:13:47,435 INFO  L93              Difference]: Finished difference Result 210 states and 376 transitions.
[2025-03-08 11:13:47,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 11:13:47,437 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 251
[2025-03-08 11:13:47,437 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:13:47,441 INFO  L225             Difference]: With dead ends: 210
[2025-03-08 11:13:47,441 INFO  L226             Difference]: Without dead ends: 105
[2025-03-08 11:13:47,444 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 11:13:47,446 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:13:47,446 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:13:47,459 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 105 states.
[2025-03-08 11:13:47,485 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105.
[2025-03-08 11:13:47,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41)
[2025-03-08 11:13:47,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 165 transitions.
[2025-03-08 11:13:47,501 INFO  L78                 Accepts]: Start accepts. Automaton has 105 states and 165 transitions. Word has length 251
[2025-03-08 11:13:47,501 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:13:47,501 INFO  L471      AbstractCegarLoop]: Abstraction has 105 states and 165 transitions.
[2025-03-08 11:13:47,502 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41)
[2025-03-08 11:13:47,502 INFO  L276                IsEmpty]: Start isEmpty. Operand 105 states and 165 transitions.
[2025-03-08 11:13:47,505 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2025-03-08 11:13:47,506 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:13:47,506 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:13:47,513 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 11:13:47,707 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 11:13:47,707 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:13:47,708 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:13:47,708 INFO  L85        PathProgramCache]: Analyzing trace with hash -662108550, now seen corresponding path program 1 times
[2025-03-08 11:13:47,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:13:47,708 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104909402]
[2025-03-08 11:13:47,708 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:13:47,708 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:13:47,727 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-03-08 11:13:47,956 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-03-08 11:13:47,958 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:13:47,958 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:13:58,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:13:58,882 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:13:58,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104909402]
[2025-03-08 11:13:58,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104909402] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:13:58,882 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:13:58,882 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 11:13:58,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445388520]
[2025-03-08 11:13:58,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:13:58,883 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 11:13:58,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:13:58,884 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 11:13:58,884 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2025-03-08 11:13:58,885 INFO  L87              Difference]: Start difference. First operand 105 states and 165 transitions. Second operand  has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:00,610 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:00,610 INFO  L93              Difference]: Finished difference Result 292 states and 447 transitions.
[2025-03-08 11:14:00,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 11:14:00,612 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 251
[2025-03-08 11:14:00,612 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:00,614 INFO  L225             Difference]: With dead ends: 292
[2025-03-08 11:14:00,616 INFO  L226             Difference]: Without dead ends: 190
[2025-03-08 11:14:00,617 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240
[2025-03-08 11:14:00,618 INFO  L435           NwaCegarLoop]: 142 mSDtfsCounter, 396 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:00,620 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 668 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 11:14:00,621 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 190 states.
[2025-03-08 11:14:00,629 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 118.
[2025-03-08 11:14:00,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 118 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41)
[2025-03-08 11:14:00,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 185 transitions.
[2025-03-08 11:14:00,631 INFO  L78                 Accepts]: Start accepts. Automaton has 118 states and 185 transitions. Word has length 251
[2025-03-08 11:14:00,632 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:00,632 INFO  L471      AbstractCegarLoop]: Abstraction has 118 states and 185 transitions.
[2025-03-08 11:14:00,632 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:00,632 INFO  L276                IsEmpty]: Start isEmpty. Operand 118 states and 185 transitions.
[2025-03-08 11:14:00,634 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2025-03-08 11:14:00,635 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:00,635 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:00,635 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 11:14:00,635 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:00,636 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:00,636 INFO  L85        PathProgramCache]: Analyzing trace with hash -858622055, now seen corresponding path program 1 times
[2025-03-08 11:14:00,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:00,636 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712451598]
[2025-03-08 11:14:00,636 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:00,636 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:00,645 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-03-08 11:14:00,677 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-03-08 11:14:00,678 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:00,678 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:00,851 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:00,852 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:00,852 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712451598]
[2025-03-08 11:14:00,852 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712451598] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:00,852 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:00,852 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 11:14:00,852 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270668817]
[2025-03-08 11:14:00,852 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:00,853 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 11:14:00,853 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:00,853 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 11:14:00,853 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:14:00,854 INFO  L87              Difference]: Start difference. First operand 118 states and 185 transitions. Second operand  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:00,922 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:00,923 INFO  L93              Difference]: Finished difference Result 265 states and 411 transitions.
[2025-03-08 11:14:00,923 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 11:14:00,923 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 251
[2025-03-08 11:14:00,924 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:00,925 INFO  L225             Difference]: With dead ends: 265
[2025-03-08 11:14:00,925 INFO  L226             Difference]: Without dead ends: 150
[2025-03-08 11:14:00,926 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:14:00,926 INFO  L435           NwaCegarLoop]: 171 mSDtfsCounter, 42 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:00,926 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 476 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 11:14:00,927 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2025-03-08 11:14:00,938 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147.
[2025-03-08 11:14:00,939 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 147 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 100 states have internal predecessors, (134), 45 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45)
[2025-03-08 11:14:00,939 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 224 transitions.
[2025-03-08 11:14:00,940 INFO  L78                 Accepts]: Start accepts. Automaton has 147 states and 224 transitions. Word has length 251
[2025-03-08 11:14:00,940 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:00,941 INFO  L471      AbstractCegarLoop]: Abstraction has 147 states and 224 transitions.
[2025-03-08 11:14:00,941 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:00,941 INFO  L276                IsEmpty]: Start isEmpty. Operand 147 states and 224 transitions.
[2025-03-08 11:14:00,943 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2025-03-08 11:14:00,943 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:00,943 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:00,943 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 11:14:00,944 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:00,944 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:00,944 INFO  L85        PathProgramCache]: Analyzing trace with hash 1835907387, now seen corresponding path program 1 times
[2025-03-08 11:14:00,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:00,944 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915447577]
[2025-03-08 11:14:00,944 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:00,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:00,952 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-03-08 11:14:01,024 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-03-08 11:14:01,024 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:01,024 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:07,461 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:07,462 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:07,462 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915447577]
[2025-03-08 11:14:07,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915447577] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:07,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:07,462 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 11:14:07,462 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000601002]
[2025-03-08 11:14:07,462 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:07,464 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 11:14:07,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:07,465 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 11:14:07,465 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2025-03-08 11:14:07,466 INFO  L87              Difference]: Start difference. First operand 147 states and 224 transitions. Second operand  has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:08,964 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:08,964 INFO  L93              Difference]: Finished difference Result 331 states and 497 transitions.
[2025-03-08 11:14:08,965 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 11:14:08,965 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 251
[2025-03-08 11:14:08,966 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:08,968 INFO  L225             Difference]: With dead ends: 331
[2025-03-08 11:14:08,968 INFO  L226             Difference]: Without dead ends: 187
[2025-03-08 11:14:08,969 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182
[2025-03-08 11:14:08,969 INFO  L435           NwaCegarLoop]: 145 mSDtfsCounter, 169 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:08,969 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 672 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 11:14:08,971 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 187 states.
[2025-03-08 11:14:08,989 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 147.
[2025-03-08 11:14:08,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 147 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 100 states have internal predecessors, (134), 45 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45)
[2025-03-08 11:14:08,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 224 transitions.
[2025-03-08 11:14:08,995 INFO  L78                 Accepts]: Start accepts. Automaton has 147 states and 224 transitions. Word has length 251
[2025-03-08 11:14:08,996 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:08,996 INFO  L471      AbstractCegarLoop]: Abstraction has 147 states and 224 transitions.
[2025-03-08 11:14:08,996 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:08,996 INFO  L276                IsEmpty]: Start isEmpty. Operand 147 states and 224 transitions.
[2025-03-08 11:14:08,998 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2025-03-08 11:14:08,998 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:08,998 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:08,998 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 11:14:08,998 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:08,999 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:08,999 INFO  L85        PathProgramCache]: Analyzing trace with hash -533025831, now seen corresponding path program 1 times
[2025-03-08 11:14:08,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:08,999 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711582889]
[2025-03-08 11:14:08,999 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:08,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:09,012 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-03-08 11:14:09,048 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-03-08 11:14:09,048 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:09,048 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:09,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:09,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:09,514 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711582889]
[2025-03-08 11:14:09,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711582889] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:09,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:09,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 11:14:09,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981928061]
[2025-03-08 11:14:09,515 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:09,515 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 11:14:09,515 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:09,516 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 11:14:09,517 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 11:14:09,517 INFO  L87              Difference]: Start difference. First operand 147 states and 224 transitions. Second operand  has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:09,987 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:09,987 INFO  L93              Difference]: Finished difference Result 424 states and 651 transitions.
[2025-03-08 11:14:09,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 11:14:09,988 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 251
[2025-03-08 11:14:09,989 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:09,990 INFO  L225             Difference]: With dead ends: 424
[2025-03-08 11:14:09,990 INFO  L226             Difference]: Without dead ends: 280
[2025-03-08 11:14:09,991 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2025-03-08 11:14:09,993 INFO  L435           NwaCegarLoop]: 154 mSDtfsCounter, 136 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:09,993 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 656 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 11:14:09,994 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 280 states.
[2025-03-08 11:14:10,029 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 232.
[2025-03-08 11:14:10,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 232 states, 142 states have (on average 1.323943661971831) internal successors, (188), 143 states have internal predecessors, (188), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86)
[2025-03-08 11:14:10,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions.
[2025-03-08 11:14:10,032 INFO  L78                 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 251
[2025-03-08 11:14:10,032 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:10,032 INFO  L471      AbstractCegarLoop]: Abstraction has 232 states and 360 transitions.
[2025-03-08 11:14:10,033 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:10,033 INFO  L276                IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions.
[2025-03-08 11:14:10,034 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-08 11:14:10,035 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:10,035 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:10,035 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 11:14:10,035 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:10,035 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:10,035 INFO  L85        PathProgramCache]: Analyzing trace with hash 661926613, now seen corresponding path program 1 times
[2025-03-08 11:14:10,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:10,036 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469984830]
[2025-03-08 11:14:10,036 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:10,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:10,048 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-08 11:14:10,107 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-08 11:14:10,108 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:10,108 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:13,260 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:13,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:13,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469984830]
[2025-03-08 11:14:13,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469984830] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:13,261 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:13,261 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-08 11:14:13,261 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851110889]
[2025-03-08 11:14:13,261 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:13,262 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-08 11:14:13,262 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:13,263 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-08 11:14:13,263 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-03-08 11:14:13,263 INFO  L87              Difference]: Start difference. First operand 232 states and 360 transitions. Second operand  has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:14,264 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:14,264 INFO  L93              Difference]: Finished difference Result 576 states and 859 transitions.
[2025-03-08 11:14:14,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 11:14:14,265 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252
[2025-03-08 11:14:14,265 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:14,268 INFO  L225             Difference]: With dead ends: 576
[2025-03-08 11:14:14,268 INFO  L226             Difference]: Without dead ends: 432
[2025-03-08 11:14:14,269 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420
[2025-03-08 11:14:14,270 INFO  L435           NwaCegarLoop]: 145 mSDtfsCounter, 520 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:14,271 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 853 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 11:14:14,271 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 432 states.
[2025-03-08 11:14:14,299 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 237.
[2025-03-08 11:14:14,300 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 237 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 148 states have internal predecessors, (196), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86)
[2025-03-08 11:14:14,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 368 transitions.
[2025-03-08 11:14:14,302 INFO  L78                 Accepts]: Start accepts. Automaton has 237 states and 368 transitions. Word has length 252
[2025-03-08 11:14:14,302 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:14,303 INFO  L471      AbstractCegarLoop]: Abstraction has 237 states and 368 transitions.
[2025-03-08 11:14:14,303 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:14,303 INFO  L276                IsEmpty]: Start isEmpty. Operand 237 states and 368 transitions.
[2025-03-08 11:14:14,306 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-08 11:14:14,306 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:14,306 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:14,306 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 11:14:14,307 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:14,307 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:14,307 INFO  L85        PathProgramCache]: Analyzing trace with hash 465413108, now seen corresponding path program 1 times
[2025-03-08 11:14:14,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:14,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875100500]
[2025-03-08 11:14:14,307 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:14,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:14,317 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-08 11:14:14,376 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-08 11:14:14,376 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:14,376 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:18,534 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:18,534 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:18,534 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875100500]
[2025-03-08 11:14:18,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875100500] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:18,535 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:18,535 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-08 11:14:18,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627446296]
[2025-03-08 11:14:18,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:18,535 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-08 11:14:18,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:18,535 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-08 11:14:18,536 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156
[2025-03-08 11:14:18,536 INFO  L87              Difference]: Start difference. First operand 237 states and 368 transitions. Second operand  has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41)
[2025-03-08 11:14:20,186 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:20,186 INFO  L93              Difference]: Finished difference Result 544 states and 815 transitions.
[2025-03-08 11:14:20,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-08 11:14:20,187 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 252
[2025-03-08 11:14:20,187 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:20,189 INFO  L225             Difference]: With dead ends: 544
[2025-03-08 11:14:20,189 INFO  L226             Difference]: Without dead ends: 400
[2025-03-08 11:14:20,190 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552
[2025-03-08 11:14:20,191 INFO  L435           NwaCegarLoop]: 168 mSDtfsCounter, 396 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:20,191 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1164 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 11:14:20,192 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 400 states.
[2025-03-08 11:14:20,211 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 245.
[2025-03-08 11:14:20,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 245 states, 155 states have (on average 1.335483870967742) internal successors, (207), 156 states have internal predecessors, (207), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86)
[2025-03-08 11:14:20,214 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 379 transitions.
[2025-03-08 11:14:20,215 INFO  L78                 Accepts]: Start accepts. Automaton has 245 states and 379 transitions. Word has length 252
[2025-03-08 11:14:20,215 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:20,215 INFO  L471      AbstractCegarLoop]: Abstraction has 245 states and 379 transitions.
[2025-03-08 11:14:20,215 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41)
[2025-03-08 11:14:20,215 INFO  L276                IsEmpty]: Start isEmpty. Operand 245 states and 379 transitions.
[2025-03-08 11:14:20,217 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-08 11:14:20,217 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:20,217 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:20,217 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 11:14:20,218 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:20,218 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:20,218 INFO  L85        PathProgramCache]: Analyzing trace with hash -1135024746, now seen corresponding path program 1 times
[2025-03-08 11:14:20,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:20,218 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519642455]
[2025-03-08 11:14:20,218 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:20,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:20,227 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-08 11:14:20,286 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-08 11:14:20,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:20,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:24,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:24,543 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:24,543 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519642455]
[2025-03-08 11:14:24,543 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519642455] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:24,543 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:24,543 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-08 11:14:24,543 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940456117]
[2025-03-08 11:14:24,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:24,544 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 11:14:24,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:24,544 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 11:14:24,544 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2025-03-08 11:14:24,544 INFO  L87              Difference]: Start difference. First operand 245 states and 379 transitions. Second operand  has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:25,821 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:25,821 INFO  L93              Difference]: Finished difference Result 539 states and 808 transitions.
[2025-03-08 11:14:25,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 11:14:25,822 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252
[2025-03-08 11:14:25,822 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:25,824 INFO  L225             Difference]: With dead ends: 539
[2025-03-08 11:14:25,824 INFO  L226             Difference]: Without dead ends: 395
[2025-03-08 11:14:25,825 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506
[2025-03-08 11:14:25,825 INFO  L435           NwaCegarLoop]: 145 mSDtfsCounter, 415 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:25,826 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 849 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 11:14:25,826 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 395 states.
[2025-03-08 11:14:25,843 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 246.
[2025-03-08 11:14:25,844 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 246 states, 156 states have (on average 1.3397435897435896) internal successors, (209), 157 states have internal predecessors, (209), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86)
[2025-03-08 11:14:25,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 381 transitions.
[2025-03-08 11:14:25,846 INFO  L78                 Accepts]: Start accepts. Automaton has 246 states and 381 transitions. Word has length 252
[2025-03-08 11:14:25,847 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:25,847 INFO  L471      AbstractCegarLoop]: Abstraction has 246 states and 381 transitions.
[2025-03-08 11:14:25,847 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:25,847 INFO  L276                IsEmpty]: Start isEmpty. Operand 246 states and 381 transitions.
[2025-03-08 11:14:25,848 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-08 11:14:25,849 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:25,849 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:25,849 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 11:14:25,849 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:25,849 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:25,850 INFO  L85        PathProgramCache]: Analyzing trace with hash -1331538251, now seen corresponding path program 1 times
[2025-03-08 11:14:25,850 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:25,850 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175593211]
[2025-03-08 11:14:25,850 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:25,850 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:25,860 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-08 11:14:25,886 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-08 11:14:25,886 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:25,886 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:30,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:30,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:30,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175593211]
[2025-03-08 11:14:30,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175593211] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:30,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:30,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-08 11:14:30,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219518939]
[2025-03-08 11:14:30,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:30,342 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 11:14:30,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:30,342 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 11:14:30,343 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2025-03-08 11:14:30,343 INFO  L87              Difference]: Start difference. First operand 246 states and 381 transitions. Second operand  has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41)
[2025-03-08 11:14:31,819 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:31,819 INFO  L93              Difference]: Finished difference Result 516 states and 776 transitions.
[2025-03-08 11:14:31,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 11:14:31,820 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41) Word has length 252
[2025-03-08 11:14:31,820 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:31,822 INFO  L225             Difference]: With dead ends: 516
[2025-03-08 11:14:31,822 INFO  L226             Difference]: Without dead ends: 372
[2025-03-08 11:14:31,823 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420
[2025-03-08 11:14:31,823 INFO  L435           NwaCegarLoop]: 168 mSDtfsCounter, 387 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:31,823 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 837 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 11:14:31,824 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 372 states.
[2025-03-08 11:14:31,840 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 245.
[2025-03-08 11:14:31,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 245 states, 155 states have (on average 1.335483870967742) internal successors, (207), 156 states have internal predecessors, (207), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86)
[2025-03-08 11:14:31,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 379 transitions.
[2025-03-08 11:14:31,844 INFO  L78                 Accepts]: Start accepts. Automaton has 245 states and 379 transitions. Word has length 252
[2025-03-08 11:14:31,844 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:31,844 INFO  L471      AbstractCegarLoop]: Abstraction has 245 states and 379 transitions.
[2025-03-08 11:14:31,844 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 2 states have call successors, (41)
[2025-03-08 11:14:31,844 INFO  L276                IsEmpty]: Start isEmpty. Operand 245 states and 379 transitions.
[2025-03-08 11:14:31,845 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-08 11:14:31,845 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:31,845 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:31,845 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 11:14:31,845 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:31,846 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:31,846 INFO  L85        PathProgramCache]: Analyzing trace with hash 156367988, now seen corresponding path program 1 times
[2025-03-08 11:14:31,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:31,846 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179576164]
[2025-03-08 11:14:31,846 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:31,846 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:31,854 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-08 11:14:31,904 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-08 11:14:31,904 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:31,904 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:35,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:35,886 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:35,886 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179576164]
[2025-03-08 11:14:35,886 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179576164] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:35,886 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:35,886 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 11:14:35,886 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055161870]
[2025-03-08 11:14:35,886 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:35,887 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 11:14:35,887 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:35,887 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 11:14:35,887 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2025-03-08 11:14:35,887 INFO  L87              Difference]: Start difference. First operand 245 states and 379 transitions. Second operand  has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:36,641 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:36,641 INFO  L93              Difference]: Finished difference Result 538 states and 808 transitions.
[2025-03-08 11:14:36,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 11:14:36,642 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252
[2025-03-08 11:14:36,643 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:36,645 INFO  L225             Difference]: With dead ends: 538
[2025-03-08 11:14:36,645 INFO  L226             Difference]: Without dead ends: 394
[2025-03-08 11:14:36,646 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182
[2025-03-08 11:14:36,646 INFO  L435           NwaCegarLoop]: 143 mSDtfsCounter, 235 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:36,646 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 789 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 11:14:36,647 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 394 states.
[2025-03-08 11:14:36,667 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 252.
[2025-03-08 11:14:36,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 252 states, 162 states have (on average 1.345679012345679) internal successors, (218), 163 states have internal predecessors, (218), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86)
[2025-03-08 11:14:36,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 390 transitions.
[2025-03-08 11:14:36,669 INFO  L78                 Accepts]: Start accepts. Automaton has 252 states and 390 transitions. Word has length 252
[2025-03-08 11:14:36,670 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:36,670 INFO  L471      AbstractCegarLoop]: Abstraction has 252 states and 390 transitions.
[2025-03-08 11:14:36,670 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:36,670 INFO  L276                IsEmpty]: Start isEmpty. Operand 252 states and 390 transitions.
[2025-03-08 11:14:36,671 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-08 11:14:36,671 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:36,671 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:36,671 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 11:14:36,672 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:36,672 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:36,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -40145517, now seen corresponding path program 1 times
[2025-03-08 11:14:36,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:36,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312466933]
[2025-03-08 11:14:36,672 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:36,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:36,679 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-08 11:14:36,695 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-08 11:14:36,695 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:36,695 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:37,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:37,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:37,278 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312466933]
[2025-03-08 11:14:37,278 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312466933] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:37,278 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:37,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 11:14:37,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169745743]
[2025-03-08 11:14:37,278 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:37,278 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 11:14:37,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:37,279 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 11:14:37,279 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-08 11:14:37,279 INFO  L87              Difference]: Start difference. First operand 252 states and 390 transitions. Second operand  has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:38,071 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:38,072 INFO  L93              Difference]: Finished difference Result 501 states and 756 transitions.
[2025-03-08 11:14:38,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 11:14:38,072 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252
[2025-03-08 11:14:38,073 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:38,075 INFO  L225             Difference]: With dead ends: 501
[2025-03-08 11:14:38,075 INFO  L226             Difference]: Without dead ends: 352
[2025-03-08 11:14:38,076 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182
[2025-03-08 11:14:38,076 INFO  L435           NwaCegarLoop]: 153 mSDtfsCounter, 276 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:38,077 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 627 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 11:14:38,077 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 352 states.
[2025-03-08 11:14:38,099 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 253.
[2025-03-08 11:14:38,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 253 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 164 states have internal predecessors, (220), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86)
[2025-03-08 11:14:38,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 392 transitions.
[2025-03-08 11:14:38,102 INFO  L78                 Accepts]: Start accepts. Automaton has 253 states and 392 transitions. Word has length 252
[2025-03-08 11:14:38,103 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:38,103 INFO  L471      AbstractCegarLoop]: Abstraction has 253 states and 392 transitions.
[2025-03-08 11:14:38,103 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:38,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 253 states and 392 transitions.
[2025-03-08 11:14:38,104 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-08 11:14:38,104 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:38,104 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:38,105 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 11:14:38,105 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:38,105 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:38,105 INFO  L85        PathProgramCache]: Analyzing trace with hash -1640583371, now seen corresponding path program 1 times
[2025-03-08 11:14:38,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:38,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626477567]
[2025-03-08 11:14:38,105 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:38,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:38,113 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-08 11:14:38,149 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-08 11:14:38,149 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:38,149 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:41,484 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:41,484 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:41,484 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626477567]
[2025-03-08 11:14:41,484 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626477567] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:41,484 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:41,484 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 11:14:41,484 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104173400]
[2025-03-08 11:14:41,484 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:41,485 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 11:14:41,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:41,485 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 11:14:41,485 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2025-03-08 11:14:41,485 INFO  L87              Difference]: Start difference. First operand 253 states and 392 transitions. Second operand  has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:41,876 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:41,876 INFO  L93              Difference]: Finished difference Result 491 states and 745 transitions.
[2025-03-08 11:14:41,877 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 11:14:41,878 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252
[2025-03-08 11:14:41,878 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:41,880 INFO  L225             Difference]: With dead ends: 491
[2025-03-08 11:14:41,880 INFO  L226             Difference]: Without dead ends: 342
[2025-03-08 11:14:41,881 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90
[2025-03-08 11:14:41,881 INFO  L435           NwaCegarLoop]: 148 mSDtfsCounter, 299 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:41,882 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 573 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 11:14:41,882 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 342 states.
[2025-03-08 11:14:41,900 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 250.
[2025-03-08 11:14:41,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 250 states, 160 states have (on average 1.35) internal successors, (216), 161 states have internal predecessors, (216), 86 states have call successors, (86), 3 states have call predecessors, (86), 3 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86)
[2025-03-08 11:14:41,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 388 transitions.
[2025-03-08 11:14:41,902 INFO  L78                 Accepts]: Start accepts. Automaton has 250 states and 388 transitions. Word has length 252
[2025-03-08 11:14:41,903 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:41,903 INFO  L471      AbstractCegarLoop]: Abstraction has 250 states and 388 transitions.
[2025-03-08 11:14:41,903 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:41,903 INFO  L276                IsEmpty]: Start isEmpty. Operand 250 states and 388 transitions.
[2025-03-08 11:14:41,904 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-08 11:14:41,904 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:41,904 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:41,904 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 11:14:41,904 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:41,905 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:41,905 INFO  L85        PathProgramCache]: Analyzing trace with hash -2125488874, now seen corresponding path program 1 times
[2025-03-08 11:14:41,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:41,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279330631]
[2025-03-08 11:14:41,905 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:41,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:41,912 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-08 11:14:41,928 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-08 11:14:41,928 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:41,928 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:42,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:42,038 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:42,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279330631]
[2025-03-08 11:14:42,038 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279330631] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:42,038 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:42,038 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 11:14:42,038 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555290499]
[2025-03-08 11:14:42,038 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:42,038 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 11:14:42,038 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:42,039 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 11:14:42,039 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:14:42,039 INFO  L87              Difference]: Start difference. First operand 250 states and 388 transitions. Second operand  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:42,102 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:42,102 INFO  L93              Difference]: Finished difference Result 430 states and 655 transitions.
[2025-03-08 11:14:42,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 11:14:42,102 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252
[2025-03-08 11:14:42,103 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:42,105 INFO  L225             Difference]: With dead ends: 430
[2025-03-08 11:14:42,105 INFO  L226             Difference]: Without dead ends: 281
[2025-03-08 11:14:42,105 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 11:14:42,105 INFO  L435           NwaCegarLoop]: 175 mSDtfsCounter, 61 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:42,106 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 481 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 11:14:42,106 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 281 states.
[2025-03-08 11:14:42,123 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 237.
[2025-03-08 11:14:42,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 237 states, 150 states have (on average 1.3466666666666667) internal successors, (202), 150 states have internal predecessors, (202), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82)
[2025-03-08 11:14:42,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 366 transitions.
[2025-03-08 11:14:42,125 INFO  L78                 Accepts]: Start accepts. Automaton has 237 states and 366 transitions. Word has length 252
[2025-03-08 11:14:42,126 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:42,126 INFO  L471      AbstractCegarLoop]: Abstraction has 237 states and 366 transitions.
[2025-03-08 11:14:42,126 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:42,126 INFO  L276                IsEmpty]: Start isEmpty. Operand 237 states and 366 transitions.
[2025-03-08 11:14:42,127 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-08 11:14:42,127 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:42,128 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:42,128 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 11:14:42,128 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:42,128 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:42,128 INFO  L85        PathProgramCache]: Analyzing trace with hash 1972964917, now seen corresponding path program 1 times
[2025-03-08 11:14:42,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:42,129 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209088386]
[2025-03-08 11:14:42,129 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:42,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:42,136 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-08 11:14:42,179 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-08 11:14:42,180 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:42,180 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:47,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:47,794 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:47,794 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209088386]
[2025-03-08 11:14:47,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209088386] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:47,794 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:47,794 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-08 11:14:47,794 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436429559]
[2025-03-08 11:14:47,794 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:47,795 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-08 11:14:47,795 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:47,795 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-08 11:14:47,795 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2025-03-08 11:14:47,795 INFO  L87              Difference]: Start difference. First operand 237 states and 366 transitions. Second operand  has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41)
[2025-03-08 11:14:49,496 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:49,496 INFO  L93              Difference]: Finished difference Result 456 states and 684 transitions.
[2025-03-08 11:14:49,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 11:14:49,497 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 252
[2025-03-08 11:14:49,498 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:49,500 INFO  L225             Difference]: With dead ends: 456
[2025-03-08 11:14:49,500 INFO  L226             Difference]: Without dead ends: 322
[2025-03-08 11:14:49,501 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552
[2025-03-08 11:14:49,501 INFO  L435           NwaCegarLoop]: 163 mSDtfsCounter, 389 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:49,502 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 934 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 11:14:49,503 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 322 states.
[2025-03-08 11:14:49,520 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 241.
[2025-03-08 11:14:49,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 241 states, 154 states have (on average 1.344155844155844) internal successors, (207), 154 states have internal predecessors, (207), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82)
[2025-03-08 11:14:49,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 371 transitions.
[2025-03-08 11:14:49,523 INFO  L78                 Accepts]: Start accepts. Automaton has 241 states and 371 transitions. Word has length 252
[2025-03-08 11:14:49,523 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:49,523 INFO  L471      AbstractCegarLoop]: Abstraction has 241 states and 371 transitions.
[2025-03-08 11:14:49,523 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41)
[2025-03-08 11:14:49,523 INFO  L276                IsEmpty]: Start isEmpty. Operand 241 states and 371 transitions.
[2025-03-08 11:14:49,524 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-08 11:14:49,524 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:49,524 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:49,524 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 11:14:49,525 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:49,525 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:49,525 INFO  L85        PathProgramCache]: Analyzing trace with hash 176013558, now seen corresponding path program 1 times
[2025-03-08 11:14:49,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:49,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199033492]
[2025-03-08 11:14:49,525 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:49,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:49,533 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-08 11:14:49,560 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-08 11:14:49,561 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:49,561 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 11:14:55,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked.
[2025-03-08 11:14:55,271 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 11:14:55,271 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199033492]
[2025-03-08 11:14:55,271 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199033492] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 11:14:55,271 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 11:14:55,271 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 11:14:55,271 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627763387]
[2025-03-08 11:14:55,271 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 11:14:55,271 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 11:14:55,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 11:14:55,272 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 11:14:55,272 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2025-03-08 11:14:55,272 INFO  L87              Difference]: Start difference. First operand 241 states and 371 transitions. Second operand  has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:56,068 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 11:14:56,068 INFO  L93              Difference]: Finished difference Result 423 states and 642 transitions.
[2025-03-08 11:14:56,069 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 11:14:56,069 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 252
[2025-03-08 11:14:56,069 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 11:14:56,071 INFO  L225             Difference]: With dead ends: 423
[2025-03-08 11:14:56,071 INFO  L226             Difference]: Without dead ends: 289
[2025-03-08 11:14:56,072 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240
[2025-03-08 11:14:56,072 INFO  L435           NwaCegarLoop]: 167 mSDtfsCounter, 136 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 11:14:56,072 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 609 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 11:14:56,073 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 289 states.
[2025-03-08 11:14:56,090 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 239.
[2025-03-08 11:14:56,090 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 239 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 152 states have internal predecessors, (205), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82)
[2025-03-08 11:14:56,091 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 369 transitions.
[2025-03-08 11:14:56,092 INFO  L78                 Accepts]: Start accepts. Automaton has 239 states and 369 transitions. Word has length 252
[2025-03-08 11:14:56,092 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 11:14:56,092 INFO  L471      AbstractCegarLoop]: Abstraction has 239 states and 369 transitions.
[2025-03-08 11:14:56,092 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41)
[2025-03-08 11:14:56,092 INFO  L276                IsEmpty]: Start isEmpty. Operand 239 states and 369 transitions.
[2025-03-08 11:14:56,093 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-03-08 11:14:56,093 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 11:14:56,093 INFO  L218           NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 11:14:56,094 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 11:14:56,094 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 11:14:56,094 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 11:14:56,094 INFO  L85        PathProgramCache]: Analyzing trace with hash -1457555976, now seen corresponding path program 1 times
[2025-03-08 11:14:56,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 11:14:56,094 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815971945]
[2025-03-08 11:14:56,094 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 11:14:56,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 11:14:56,101 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-03-08 11:14:56,112 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-03-08 11:14:56,112 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 11:14:56,112 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat