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


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


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
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_fillercodestructure_filler-pr-ci_file-10.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 69eea854146ed6719c2a02b1e3c48ec2ec3340ce1e8957b9754599908f0bff1b
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-17 01:18:37,178 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-17 01:18:37,239 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-17 01:18:37,247 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-17 01:18:37,248 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-17 01:18:37,274 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-17 01:18:37,274 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-17 01:18:37,275 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-17 01:18:37,275 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-17 01:18:37,275 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-17 01:18:37,275 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-17 01:18:37,276 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-17 01:18:37,276 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-17 01:18:37,276 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-17 01:18:37,276 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-17 01:18:37,276 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-17 01:18:37,276 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-17 01:18:37,277 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-17 01:18:37,277 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-17 01:18:37,277 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-17 01:18:37,277 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-17 01:18:37,277 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-17 01:18:37,277 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-17 01:18:37,277 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-17 01:18:37,277 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-17 01:18:37,277 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-17 01:18:37,278 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-17 01:18:37,278 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-17 01:18:37,278 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-17 01:18:37,278 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-17 01:18:37,278 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-17 01:18:37,278 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-17 01:18:37,278 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-17 01:18:37,278 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-17 01:18:37,279 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-17 01:18:37,279 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-17 01:18:37,279 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-17 01:18:37,279 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-17 01:18:37,279 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-17 01:18:37,279 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-17 01:18:37,279 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-17 01:18:37,279 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-17 01:18:37,279 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-17 01:18:37,279 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 -> 69eea854146ed6719c2a02b1e3c48ec2ec3340ce1e8957b9754599908f0bff1b
[2025-03-17 01:18:37,563 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-17 01:18:37,568 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-17 01:18:37,570 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-17 01:18:37,571 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-17 01:18:37,571 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-17 01:18:37,572 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i
[2025-03-17 01:18:38,760 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11f6c13f/28927926859e4cde906727300185204b/FLAG1b1186d44
[2025-03-17 01:18:39,019 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-17 01:18:39,020 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i
[2025-03-17 01:18:39,027 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11f6c13f/28927926859e4cde906727300185204b/FLAG1b1186d44
[2025-03-17 01:18:39,045 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11f6c13f/28927926859e4cde906727300185204b
[2025-03-17 01:18:39,047 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-17 01:18:39,048 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-17 01:18:39,049 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-17 01:18:39,050 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-17 01:18:39,053 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-17 01:18:39,054 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,056 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4333af9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39, skipping insertion in model container
[2025-03-17 01:18:39,056 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,069 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-17 01:18:39,185 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_fillercodestructure_filler-pr-ci_file-10.i[919,932]
[2025-03-17 01:18:39,262 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-17 01:18:39,280 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-17 01:18:39,290 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_fillercodestructure_filler-pr-ci_file-10.i[919,932]
[2025-03-17 01:18:39,336 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-17 01:18:39,353 INFO  L204         MainTranslator]: Completed translation
[2025-03-17 01:18:39,353 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39 WrapperNode
[2025-03-17 01:18:39,354 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-17 01:18:39,354 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-17 01:18:39,354 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-17 01:18:39,355 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-17 01:18:39,359 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,367 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,410 INFO  L138                Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 295
[2025-03-17 01:18:39,410 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-17 01:18:39,411 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-17 01:18:39,411 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-17 01:18:39,411 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-17 01:18:39,419 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,420 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,426 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,450 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-17 01:18:39,450 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,452 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,464 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,467 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,469 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,472 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,477 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-17 01:18:39,479 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-17 01:18:39,479 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-17 01:18:39,479 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-17 01:18:39,480 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (1/1) ...
[2025-03-17 01:18:39,484 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-17 01:18:39,493 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-17 01:18:39,505 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-17 01:18:39,507 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-17 01:18:39,526 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-17 01:18:39,526 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-17 01:18:39,526 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-17 01:18:39,526 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-17 01:18:39,526 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-17 01:18:39,526 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-17 01:18:39,591 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-17 01:18:39,593 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-17 01:18:40,006 INFO  L1322  $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~bitwise32#1;havoc property_#t~ite34#1;havoc property_#t~bitwise33#1;havoc property_#t~short35#1;
[2025-03-17 01:18:40,036 INFO  L?                        ?]: Removed 32 outVars from TransFormulas that were not future-live.
[2025-03-17 01:18:40,036 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-17 01:18:40,061 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-17 01:18:40,063 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-17 01:18:40,063 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:18:40 BoogieIcfgContainer
[2025-03-17 01:18:40,063 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-17 01:18:40,066 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-17 01:18:40,066 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-17 01:18:40,070 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-17 01:18:40,071 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:18:39" (1/3) ...
[2025-03-17 01:18:40,072 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de5bf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:18:40, skipping insertion in model container
[2025-03-17 01:18:40,072 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:18:39" (2/3) ...
[2025-03-17 01:18:40,072 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de5bf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:18:40, skipping insertion in model container
[2025-03-17 01:18:40,072 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:18:40" (3/3) ...
[2025-03-17 01:18:40,074 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i
[2025-03-17 01:18:40,088 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-17 01:18:40,091 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-10.i that has 2 procedures, 121 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-17 01:18:40,151 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-17 01:18:40,162 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;@5c19d197, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-17 01:18:40,163 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-17 01:18:40,168 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 121 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2025-03-17 01:18:40,180 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-03-17 01:18:40,181 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 01:18:40,181 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:18:40,182 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 01:18:40,186 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 01:18:40,186 INFO  L85        PathProgramCache]: Analyzing trace with hash 692788438, now seen corresponding path program 1 times
[2025-03-17 01:18:40,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 01:18:40,192 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019241583]
[2025-03-17 01:18:40,192 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 01:18:40,192 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 01:18:40,282 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-17 01:18:40,305 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-17 01:18:40,309 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 01:18:40,309 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 01:18:40,511 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked.
[2025-03-17 01:18:40,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 01:18:40,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019241583]
[2025-03-17 01:18:40,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019241583] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-17 01:18:40,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106177487]
[2025-03-17 01:18:40,512 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 01:18:40,512 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-17 01:18:40,512 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-17 01:18:40,514 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-17 01:18:40,516 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-17 01:18:40,631 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-17 01:18:40,709 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-17 01:18:40,710 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 01:18:40,710 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 01:18:40,714 INFO  L256         TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-17 01:18:40,723 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-17 01:18:40,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked.
[2025-03-17 01:18:40,746 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-17 01:18:40,747 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106177487] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 01:18:40,747 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-17 01:18:40,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-17 01:18:40,749 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455122572]
[2025-03-17 01:18:40,750 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 01:18:40,753 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-17 01:18:40,755 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 01:18:40,772 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-17 01:18:40,772 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-17 01:18:40,774 INFO  L87              Difference]: Start difference. First operand  has 121 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand  has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-17 01:18:40,817 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 01:18:40,818 INFO  L93              Difference]: Finished difference Result 239 states and 414 transitions.
[2025-03-17 01:18:40,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-17 01:18:40,820 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215
[2025-03-17 01:18:40,821 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 01:18:40,826 INFO  L225             Difference]: With dead ends: 239
[2025-03-17 01:18:40,827 INFO  L226             Difference]: Without dead ends: 119
[2025-03-17 01:18:40,832 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 216 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-17 01:18:40,835 INFO  L435           NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-17 01:18:40,837 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-17 01:18:40,849 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2025-03-17 01:18:40,871 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119.
[2025-03-17 01:18:40,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 83 states have internal predecessors, (119), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34)
[2025-03-17 01:18:40,880 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 187 transitions.
[2025-03-17 01:18:40,882 INFO  L78                 Accepts]: Start accepts. Automaton has 119 states and 187 transitions. Word has length 215
[2025-03-17 01:18:40,882 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 01:18:40,882 INFO  L471      AbstractCegarLoop]: Abstraction has 119 states and 187 transitions.
[2025-03-17 01:18:40,883 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34)
[2025-03-17 01:18:40,883 INFO  L276                IsEmpty]: Start isEmpty. Operand 119 states and 187 transitions.
[2025-03-17 01:18:40,888 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-03-17 01:18:40,888 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 01:18:40,889 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:18:40,900 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-17 01:18:41,093 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-17 01:18:41,093 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 01:18:41,094 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 01:18:41,094 INFO  L85        PathProgramCache]: Analyzing trace with hash -720429582, now seen corresponding path program 1 times
[2025-03-17 01:18:41,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 01:18:41,094 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201351461]
[2025-03-17 01:18:41,094 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 01:18:41,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 01:18:41,129 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-17 01:18:41,295 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-17 01:18:41,295 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 01:18:41,295 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 01:18:41,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-17 01:18:41,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 01:18:41,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201351461]
[2025-03-17 01:18:41,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201351461] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 01:18:41,812 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 01:18:41,812 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-17 01:18:41,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414344510]
[2025-03-17 01:18:41,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 01:18:41,813 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-17 01:18:41,813 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 01:18:41,813 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-17 01:18:41,813 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-17 01:18:41,814 INFO  L87              Difference]: Start difference. First operand 119 states and 187 transitions. Second operand  has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-17 01:18:42,083 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 01:18:42,083 INFO  L93              Difference]: Finished difference Result 356 states and 560 transitions.
[2025-03-17 01:18:42,084 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-17 01:18:42,085 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215
[2025-03-17 01:18:42,086 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 01:18:42,090 INFO  L225             Difference]: With dead ends: 356
[2025-03-17 01:18:42,092 INFO  L226             Difference]: Without dead ends: 238
[2025-03-17 01:18:42,094 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-17 01:18:42,095 INFO  L435           NwaCegarLoop]: 175 mSDtfsCounter, 125 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-17 01:18:42,097 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 512 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-17 01:18:42,098 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 238 states.
[2025-03-17 01:18:42,136 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 179.
[2025-03-17 01:18:42,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 179 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-03-17 01:18:42,141 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 280 transitions.
[2025-03-17 01:18:42,142 INFO  L78                 Accepts]: Start accepts. Automaton has 179 states and 280 transitions. Word has length 215
[2025-03-17 01:18:42,148 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 01:18:42,148 INFO  L471      AbstractCegarLoop]: Abstraction has 179 states and 280 transitions.
[2025-03-17 01:18:42,149 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-17 01:18:42,149 INFO  L276                IsEmpty]: Start isEmpty. Operand 179 states and 280 transitions.
[2025-03-17 01:18:42,151 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 217
[2025-03-17 01:18:42,152 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 01:18:42,152 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:18:42,152 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-17 01:18:42,152 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 01:18:42,153 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 01:18:42,153 INFO  L85        PathProgramCache]: Analyzing trace with hash 512633898, now seen corresponding path program 1 times
[2025-03-17 01:18:42,153 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 01:18:42,153 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392238046]
[2025-03-17 01:18:42,153 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 01:18:42,153 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 01:18:42,175 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes.
[2025-03-17 01:18:42,442 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements.
[2025-03-17 01:18:42,443 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 01:18:42,443 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 01:19:12,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-17 01:19:12,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 01:19:12,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392238046]
[2025-03-17 01:19:12,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392238046] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 01:19:12,063 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 01:19:12,063 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22
[2025-03-17 01:19:12,063 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062164924]
[2025-03-17 01:19:12,063 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 01:19:12,064 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-03-17 01:19:12,064 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 01:19:12,064 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-03-17 01:19:12,065 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462
[2025-03-17 01:19:12,065 INFO  L87              Difference]: Start difference. First operand 179 states and 280 transitions. Second operand  has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2025-03-17 01:19:17,520 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 01:19:17,520 INFO  L93              Difference]: Finished difference Result 532 states and 815 transitions.
[2025-03-17 01:19:17,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-03-17 01:19:17,521 INFO  L78                 Accepts]: Start accepts. Automaton has  has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 216
[2025-03-17 01:19:17,521 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 01:19:17,524 INFO  L225             Difference]: With dead ends: 532
[2025-03-17 01:19:17,527 INFO  L226             Difference]: Without dead ends: 414
[2025-03-17 01:19:17,528 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332
[2025-03-17 01:19:17,529 INFO  L435           NwaCegarLoop]: 123 mSDtfsCounter, 1245 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 2196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-03-17 01:19:17,529 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 1232 Invalid, 2196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-03-17 01:19:17,530 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 414 states.
[2025-03-17 01:19:17,556 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 212.
[2025-03-17 01:19:17,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 212 states, 141 states have (on average 1.375886524822695) internal successors, (194), 141 states have internal predecessors, (194), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-03-17 01:19:17,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 330 transitions.
[2025-03-17 01:19:17,561 INFO  L78                 Accepts]: Start accepts. Automaton has 212 states and 330 transitions. Word has length 216
[2025-03-17 01:19:17,562 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 01:19:17,562 INFO  L471      AbstractCegarLoop]: Abstraction has 212 states and 330 transitions.
[2025-03-17 01:19:17,562 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2025-03-17 01:19:17,563 INFO  L276                IsEmpty]: Start isEmpty. Operand 212 states and 330 transitions.
[2025-03-17 01:19:17,565 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 217
[2025-03-17 01:19:17,567 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 01:19:17,567 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:19:17,567 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-17 01:19:17,568 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 01:19:17,568 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 01:19:17,568 INFO  L85        PathProgramCache]: Analyzing trace with hash 996178763, now seen corresponding path program 1 times
[2025-03-17 01:19:17,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 01:19:17,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088159187]
[2025-03-17 01:19:17,569 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 01:19:17,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 01:19:17,600 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes.
[2025-03-17 01:19:17,710 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements.
[2025-03-17 01:19:17,711 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 01:19:17,711 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 01:19:33,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-17 01:19:33,554 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 01:19:33,554 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088159187]
[2025-03-17 01:19:33,554 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088159187] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 01:19:33,554 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 01:19:33,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-17 01:19:33,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625478314]
[2025-03-17 01:19:33,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 01:19:33,554 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-17 01:19:33,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 01:19:33,555 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-17 01:19:33,558 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2025-03-17 01:19:33,558 INFO  L87              Difference]: Start difference. First operand 212 states and 330 transitions. Second operand  has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-17 01:19:36,492 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 01:19:36,492 INFO  L93              Difference]: Finished difference Result 683 states and 1029 transitions.
[2025-03-17 01:19:36,493 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2025-03-17 01:19:36,493 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216
[2025-03-17 01:19:36,493 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 01:19:36,496 INFO  L225             Difference]: With dead ends: 683
[2025-03-17 01:19:36,497 INFO  L226             Difference]: Without dead ends: 565
[2025-03-17 01:19:36,497 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600
[2025-03-17 01:19:36,498 INFO  L435           NwaCegarLoop]: 132 mSDtfsCounter, 939 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-17 01:19:36,498 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 830 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-17 01:19:36,499 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 565 states.
[2025-03-17 01:19:36,528 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 207.
[2025-03-17 01:19:36,528 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 207 states, 136 states have (on average 1.375) internal successors, (187), 136 states have internal predecessors, (187), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68)
[2025-03-17 01:19:36,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 323 transitions.
[2025-03-17 01:19:36,530 INFO  L78                 Accepts]: Start accepts. Automaton has 207 states and 323 transitions. Word has length 216
[2025-03-17 01:19:36,530 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 01:19:36,530 INFO  L471      AbstractCegarLoop]: Abstraction has 207 states and 323 transitions.
[2025-03-17 01:19:36,530 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-17 01:19:36,530 INFO  L276                IsEmpty]: Start isEmpty. Operand 207 states and 323 transitions.
[2025-03-17 01:19:36,533 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 217
[2025-03-17 01:19:36,533 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 01:19:36,533 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:19:36,533 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-17 01:19:36,533 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 01:19:36,534 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 01:19:36,534 INFO  L85        PathProgramCache]: Analyzing trace with hash 103809673, now seen corresponding path program 1 times
[2025-03-17 01:19:36,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 01:19:36,534 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180521646]
[2025-03-17 01:19:36,534 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 01:19:36,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 01:19:36,544 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes.
[2025-03-17 01:19:36,615 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements.
[2025-03-17 01:19:36,615 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 01:19:36,615 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 01:19:44,102 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-17 01:19:44,102 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 01:19:44,102 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180521646]
[2025-03-17 01:19:44,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180521646] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 01:19:44,102 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 01:19:44,102 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2025-03-17 01:19:44,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868063264]
[2025-03-17 01:19:44,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 01:19:44,103 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-03-17 01:19:44,103 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 01:19:44,103 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-03-17 01:19:44,103 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420
[2025-03-17 01:19:44,104 INFO  L87              Difference]: Start difference. First operand 207 states and 323 transitions. Second operand  has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2025-03-17 01:19:48,212 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 01:19:48,212 INFO  L93              Difference]: Finished difference Result 739 states and 1130 transitions.
[2025-03-17 01:19:48,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-03-17 01:19:48,213 INFO  L78                 Accepts]: Start accepts. Automaton has  has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 216
[2025-03-17 01:19:48,213 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 01:19:48,218 INFO  L225             Difference]: With dead ends: 739
[2025-03-17 01:19:48,218 INFO  L226             Difference]: Without dead ends: 594
[2025-03-17 01:19:48,219 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=319, Invalid=941, Unknown=0, NotChecked=0, Total=1260
[2025-03-17 01:19:48,221 INFO  L435           NwaCegarLoop]: 162 mSDtfsCounter, 1317 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time
[2025-03-17 01:19:48,221 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 1440 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time]
[2025-03-17 01:19:48,223 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 594 states.
[2025-03-17 01:19:48,246 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 367.
[2025-03-17 01:19:48,247 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 367 states, 261 states have (on average 1.4291187739463602) internal successors, (373), 261 states have internal predecessors, (373), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102)
[2025-03-17 01:19:48,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 577 transitions.
[2025-03-17 01:19:48,251 INFO  L78                 Accepts]: Start accepts. Automaton has 367 states and 577 transitions. Word has length 216
[2025-03-17 01:19:48,251 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 01:19:48,252 INFO  L471      AbstractCegarLoop]: Abstraction has 367 states and 577 transitions.
[2025-03-17 01:19:48,252 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2025-03-17 01:19:48,252 INFO  L276                IsEmpty]: Start isEmpty. Operand 367 states and 577 transitions.
[2025-03-17 01:19:48,253 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 217
[2025-03-17 01:19:48,254 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 01:19:48,254 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:19:48,254 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-17 01:19:48,255 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 01:19:48,255 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 01:19:48,255 INFO  L85        PathProgramCache]: Analyzing trace with hash 587354538, now seen corresponding path program 1 times
[2025-03-17 01:19:48,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 01:19:48,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002951966]
[2025-03-17 01:19:48,256 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 01:19:48,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 01:19:48,265 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes.
[2025-03-17 01:19:48,274 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements.
[2025-03-17 01:19:48,274 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 01:19:48,274 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 01:19:48,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-17 01:19:48,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 01:19:48,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002951966]
[2025-03-17 01:19:48,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002951966] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 01:19:48,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 01:19:48,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-17 01:19:48,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013930997]
[2025-03-17 01:19:48,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 01:19:48,332 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-17 01:19:48,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 01:19:48,333 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-17 01:19:48,333 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-17 01:19:48,334 INFO  L87              Difference]: Start difference. First operand 367 states and 577 transitions. Second operand  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-17 01:19:48,464 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 01:19:48,469 INFO  L93              Difference]: Finished difference Result 718 states and 1109 transitions.
[2025-03-17 01:19:48,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-17 01:19:48,470 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216
[2025-03-17 01:19:48,471 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 01:19:48,473 INFO  L225             Difference]: With dead ends: 718
[2025-03-17 01:19:48,473 INFO  L226             Difference]: Without dead ends: 573
[2025-03-17 01:19:48,476 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-17 01:19:48,476 INFO  L435           NwaCegarLoop]: 261 mSDtfsCounter, 198 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-17 01:19:48,477 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 580 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-17 01:19:48,478 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 573 states.
[2025-03-17 01:19:48,515 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 466.
[2025-03-17 01:19:48,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 466 states, 349 states have (on average 1.4498567335243553) internal successors, (506), 350 states have internal predecessors, (506), 110 states have call successors, (110), 6 states have call predecessors, (110), 6 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110)
[2025-03-17 01:19:48,519 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 726 transitions.
[2025-03-17 01:19:48,520 INFO  L78                 Accepts]: Start accepts. Automaton has 466 states and 726 transitions. Word has length 216
[2025-03-17 01:19:48,521 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 01:19:48,521 INFO  L471      AbstractCegarLoop]: Abstraction has 466 states and 726 transitions.
[2025-03-17 01:19:48,521 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)
[2025-03-17 01:19:48,521 INFO  L276                IsEmpty]: Start isEmpty. Operand 466 states and 726 transitions.
[2025-03-17 01:19:48,528 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 217
[2025-03-17 01:19:48,529 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 01:19:48,529 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:19:48,529 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-17 01:19:48,529 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 01:19:48,530 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 01:19:48,530 INFO  L85        PathProgramCache]: Analyzing trace with hash -1220099925, now seen corresponding path program 1 times
[2025-03-17 01:19:48,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 01:19:48,530 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9273112]
[2025-03-17 01:19:48,530 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 01:19:48,530 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 01:19:48,547 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes.
[2025-03-17 01:19:48,627 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements.
[2025-03-17 01:19:48,627 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 01:19:48,628 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-17 01:19:57,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked.
[2025-03-17 01:19:57,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-17 01:19:57,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9273112]
[2025-03-17 01:19:57,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9273112] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-17 01:19:57,725 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-17 01:19:57,725 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2025-03-17 01:19:57,725 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670892487]
[2025-03-17 01:19:57,725 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-17 01:19:57,725 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-03-17 01:19:57,725 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-17 01:19:57,726 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-03-17 01:19:57,726 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380
[2025-03-17 01:19:57,726 INFO  L87              Difference]: Start difference. First operand 466 states and 726 transitions. Second operand  has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2025-03-17 01:20:01,561 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-17 01:20:01,561 INFO  L93              Difference]: Finished difference Result 1184 states and 1799 transitions.
[2025-03-17 01:20:01,561 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-03-17 01:20:01,561 INFO  L78                 Accepts]: Start accepts. Automaton has  has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 216
[2025-03-17 01:20:01,562 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-17 01:20:01,569 INFO  L225             Difference]: With dead ends: 1184
[2025-03-17 01:20:01,569 INFO  L226             Difference]: Without dead ends: 787
[2025-03-17 01:20:01,572 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122
[2025-03-17 01:20:01,572 INFO  L435           NwaCegarLoop]: 157 mSDtfsCounter, 967 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-17 01:20:01,572 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1462 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2135 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-17 01:20:01,574 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 787 states.
[2025-03-17 01:20:01,606 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 504.
[2025-03-17 01:20:01,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 504 states, 380 states have (on average 1.4131578947368422) internal successors, (537), 381 states have internal predecessors, (537), 110 states have call successors, (110), 13 states have call predecessors, (110), 13 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110)
[2025-03-17 01:20:01,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 757 transitions.
[2025-03-17 01:20:01,610 INFO  L78                 Accepts]: Start accepts. Automaton has 504 states and 757 transitions. Word has length 216
[2025-03-17 01:20:01,610 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-17 01:20:01,611 INFO  L471      AbstractCegarLoop]: Abstraction has 504 states and 757 transitions.
[2025-03-17 01:20:01,611 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34)
[2025-03-17 01:20:01,611 INFO  L276                IsEmpty]: Start isEmpty. Operand 504 states and 757 transitions.
[2025-03-17 01:20:01,612 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 217
[2025-03-17 01:20:01,613 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-17 01:20:01,613 INFO  L218           NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:20:01,613 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-17 01:20:01,613 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-17 01:20:01,613 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-17 01:20:01,613 INFO  L85        PathProgramCache]: Analyzing trace with hash 232892392, now seen corresponding path program 1 times
[2025-03-17 01:20:01,613 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-17 01:20:01,613 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904112194]
[2025-03-17 01:20:01,613 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-17 01:20:01,613 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-17 01:20:01,625 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes.
[2025-03-17 01:20:01,681 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements.
[2025-03-17 01:20:01,681 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-17 01:20:01,681 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat