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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.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 6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 19:19:13,900 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 19:19:13,948 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 19:19:13,952 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 19:19:13,952 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 19:19:13,965 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 19:19:13,966 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 19:19:13,966 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 19:19:13,967 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 19:19:13,967 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 19:19:13,967 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 19:19:13,967 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 19:19:13,967 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 19:19:13,967 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 19:19:13,967 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 19:19:13,967 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 19:19:13,967 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 19:19:13,968 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 19:19:13,968 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 19:19:13,968 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 19:19:13,968 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 19:19:13,968 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 19:19:13,970 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 19:19:13,970 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 19:19:13,970 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 19:19:13,970 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 19:19:13,970 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 19:19:13,970 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 19:19:13,970 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 19:19:13,970 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 19:19:13,970 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 19:19:13,970 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 19:19:13,971 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 19:19:13,971 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 19:19:13,971 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 19:19:13,971 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 19:19:13,971 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 19:19:13,971 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 19:19:13,971 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 19:19:13,971 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 19:19:13,971 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 19:19:13,971 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 19:19:13,971 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 19:19:13,971 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 -> 6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661
[2025-03-03 19:19:14,177 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 19:19:14,185 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 19:19:14,187 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 19:19:14,188 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 19:19:14,188 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 19:19:14,189 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i
[2025-03-03 19:19:15,367 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0eb3fd8/0aaeb758369b4720ae48e650f709472b/FLAGdb6db417d
[2025-03-03 19:19:15,608 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 19:19:15,609 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i
[2025-03-03 19:19:15,615 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0eb3fd8/0aaeb758369b4720ae48e650f709472b/FLAGdb6db417d
[2025-03-03 19:19:15,946 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0eb3fd8/0aaeb758369b4720ae48e650f709472b
[2025-03-03 19:19:15,948 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 19:19:15,949 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 19:19:15,950 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 19:19:15,950 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 19:19:15,953 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 19:19:15,953 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:19:15" (1/1) ...
[2025-03-03 19:19:15,954 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@615463fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:15, skipping insertion in model container
[2025-03-03 19:19:15,954 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:19:15" (1/1) ...
[2025-03-03 19:19:15,967 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 19:19:16,061 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_normal_file-86.i[913,926]
[2025-03-03 19:19:16,108 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 19:19:16,119 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 19:19:16,127 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_normal_file-86.i[913,926]
[2025-03-03 19:19:16,156 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 19:19:16,174 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 19:19:16,175 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16 WrapperNode
[2025-03-03 19:19:16,175 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 19:19:16,176 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 19:19:16,176 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 19:19:16,176 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 19:19:16,180 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (1/1) ...
[2025-03-03 19:19:16,190 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (1/1) ...
[2025-03-03 19:19:16,220 INFO  L138                Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124
[2025-03-03 19:19:16,222 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 19:19:16,223 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 19:19:16,223 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 19:19:16,223 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 19:19:16,230 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (1/1) ...
[2025-03-03 19:19:16,230 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (1/1) ...
[2025-03-03 19:19:16,234 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (1/1) ...
[2025-03-03 19:19:16,251 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 19:19:16,251 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (1/1) ...
[2025-03-03 19:19:16,252 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (1/1) ...
[2025-03-03 19:19:16,262 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (1/1) ...
[2025-03-03 19:19:16,267 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (1/1) ...
[2025-03-03 19:19:16,268 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (1/1) ...
[2025-03-03 19:19:16,269 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (1/1) ...
[2025-03-03 19:19:16,273 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 19:19:16,274 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 19:19:16,274 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 19:19:16,274 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 19:19:16,279 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (1/1) ...
[2025-03-03 19:19:16,283 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 19:19:16,294 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:19:16,321 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 19:19:16,324 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 19:19:16,341 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 19:19:16,341 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 19:19:16,341 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 19:19:16,341 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 19:19:16,341 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 19:19:16,341 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 19:19:16,392 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 19:19:16,393 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 19:19:16,634 INFO  L?                        ?]: Removed 20 outVars from TransFormulas that were not future-live.
[2025-03-03 19:19:16,635 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 19:19:16,643 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 19:19:16,644 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 19:19:16,644 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:19:16 BoogieIcfgContainer
[2025-03-03 19:19:16,644 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 19:19:16,646 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 19:19:16,646 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 19:19:16,653 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 19:19:16,653 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:19:15" (1/3) ...
[2025-03-03 19:19:16,653 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2290410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:19:16, skipping insertion in model container
[2025-03-03 19:19:16,653 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:19:16" (2/3) ...
[2025-03-03 19:19:16,654 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2290410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:19:16, skipping insertion in model container
[2025-03-03 19:19:16,654 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:19:16" (3/3) ...
[2025-03-03 19:19:16,655 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-86.i
[2025-03-03 19:19:16,665 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 19:19:16,666 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-86.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 19:19:16,705 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 19:19:16,717 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;@7a923e98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 19:19:16,718 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 19:19:16,721 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2025-03-03 19:19:16,729 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2025-03-03 19:19:16,729 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:19:16,730 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:19:16,730 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:19:16,734 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:19:16,735 INFO  L85        PathProgramCache]: Analyzing trace with hash -24679608, now seen corresponding path program 1 times
[2025-03-03 19:19:16,740 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:19:16,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690786701]
[2025-03-03 19:19:16,741 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:19:16,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:19:16,810 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.
[2025-03-03 19:19:16,831 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements.
[2025-03-03 19:19:16,832 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:19:16,832 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:19:16,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked.
[2025-03-03 19:19:16,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:19:16,947 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690786701]
[2025-03-03 19:19:16,948 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690786701] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 19:19:16,948 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405960262]
[2025-03-03 19:19:16,948 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:19:16,949 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 19:19:16,949 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:19:16,952 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 19:19:16,953 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 19:19:17,008 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.
[2025-03-03 19:19:17,064 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements.
[2025-03-03 19:19:17,064 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:19:17,064 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:19:17,066 INFO  L256         TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 19:19:17,071 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:19:17,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked.
[2025-03-03 19:19:17,093 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 19:19:17,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [405960262] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:19:17,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 19:19:17,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-03 19:19:17,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064143192]
[2025-03-03 19:19:17,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:19:17,098 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 19:19:17,098 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:19:17,109 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 19:19:17,110 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 19:19:17,111 INFO  L87              Difference]: Start difference. First operand  has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand  has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15)
[2025-03-03 19:19:17,125 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:19:17,125 INFO  L93              Difference]: Finished difference Result 102 states and 170 transitions.
[2025-03-03 19:19:17,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 19:19:17,127 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101
[2025-03-03 19:19:17,127 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:19:17,134 INFO  L225             Difference]: With dead ends: 102
[2025-03-03 19:19:17,134 INFO  L226             Difference]: Without dead ends: 51
[2025-03-03 19:19:17,136 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-03 19:19:17,140 INFO  L435           NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:19:17,141 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:19:17,151 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2025-03-03 19:19:17,166 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2025-03-03 19:19:17,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2025-03-03 19:19:17,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions.
[2025-03-03 19:19:17,171 INFO  L78                 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 101
[2025-03-03 19:19:17,171 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:19:17,171 INFO  L471      AbstractCegarLoop]: Abstraction has 51 states and 75 transitions.
[2025-03-03 19:19:17,171 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15)
[2025-03-03 19:19:17,171 INFO  L276                IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions.
[2025-03-03 19:19:17,174 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2025-03-03 19:19:17,174 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:19:17,174 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:19:17,181 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-03 19:19:17,374 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-03 19:19:17,375 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:19:17,375 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:19:17,376 INFO  L85        PathProgramCache]: Analyzing trace with hash 1543714601, now seen corresponding path program 1 times
[2025-03-03 19:19:17,376 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:19:17,376 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210790066]
[2025-03-03 19:19:17,376 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:19:17,376 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:19:17,392 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.
[2025-03-03 19:19:17,439 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements.
[2025-03-03 19:19:17,441 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:19:17,441 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:19:17,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-03 19:19:17,696 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:19:17,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210790066]
[2025-03-03 19:19:17,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210790066] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:19:17,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:19:17,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 19:19:17,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710660911]
[2025-03-03 19:19:17,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:19:17,698 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 19:19:17,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:19:17,699 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 19:19:17,699 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:19:17,700 INFO  L87              Difference]: Start difference. First operand 51 states and 75 transitions. Second operand  has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:17,854 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:19:17,855 INFO  L93              Difference]: Finished difference Result 148 states and 220 transitions.
[2025-03-03 19:19:17,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:19:17,856 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101
[2025-03-03 19:19:17,857 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:19:17,858 INFO  L225             Difference]: With dead ends: 148
[2025-03-03 19:19:17,858 INFO  L226             Difference]: Without dead ends: 100
[2025-03-03 19:19:17,858 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 19:19:17,859 INFO  L435           NwaCegarLoop]: 70 mSDtfsCounter, 67 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 19:19:17,859 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 240 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 19:19:17,860 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2025-03-03 19:19:17,869 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80.
[2025-03-03 19:19:17,869 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-03 19:19:17,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions.
[2025-03-03 19:19:17,871 INFO  L78                 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 101
[2025-03-03 19:19:17,871 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:19:17,871 INFO  L471      AbstractCegarLoop]: Abstraction has 80 states and 118 transitions.
[2025-03-03 19:19:17,872 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:17,873 INFO  L276                IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions.
[2025-03-03 19:19:17,875 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2025-03-03 19:19:17,875 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:19:17,875 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:19:17,875 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 19:19:17,875 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:19:17,876 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:19:17,876 INFO  L85        PathProgramCache]: Analyzing trace with hash 1038155976, now seen corresponding path program 1 times
[2025-03-03 19:19:17,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:19:17,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404237882]
[2025-03-03 19:19:17,876 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:19:17,876 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:19:17,889 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.
[2025-03-03 19:19:18,025 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements.
[2025-03-03 19:19:18,025 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:19:18,025 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:19:22,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-03 19:19:22,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:19:22,883 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404237882]
[2025-03-03 19:19:22,883 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404237882] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:19:22,883 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:19:22,883 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-03-03 19:19:22,883 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731839392]
[2025-03-03 19:19:22,883 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:19:22,884 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-03 19:19:22,884 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:19:22,884 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-03 19:19:22,884 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182
[2025-03-03 19:19:22,885 INFO  L87              Difference]: Start difference. First operand 80 states and 118 transitions. Second operand  has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:24,901 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:19:24,901 INFO  L93              Difference]: Finished difference Result 204 states and 296 transitions.
[2025-03-03 19:19:24,901 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-03 19:19:24,902 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101
[2025-03-03 19:19:24,902 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:19:24,903 INFO  L225             Difference]: With dead ends: 204
[2025-03-03 19:19:24,903 INFO  L226             Difference]: Without dead ends: 156
[2025-03-03 19:19:24,904 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650
[2025-03-03 19:19:24,905 INFO  L435           NwaCegarLoop]: 61 mSDtfsCounter, 292 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 19:19:24,905 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 387 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 19:19:24,906 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2025-03-03 19:19:24,914 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 97.
[2025-03-03 19:19:24,915 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2025-03-03 19:19:24,916 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions.
[2025-03-03 19:19:24,916 INFO  L78                 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 101
[2025-03-03 19:19:24,916 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:19:24,916 INFO  L471      AbstractCegarLoop]: Abstraction has 97 states and 141 transitions.
[2025-03-03 19:19:24,916 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:24,916 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions.
[2025-03-03 19:19:24,917 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2025-03-03 19:19:24,917 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:19:24,917 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:19:24,917 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 19:19:24,917 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:19:24,918 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:19:24,918 INFO  L85        PathProgramCache]: Analyzing trace with hash -758795383, now seen corresponding path program 1 times
[2025-03-03 19:19:24,918 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:19:24,918 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871392296]
[2025-03-03 19:19:24,918 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:19:24,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:19:24,924 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.
[2025-03-03 19:19:24,930 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements.
[2025-03-03 19:19:24,931 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:19:24,931 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:19:24,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-03 19:19:24,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:19:24,979 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871392296]
[2025-03-03 19:19:24,979 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871392296] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:19:24,980 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:19:24,980 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 19:19:24,980 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088750915]
[2025-03-03 19:19:24,981 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:19:24,981 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 19:19:24,981 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:19:24,981 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 19:19:24,982 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:19:24,982 INFO  L87              Difference]: Start difference. First operand 97 states and 141 transitions. Second operand  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:25,016 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:19:25,016 INFO  L93              Difference]: Finished difference Result 192 states and 283 transitions.
[2025-03-03 19:19:25,016 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 19:19:25,016 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101
[2025-03-03 19:19:25,017 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:19:25,018 INFO  L225             Difference]: With dead ends: 192
[2025-03-03 19:19:25,020 INFO  L226             Difference]: Without dead ends: 144
[2025-03-03 19:19:25,020 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:19:25,021 INFO  L435           NwaCegarLoop]: 89 mSDtfsCounter, 67 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:19:25,021 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 150 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:19:25,022 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 144 states.
[2025-03-03 19:19:25,030 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142.
[2025-03-03 19:19:25,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 142 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45)
[2025-03-03 19:19:25,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 207 transitions.
[2025-03-03 19:19:25,032 INFO  L78                 Accepts]: Start accepts. Automaton has 142 states and 207 transitions. Word has length 101
[2025-03-03 19:19:25,033 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:19:25,033 INFO  L471      AbstractCegarLoop]: Abstraction has 142 states and 207 transitions.
[2025-03-03 19:19:25,033 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:25,033 INFO  L276                IsEmpty]: Start isEmpty. Operand 142 states and 207 transitions.
[2025-03-03 19:19:25,034 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-03-03 19:19:25,036 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:19:25,036 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:19:25,036 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 19:19:25,036 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:19:25,036 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:19:25,036 INFO  L85        PathProgramCache]: Analyzing trace with hash -2089107076, now seen corresponding path program 1 times
[2025-03-03 19:19:25,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:19:25,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304101941]
[2025-03-03 19:19:25,037 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:19:25,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:19:25,044 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-03-03 19:19:25,086 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-03-03 19:19:25,086 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:19:25,086 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:19:33,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-03 19:19:33,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:19:33,282 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304101941]
[2025-03-03 19:19:33,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304101941] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:19:33,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:19:33,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2025-03-03 19:19:33,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970521456]
[2025-03-03 19:19:33,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:19:33,283 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-03-03 19:19:33,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:19:33,284 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-03-03 19:19:33,284 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240
[2025-03-03 19:19:33,284 INFO  L87              Difference]: Start difference. First operand 142 states and 207 transitions. Second operand  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:38,455 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:19:38,455 INFO  L93              Difference]: Finished difference Result 192 states and 265 transitions.
[2025-03-03 19:19:38,456 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-03-03 19:19:38,456 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102
[2025-03-03 19:19:38,456 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:19:38,457 INFO  L225             Difference]: With dead ends: 192
[2025-03-03 19:19:38,457 INFO  L226             Difference]: Without dead ends: 190
[2025-03-03 19:19:38,458 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992
[2025-03-03 19:19:38,458 INFO  L435           NwaCegarLoop]: 57 mSDtfsCounter, 217 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-03 19:19:38,459 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 491 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-03 19:19:38,459 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 190 states.
[2025-03-03 19:19:38,478 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 143.
[2025-03-03 19:19:38,479 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 143 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 94 states have internal predecessors, (118), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45)
[2025-03-03 19:19:38,480 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 208 transitions.
[2025-03-03 19:19:38,484 INFO  L78                 Accepts]: Start accepts. Automaton has 143 states and 208 transitions. Word has length 102
[2025-03-03 19:19:38,484 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:19:38,484 INFO  L471      AbstractCegarLoop]: Abstraction has 143 states and 208 transitions.
[2025-03-03 19:19:38,484 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:38,484 INFO  L276                IsEmpty]: Start isEmpty. Operand 143 states and 208 transitions.
[2025-03-03 19:19:38,485 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-03-03 19:19:38,485 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:19:38,485 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:19:38,485 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 19:19:38,485 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:19:38,486 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:19:38,486 INFO  L85        PathProgramCache]: Analyzing trace with hash 647069625, now seen corresponding path program 1 times
[2025-03-03 19:19:38,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:19:38,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462206255]
[2025-03-03 19:19:38,486 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:19:38,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:19:38,498 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-03-03 19:19:38,516 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-03-03 19:19:38,516 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:19:38,517 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:19:38,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-03 19:19:38,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:19:38,565 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462206255]
[2025-03-03 19:19:38,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462206255] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:19:38,565 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:19:38,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 19:19:38,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126774522]
[2025-03-03 19:19:38,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:19:38,566 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 19:19:38,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:19:38,567 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 19:19:38,567 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:19:38,567 INFO  L87              Difference]: Start difference. First operand 143 states and 208 transitions. Second operand  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:38,582 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:19:38,584 INFO  L93              Difference]: Finished difference Result 247 states and 361 transitions.
[2025-03-03 19:19:38,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 19:19:38,585 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102
[2025-03-03 19:19:38,585 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:19:38,586 INFO  L225             Difference]: With dead ends: 247
[2025-03-03 19:19:38,587 INFO  L226             Difference]: Without dead ends: 151
[2025-03-03 19:19:38,588 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:19:38,589 INFO  L435           NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:19:38,589 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:19:38,590 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2025-03-03 19:19:38,601 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143.
[2025-03-03 19:19:38,604 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 143 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45)
[2025-03-03 19:19:38,605 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions.
[2025-03-03 19:19:38,605 INFO  L78                 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 102
[2025-03-03 19:19:38,606 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:19:38,606 INFO  L471      AbstractCegarLoop]: Abstraction has 143 states and 205 transitions.
[2025-03-03 19:19:38,606 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:38,606 INFO  L276                IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions.
[2025-03-03 19:19:38,606 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-03-03 19:19:38,607 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:19:38,607 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:19:38,607 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 19:19:38,607 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:19:38,607 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:19:38,607 INFO  L85        PathProgramCache]: Analyzing trace with hash 1534573306, now seen corresponding path program 1 times
[2025-03-03 19:19:38,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:19:38,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696987267]
[2025-03-03 19:19:38,607 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:19:38,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:19:38,615 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-03-03 19:19:38,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-03-03 19:19:38,647 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:19:38,647 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:19:42,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-03 19:19:42,705 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:19:42,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696987267]
[2025-03-03 19:19:42,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696987267] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:19:42,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:19:42,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2025-03-03 19:19:42,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904496282]
[2025-03-03 19:19:42,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:19:42,706 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-03-03 19:19:42,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:19:42,706 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-03-03 19:19:42,707 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240
[2025-03-03 19:19:42,707 INFO  L87              Difference]: Start difference. First operand 143 states and 205 transitions. Second operand  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2025-03-03 19:19:45,592 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:19:45,593 INFO  L93              Difference]: Finished difference Result 193 states and 261 transitions.
[2025-03-03 19:19:45,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-03 19:19:45,593 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102
[2025-03-03 19:19:45,594 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:19:45,595 INFO  L225             Difference]: With dead ends: 193
[2025-03-03 19:19:45,595 INFO  L226             Difference]: Without dead ends: 191
[2025-03-03 19:19:45,595 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812
[2025-03-03 19:19:45,596 INFO  L435           NwaCegarLoop]: 52 mSDtfsCounter, 318 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 19:19:45,596 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 401 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 19:19:45,596 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2025-03-03 19:19:45,605 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 143.
[2025-03-03 19:19:45,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 143 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45)
[2025-03-03 19:19:45,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions.
[2025-03-03 19:19:45,607 INFO  L78                 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 102
[2025-03-03 19:19:45,607 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:19:45,607 INFO  L471      AbstractCegarLoop]: Abstraction has 143 states and 205 transitions.
[2025-03-03 19:19:45,607 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2025-03-03 19:19:45,607 INFO  L276                IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions.
[2025-03-03 19:19:45,608 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-03-03 19:19:45,608 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:19:45,608 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:19:45,608 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 19:19:45,608 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:19:45,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:19:45,609 INFO  L85        PathProgramCache]: Analyzing trace with hash 20518040, now seen corresponding path program 1 times
[2025-03-03 19:19:45,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:19:45,609 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706757344]
[2025-03-03 19:19:45,609 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:19:45,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:19:45,614 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-03-03 19:19:45,638 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-03-03 19:19:45,638 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:19:45,638 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:19:48,914 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-03 19:19:48,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:19:48,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706757344]
[2025-03-03 19:19:48,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706757344] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:19:48,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:19:48,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2025-03-03 19:19:48,915 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792436044]
[2025-03-03 19:19:48,915 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:19:48,915 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-03-03 19:19:48,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:19:48,915 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-03-03 19:19:48,915 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240
[2025-03-03 19:19:48,916 INFO  L87              Difference]: Start difference. First operand 143 states and 205 transitions. Second operand  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:50,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:19:50,300 INFO  L93              Difference]: Finished difference Result 213 states and 284 transitions.
[2025-03-03 19:19:50,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-03-03 19:19:50,301 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102
[2025-03-03 19:19:50,301 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:19:50,302 INFO  L225             Difference]: With dead ends: 213
[2025-03-03 19:19:50,302 INFO  L226             Difference]: Without dead ends: 211
[2025-03-03 19:19:50,302 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056
[2025-03-03 19:19:50,303 INFO  L435           NwaCegarLoop]: 62 mSDtfsCounter, 207 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 19:19:50,303 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 496 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 19:19:50,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2025-03-03 19:19:50,316 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 153.
[2025-03-03 19:19:50,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45)
[2025-03-03 19:19:50,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions.
[2025-03-03 19:19:50,319 INFO  L78                 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102
[2025-03-03 19:19:50,319 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:19:50,320 INFO  L471      AbstractCegarLoop]: Abstraction has 153 states and 218 transitions.
[2025-03-03 19:19:50,320 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:50,320 INFO  L276                IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions.
[2025-03-03 19:19:50,322 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-03-03 19:19:50,322 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:19:50,322 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:19:50,322 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 19:19:50,322 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:19:50,323 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:19:50,323 INFO  L85        PathProgramCache]: Analyzing trace with hash -1786936423, now seen corresponding path program 1 times
[2025-03-03 19:19:50,323 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:19:50,323 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815133831]
[2025-03-03 19:19:50,323 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:19:50,323 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:19:50,328 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-03-03 19:19:50,361 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-03-03 19:19:50,361 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:19:50,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:19:55,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-03 19:19:55,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:19:55,493 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815133831]
[2025-03-03 19:19:55,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815133831] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:19:55,493 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:19:55,494 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2025-03-03 19:19:55,494 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095304004]
[2025-03-03 19:19:55,494 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:19:55,494 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-03-03 19:19:55,494 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:19:55,494 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-03-03 19:19:55,494 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240
[2025-03-03 19:19:55,494 INFO  L87              Difference]: Start difference. First operand 153 states and 218 transitions. Second operand  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:59,800 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:19:59,800 INFO  L93              Difference]: Finished difference Result 207 states and 278 transitions.
[2025-03-03 19:19:59,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-03-03 19:19:59,801 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102
[2025-03-03 19:19:59,801 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:19:59,802 INFO  L225             Difference]: With dead ends: 207
[2025-03-03 19:19:59,802 INFO  L226             Difference]: Without dead ends: 205
[2025-03-03 19:19:59,802 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992
[2025-03-03 19:19:59,803 INFO  L435           NwaCegarLoop]: 63 mSDtfsCounter, 182 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-03 19:19:59,803 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 455 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-03 19:19:59,803 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 205 states.
[2025-03-03 19:19:59,813 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 153.
[2025-03-03 19:19:59,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45)
[2025-03-03 19:19:59,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions.
[2025-03-03 19:19:59,815 INFO  L78                 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102
[2025-03-03 19:19:59,816 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:19:59,816 INFO  L471      AbstractCegarLoop]: Abstraction has 153 states and 218 transitions.
[2025-03-03 19:19:59,816 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2025-03-03 19:19:59,816 INFO  L276                IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions.
[2025-03-03 19:19:59,817 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-03 19:19:59,817 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:19:59,817 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:19:59,817 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 19:19:59,817 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:19:59,818 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:19:59,818 INFO  L85        PathProgramCache]: Analyzing trace with hash 677202278, now seen corresponding path program 1 times
[2025-03-03 19:19:59,818 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:19:59,818 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418506611]
[2025-03-03 19:19:59,818 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:19:59,818 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:19:59,823 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-03 19:19:59,843 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-03 19:19:59,843 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:19:59,843 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:11,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-03 19:20:11,044 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:11,044 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418506611]
[2025-03-03 19:20:11,044 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418506611] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:11,044 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:11,044 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2025-03-03 19:20:11,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103347669]
[2025-03-03 19:20:11,044 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:11,044 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-03-03 19:20:11,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:11,044 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-03-03 19:20:11,045 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342
[2025-03-03 19:20:11,045 INFO  L87              Difference]: Start difference. First operand 153 states and 218 transitions. Second operand  has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)
[2025-03-03 19:20:20,943 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:20,944 INFO  L93              Difference]: Finished difference Result 216 states and 289 transitions.
[2025-03-03 19:20:20,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-03-03 19:20:20,944 INFO  L78                 Accepts]: Start accepts. Automaton has  has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103
[2025-03-03 19:20:20,944 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:20,945 INFO  L225             Difference]: With dead ends: 216
[2025-03-03 19:20:20,945 INFO  L226             Difference]: Without dead ends: 214
[2025-03-03 19:20:20,946 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=336, Invalid=924, Unknown=0, NotChecked=0, Total=1260
[2025-03-03 19:20:20,946 INFO  L435           NwaCegarLoop]: 56 mSDtfsCounter, 162 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:20,947 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 538 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time]
[2025-03-03 19:20:20,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 214 states.
[2025-03-03 19:20:20,954 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 157.
[2025-03-03 19:20:20,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 157 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 108 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45)
[2025-03-03 19:20:20,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 223 transitions.
[2025-03-03 19:20:20,955 INFO  L78                 Accepts]: Start accepts. Automaton has 157 states and 223 transitions. Word has length 103
[2025-03-03 19:20:20,955 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:20,955 INFO  L471      AbstractCegarLoop]: Abstraction has 157 states and 223 transitions.
[2025-03-03 19:20:20,955 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)
[2025-03-03 19:20:20,955 INFO  L276                IsEmpty]: Start isEmpty. Operand 157 states and 223 transitions.
[2025-03-03 19:20:20,956 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-03 19:20:20,956 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:20,956 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:20:20,956 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 19:20:20,956 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:20,957 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:20,957 INFO  L85        PathProgramCache]: Analyzing trace with hash -1130252185, now seen corresponding path program 1 times
[2025-03-03 19:20:20,957 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:20,957 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732025997]
[2025-03-03 19:20:20,957 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:20,957 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:20,961 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-03 19:20:20,977 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-03 19:20:20,979 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:20,980 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:26,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-03 19:20:26,490 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:26,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732025997]
[2025-03-03 19:20:26,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732025997] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:26,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:26,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2025-03-03 19:20:26,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274639772]
[2025-03-03 19:20:26,491 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:26,491 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-03-03 19:20:26,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:26,491 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-03-03 19:20:26,492 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380
[2025-03-03 19:20:26,492 INFO  L87              Difference]: Start difference. First operand 157 states and 223 transitions. Second operand  has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)
[2025-03-03 19:20:31,948 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:31,949 INFO  L93              Difference]: Finished difference Result 210 states and 283 transitions.
[2025-03-03 19:20:31,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-03-03 19:20:31,949 INFO  L78                 Accepts]: Start accepts. Automaton has  has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103
[2025-03-03 19:20:31,949 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:31,950 INFO  L225             Difference]: With dead ends: 210
[2025-03-03 19:20:31,950 INFO  L226             Difference]: Without dead ends: 208
[2025-03-03 19:20:31,951 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=358, Invalid=974, Unknown=0, NotChecked=0, Total=1332
[2025-03-03 19:20:31,951 INFO  L435           NwaCegarLoop]: 72 mSDtfsCounter, 171 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:31,951 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 510 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-03 19:20:31,951 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2025-03-03 19:20:31,960 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 154.
[2025-03-03 19:20:31,961 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 154 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 105 states have internal predecessors, (129), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45)
[2025-03-03 19:20:31,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 219 transitions.
[2025-03-03 19:20:31,962 INFO  L78                 Accepts]: Start accepts. Automaton has 154 states and 219 transitions. Word has length 103
[2025-03-03 19:20:31,962 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:31,962 INFO  L471      AbstractCegarLoop]: Abstraction has 154 states and 219 transitions.
[2025-03-03 19:20:31,962 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)
[2025-03-03 19:20:31,962 INFO  L276                IsEmpty]: Start isEmpty. Operand 154 states and 219 transitions.
[2025-03-03 19:20:31,963 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-03 19:20:31,963 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:31,963 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:20:31,963 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 19:20:31,963 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:31,963 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:31,964 INFO  L85        PathProgramCache]: Analyzing trace with hash 414928266, now seen corresponding path program 1 times
[2025-03-03 19:20:31,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:31,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713195765]
[2025-03-03 19:20:31,964 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:31,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:31,968 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-03 19:20:31,984 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-03 19:20:31,984 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:31,984 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:36,818 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-03 19:20:36,818 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:36,818 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713195765]
[2025-03-03 19:20:36,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713195765] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:36,818 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:36,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2025-03-03 19:20:36,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90397412]
[2025-03-03 19:20:36,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:36,818 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-03-03 19:20:36,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:36,819 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-03-03 19:20:36,819 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272
[2025-03-03 19:20:36,819 INFO  L87              Difference]: Start difference. First operand 154 states and 219 transitions. Second operand  has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2025-03-03 19:20:40,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:20:40,097 INFO  L93              Difference]: Finished difference Result 198 states and 268 transitions.
[2025-03-03 19:20:40,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-03 19:20:40,098 INFO  L78                 Accepts]: Start accepts. Automaton has  has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103
[2025-03-03 19:20:40,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:20:40,099 INFO  L225             Difference]: With dead ends: 198
[2025-03-03 19:20:40,100 INFO  L226             Difference]: Without dead ends: 196
[2025-03-03 19:20:40,100 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930
[2025-03-03 19:20:40,101 INFO  L435           NwaCegarLoop]: 54 mSDtfsCounter, 233 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-03 19:20:40,101 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 420 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-03 19:20:40,101 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2025-03-03 19:20:40,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 151.
[2025-03-03 19:20:40,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 151 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45)
[2025-03-03 19:20:40,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 215 transitions.
[2025-03-03 19:20:40,108 INFO  L78                 Accepts]: Start accepts. Automaton has 151 states and 215 transitions. Word has length 103
[2025-03-03 19:20:40,109 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:20:40,109 INFO  L471      AbstractCegarLoop]: Abstraction has 151 states and 215 transitions.
[2025-03-03 19:20:40,109 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2025-03-03 19:20:40,109 INFO  L276                IsEmpty]: Start isEmpty. Operand 151 states and 215 transitions.
[2025-03-03 19:20:40,110 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-03-03 19:20:40,110 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:20:40,110 INFO  L218           NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:20:40,110 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 19:20:40,110 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:20:40,110 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:20:40,110 INFO  L85        PathProgramCache]: Analyzing trace with hash 724778797, now seen corresponding path program 1 times
[2025-03-03 19:20:40,110 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:20:40,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019929810]
[2025-03-03 19:20:40,111 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:20:40,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:20:40,115 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-03-03 19:20:40,132 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-03-03 19:20:40,132 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:20:40,132 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:20:47,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2025-03-03 19:20:47,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:20:47,206 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019929810]
[2025-03-03 19:20:47,206 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019929810] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:20:47,206 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:20:47,206 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2025-03-03 19:20:47,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998497000]
[2025-03-03 19:20:47,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:20:47,206 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-03-03 19:20:47,206 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:20:47,206 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-03-03 19:20:47,207 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272
[2025-03-03 19:20:47,207 INFO  L87              Difference]: Start difference. First operand 151 states and 215 transitions. Second operand  has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)