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


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-34.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 a2e67766c6fd196971faf344e8fff85e5c895ea0afd7f2774008fd81029a9807
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 12:26:09,146 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 12:26:09,192 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 12:26:09,196 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 12:26:09,196 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 12:26:09,218 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 12:26:09,220 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 12:26:09,220 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 12:26:09,220 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 12:26:09,220 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 12:26:09,220 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 12:26:09,221 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 12:26:09,221 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 12:26:09,221 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 12:26:09,221 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 12:26:09,221 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 12:26:09,222 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 12:26:09,222 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 12:26:09,222 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 12:26:09,222 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 12:26:09,222 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 12:26:09,222 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 12:26:09,222 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 12:26:09,223 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 12:26:09,223 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 12:26:09,223 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 12:26:09,223 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 12:26:09,223 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 12:26:09,223 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 12:26:09,223 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 12:26:09,223 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 12:26:09,223 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 12:26:09,223 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 12:26:09,223 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 12:26:09,224 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 12:26:09,224 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 12:26:09,224 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 12:26:09,224 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 12:26:09,224 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 12:26:09,224 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 12:26:09,224 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 12:26:09,224 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 12:26:09,224 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 12:26:09,224 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 -> a2e67766c6fd196971faf344e8fff85e5c895ea0afd7f2774008fd81029a9807
[2025-03-08 12:26:09,455 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 12:26:09,462 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 12:26:09,464 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 12:26:09,465 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 12:26:09,466 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 12:26:09,467 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-cn_file-34.i
[2025-03-08 12:26:10,615 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd58b7f5/e7a217ac4ce0465591c38dde628e00a2/FLAG61a9b7a47
[2025-03-08 12:26:10,839 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 12:26:10,842 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-34.i
[2025-03-08 12:26:10,849 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd58b7f5/e7a217ac4ce0465591c38dde628e00a2/FLAG61a9b7a47
[2025-03-08 12:26:11,179 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd58b7f5/e7a217ac4ce0465591c38dde628e00a2
[2025-03-08 12:26:11,181 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 12:26:11,181 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 12:26:11,182 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 12:26:11,182 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 12:26:11,185 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 12:26:11,186 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,187 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bffe21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11, skipping insertion in model container
[2025-03-08 12:26:11,187 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,203 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 12:26:11,295 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-cn_file-34.i[919,932]
[2025-03-08 12:26:11,368 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 12:26:11,380 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 12:26:11,389 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-cn_file-34.i[919,932]
[2025-03-08 12:26:11,423 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 12:26:11,441 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 12:26:11,441 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11 WrapperNode
[2025-03-08 12:26:11,442 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 12:26:11,443 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 12:26:11,443 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 12:26:11,443 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 12:26:11,447 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,456 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,492 INFO  L138                Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263
[2025-03-08 12:26:11,492 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 12:26:11,493 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 12:26:11,493 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 12:26:11,493 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 12:26:11,501 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,501 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,503 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,523 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 12:26:11,526 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,526 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,537 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,540 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,541 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,545 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,547 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 12:26:11,550 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 12:26:11,550 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 12:26:11,550 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 12:26:11,551 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (1/1) ...
[2025-03-08 12:26:11,554 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 12:26:11,563 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 12:26:11,576 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 12:26:11,579 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 12:26:11,593 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 12:26:11,593 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 12:26:11,593 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 12:26:11,594 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 12:26:11,594 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 12:26:11,594 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 12:26:11,659 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 12:26:11,660 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 12:26:12,012 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L205: havoc property_#t~bitwise24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short27#1;
[2025-03-08 12:26:12,042 INFO  L?                        ?]: Removed 30 outVars from TransFormulas that were not future-live.
[2025-03-08 12:26:12,043 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 12:26:12,062 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 12:26:12,062 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 12:26:12,062 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:26:12 BoogieIcfgContainer
[2025-03-08 12:26:12,062 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 12:26:12,064 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 12:26:12,064 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 12:26:12,067 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 12:26:12,067 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:26:11" (1/3) ...
[2025-03-08 12:26:12,067 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4084eb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:26:12, skipping insertion in model container
[2025-03-08 12:26:12,067 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:11" (2/3) ...
[2025-03-08 12:26:12,068 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4084eb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:26:12, skipping insertion in model container
[2025-03-08 12:26:12,068 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:26:12" (3/3) ...
[2025-03-08 12:26:12,069 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-34.i
[2025-03-08 12:26:12,079 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 12:26:12,081 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-34.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 12:26:12,119 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 12:26:12,127 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;@456b77a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 12:26:12,128 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 12:26:12,131 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 111 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2025-03-08 12:26:12,142 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 12:26:12,142 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:26:12,143 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 12:26:12,143 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:26:12,146 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:26:12,146 INFO  L85        PathProgramCache]: Analyzing trace with hash -976668312, now seen corresponding path program 1 times
[2025-03-08 12:26:12,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:26:12,152 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788315011]
[2025-03-08 12:26:12,152 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:26:12,154 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:26:12,218 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 12:26:12,243 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 12:26:12,243 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:26:12,243 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:26:12,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked.
[2025-03-08 12:26:12,408 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:26:12,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788315011]
[2025-03-08 12:26:12,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788315011] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 12:26:12,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763368941]
[2025-03-08 12:26:12,409 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:26:12,409 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 12:26:12,409 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 12:26:12,411 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 12:26:12,412 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 12:26:12,491 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 12:26:12,564 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 12:26:12,564 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:26:12,565 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:26:12,567 INFO  L256         TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 12:26:12,573 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 12:26:12,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked.
[2025-03-08 12:26:12,609 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 12:26:12,610 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [763368941] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:26:12,610 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 12:26:12,610 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 12:26:12,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351527835]
[2025-03-08 12:26:12,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:26:12,615 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 12:26:12,615 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:26:12,627 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 12:26:12,627 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 12:26:12,629 INFO  L87              Difference]: Start difference. First operand  has 111 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand  has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33)
[2025-03-08 12:26:12,656 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:26:12,656 INFO  L93              Difference]: Finished difference Result 216 states and 380 transitions.
[2025-03-08 12:26:12,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 12:26:12,658 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 212
[2025-03-08 12:26:12,658 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:26:12,665 INFO  L225             Difference]: With dead ends: 216
[2025-03-08 12:26:12,665 INFO  L226             Difference]: Without dead ends: 108
[2025-03-08 12:26:12,669 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 12:26:12,670 INFO  L435           NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 12:26:12,673 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 12:26:12,681 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2025-03-08 12:26:12,700 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108.
[2025-03-08 12:26:12,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 108 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33)
[2025-03-08 12:26:12,705 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 171 transitions.
[2025-03-08 12:26:12,707 INFO  L78                 Accepts]: Start accepts. Automaton has 108 states and 171 transitions. Word has length 212
[2025-03-08 12:26:12,707 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:26:12,707 INFO  L471      AbstractCegarLoop]: Abstraction has 108 states and 171 transitions.
[2025-03-08 12:26:12,707 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33)
[2025-03-08 12:26:12,707 INFO  L276                IsEmpty]: Start isEmpty. Operand 108 states and 171 transitions.
[2025-03-08 12:26:12,710 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2025-03-08 12:26:12,710 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:26:12,711 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 12:26:12,717 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 12:26:12,911 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 12:26:12,911 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:26:12,912 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:26:12,912 INFO  L85        PathProgramCache]: Analyzing trace with hash -343614363, now seen corresponding path program 1 times
[2025-03-08 12:26:12,912 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:26:12,912 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306773381]
[2025-03-08 12:26:12,912 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:26:12,913 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:26:12,929 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes.
[2025-03-08 12:26:13,006 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements.
[2025-03-08 12:26:13,008 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:26:13,008 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:26:13,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 12:26:13,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:26:13,338 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306773381]
[2025-03-08 12:26:13,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306773381] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:26:13,338 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:26:13,338 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 12:26:13,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156720586]
[2025-03-08 12:26:13,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:26:13,340 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 12:26:13,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:26:13,340 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 12:26:13,340 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 12:26:13,341 INFO  L87              Difference]: Start difference. First operand 108 states and 171 transitions. Second operand  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:26:13,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:26:13,513 INFO  L93              Difference]: Finished difference Result 358 states and 571 transitions.
[2025-03-08 12:26:13,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 12:26:13,514 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212
[2025-03-08 12:26:13,514 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:26:13,516 INFO  L225             Difference]: With dead ends: 358
[2025-03-08 12:26:13,516 INFO  L226             Difference]: Without dead ends: 253
[2025-03-08 12:26:13,519 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-08 12:26:13,520 INFO  L435           NwaCegarLoop]: 219 mSDtfsCounter, 173 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 12:26:13,520 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 536 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 12:26:13,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 253 states.
[2025-03-08 12:26:13,553 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 221.
[2025-03-08 12:26:13,554 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 221 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 152 states have internal predecessors, (223), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2025-03-08 12:26:13,558 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 355 transitions.
[2025-03-08 12:26:13,560 INFO  L78                 Accepts]: Start accepts. Automaton has 221 states and 355 transitions. Word has length 212
[2025-03-08 12:26:13,560 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:26:13,561 INFO  L471      AbstractCegarLoop]: Abstraction has 221 states and 355 transitions.
[2025-03-08 12:26:13,561 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:26:13,562 INFO  L276                IsEmpty]: Start isEmpty. Operand 221 states and 355 transitions.
[2025-03-08 12:26:13,563 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 214
[2025-03-08 12:26:13,565 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:26:13,565 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 12:26:13,565 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 12:26:13,565 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:26:13,566 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:26:13,566 INFO  L85        PathProgramCache]: Analyzing trace with hash -1911976006, now seen corresponding path program 1 times
[2025-03-08 12:26:13,566 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:26:13,566 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801448720]
[2025-03-08 12:26:13,567 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:26:13,567 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:26:13,583 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes.
[2025-03-08 12:26:13,611 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements.
[2025-03-08 12:26:13,612 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:26:13,612 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:26:13,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 12:26:13,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:26:13,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801448720]
[2025-03-08 12:26:13,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801448720] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:26:13,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:26:13,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 12:26:13,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794109078]
[2025-03-08 12:26:13,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:26:13,830 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 12:26:13,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:26:13,831 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 12:26:13,831 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 12:26:13,832 INFO  L87              Difference]: Start difference. First operand 221 states and 355 transitions. Second operand  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:26:14,140 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:26:14,140 INFO  L93              Difference]: Finished difference Result 648 states and 1042 transitions.
[2025-03-08 12:26:14,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 12:26:14,141 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 213
[2025-03-08 12:26:14,141 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:26:14,144 INFO  L225             Difference]: With dead ends: 648
[2025-03-08 12:26:14,144 INFO  L226             Difference]: Without dead ends: 430
[2025-03-08 12:26:14,145 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 12:26:14,145 INFO  L435           NwaCegarLoop]: 304 mSDtfsCounter, 196 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 12:26:14,146 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 643 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 12:26:14,146 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2025-03-08 12:26:14,181 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 225.
[2025-03-08 12:26:14,183 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 225 states, 156 states have (on average 1.455128205128205) internal successors, (227), 156 states have internal predecessors, (227), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66)
[2025-03-08 12:26:14,184 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 359 transitions.
[2025-03-08 12:26:14,187 INFO  L78                 Accepts]: Start accepts. Automaton has 225 states and 359 transitions. Word has length 213
[2025-03-08 12:26:14,188 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:26:14,188 INFO  L471      AbstractCegarLoop]: Abstraction has 225 states and 359 transitions.
[2025-03-08 12:26:14,188 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:26:14,188 INFO  L276                IsEmpty]: Start isEmpty. Operand 225 states and 359 transitions.
[2025-03-08 12:26:14,189 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 215
[2025-03-08 12:26:14,189 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:26:14,189 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 12:26:14,189 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 12:26:14,190 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:26:14,190 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:26:14,190 INFO  L85        PathProgramCache]: Analyzing trace with hash 920420609, now seen corresponding path program 1 times
[2025-03-08 12:26:14,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:26:14,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895649655]
[2025-03-08 12:26:14,190 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:26:14,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:26:14,201 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes.
[2025-03-08 12:26:14,237 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements.
[2025-03-08 12:26:14,238 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:26:14,238 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:26:15,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 12:26:15,694 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:26:15,694 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895649655]
[2025-03-08 12:26:15,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895649655] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:26:15,695 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:26:15,695 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 12:26:15,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572898006]
[2025-03-08 12:26:15,695 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:26:15,695 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 12:26:15,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:26:15,696 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 12:26:15,696 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 12:26:15,697 INFO  L87              Difference]: Start difference. First operand 225 states and 359 transitions. Second operand  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:26:16,210 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:26:16,210 INFO  L93              Difference]: Finished difference Result 663 states and 1047 transitions.
[2025-03-08 12:26:16,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 12:26:16,211 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214
[2025-03-08 12:26:16,211 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:26:16,214 INFO  L225             Difference]: With dead ends: 663
[2025-03-08 12:26:16,214 INFO  L226             Difference]: Without dead ends: 441
[2025-03-08 12:26:16,215 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90
[2025-03-08 12:26:16,215 INFO  L435           NwaCegarLoop]: 143 mSDtfsCounter, 224 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 12:26:16,216 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 529 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 12:26:16,216 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 441 states.
[2025-03-08 12:26:16,264 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 323.
[2025-03-08 12:26:16,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 323 states, 220 states have (on average 1.459090909090909) internal successors, (321), 220 states have internal predecessors, (321), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99)
[2025-03-08 12:26:16,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 519 transitions.
[2025-03-08 12:26:16,267 INFO  L78                 Accepts]: Start accepts. Automaton has 323 states and 519 transitions. Word has length 214
[2025-03-08 12:26:16,269 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:26:16,269 INFO  L471      AbstractCegarLoop]: Abstraction has 323 states and 519 transitions.
[2025-03-08 12:26:16,269 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:26:16,270 INFO  L276                IsEmpty]: Start isEmpty. Operand 323 states and 519 transitions.
[2025-03-08 12:26:16,271 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 215
[2025-03-08 12:26:16,272 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:26:16,272 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 12:26:16,272 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 12:26:16,273 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:26:16,273 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:26:16,273 INFO  L85        PathProgramCache]: Analyzing trace with hash -629154084, now seen corresponding path program 1 times
[2025-03-08 12:26:16,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:26:16,274 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737825772]
[2025-03-08 12:26:16,274 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:26:16,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:26:16,285 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes.
[2025-03-08 12:26:16,410 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements.
[2025-03-08 12:26:16,410 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:26:16,410 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:26:51,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 12:26:51,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:26:51,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737825772]
[2025-03-08 12:26:51,726 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737825772] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:26:51,726 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:26:51,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2025-03-08 12:26:51,727 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24673981]
[2025-03-08 12:26:51,727 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:26:51,727 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-03-08 12:26:51,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:26:51,727 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-03-08 12:26:51,728 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240
[2025-03-08 12:26:51,728 INFO  L87              Difference]: Start difference. First operand 323 states and 519 transitions. Second operand  has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:26:53,509 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:26:53,510 INFO  L93              Difference]: Finished difference Result 865 states and 1352 transitions.
[2025-03-08 12:26:53,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-08 12:26:53,511 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214
[2025-03-08 12:26:53,511 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:26:53,514 INFO  L225             Difference]: With dead ends: 865
[2025-03-08 12:26:53,516 INFO  L226             Difference]: Without dead ends: 606
[2025-03-08 12:26:53,517 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756
[2025-03-08 12:26:53,518 INFO  L435           NwaCegarLoop]: 145 mSDtfsCounter, 812 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-08 12:26:53,519 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1295 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-08 12:26:53,519 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 606 states.
[2025-03-08 12:26:53,551 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 437.
[2025-03-08 12:26:53,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 437 states, 334 states have (on average 1.4940119760479043) internal successors, (499), 334 states have internal predecessors, (499), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99)
[2025-03-08 12:26:53,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 697 transitions.
[2025-03-08 12:26:53,557 INFO  L78                 Accepts]: Start accepts. Automaton has 437 states and 697 transitions. Word has length 214
[2025-03-08 12:26:53,557 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:26:53,557 INFO  L471      AbstractCegarLoop]: Abstraction has 437 states and 697 transitions.
[2025-03-08 12:26:53,558 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:26:53,558 INFO  L276                IsEmpty]: Start isEmpty. Operand 437 states and 697 transitions.
[2025-03-08 12:26:53,559 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 215
[2025-03-08 12:26:53,559 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:26:53,560 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 12:26:53,560 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 12:26:53,560 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:26:53,562 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:26:53,563 INFO  L85        PathProgramCache]: Analyzing trace with hash 258349597, now seen corresponding path program 1 times
[2025-03-08 12:26:53,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:26:53,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083194128]
[2025-03-08 12:26:53,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:26:53,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:26:53,572 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes.
[2025-03-08 12:26:53,647 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements.
[2025-03-08 12:26:53,648 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:26:53,648 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:26:55,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 12:26:55,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:26:55,179 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083194128]
[2025-03-08 12:26:55,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083194128] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:26:55,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:26:55,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 12:26:55,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700198923]
[2025-03-08 12:26:55,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:26:55,179 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 12:26:55,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:26:55,180 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 12:26:55,180 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2025-03-08 12:26:55,180 INFO  L87              Difference]: Start difference. First operand 437 states and 697 transitions. Second operand  has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:26:56,001 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:26:56,001 INFO  L93              Difference]: Finished difference Result 913 states and 1437 transitions.
[2025-03-08 12:26:56,002 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 12:26:56,002 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214
[2025-03-08 12:26:56,002 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:26:56,005 INFO  L225             Difference]: With dead ends: 913
[2025-03-08 12:26:56,005 INFO  L226             Difference]: Without dead ends: 675
[2025-03-08 12:26:56,006 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210
[2025-03-08 12:26:56,007 INFO  L435           NwaCegarLoop]: 132 mSDtfsCounter, 480 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 12:26:56,007 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 668 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 12:26:56,008 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 675 states.
[2025-03-08 12:26:56,054 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 505.
[2025-03-08 12:26:56,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 505 states, 402 states have (on average 1.4975124378109452) internal successors, (602), 402 states have internal predecessors, (602), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99)
[2025-03-08 12:26:56,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 800 transitions.
[2025-03-08 12:26:56,058 INFO  L78                 Accepts]: Start accepts. Automaton has 505 states and 800 transitions. Word has length 214
[2025-03-08 12:26:56,058 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:26:56,058 INFO  L471      AbstractCegarLoop]: Abstraction has 505 states and 800 transitions.
[2025-03-08 12:26:56,058 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:26:56,058 INFO  L276                IsEmpty]: Start isEmpty. Operand 505 states and 800 transitions.
[2025-03-08 12:26:56,060 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 215
[2025-03-08 12:26:56,060 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:26:56,060 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 12:26:56,060 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 12:26:56,060 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:26:56,061 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:26:56,061 INFO  L85        PathProgramCache]: Analyzing trace with hash 1858358749, now seen corresponding path program 1 times
[2025-03-08 12:26:56,061 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:26:56,061 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681685351]
[2025-03-08 12:26:56,061 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:26:56,061 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:26:56,069 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes.
[2025-03-08 12:26:56,112 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements.
[2025-03-08 12:26:56,112 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:26:56,112 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:26:57,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 12:26:57,579 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:26:57,579 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681685351]
[2025-03-08 12:26:57,579 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681685351] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:26:57,579 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:26:57,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-08 12:26:57,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609109242]
[2025-03-08 12:26:57,579 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:26:57,579 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-08 12:26:57,579 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:26:57,580 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-08 12:26:57,580 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2025-03-08 12:26:57,581 INFO  L87              Difference]: Start difference. First operand 505 states and 800 transitions. Second operand  has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33)
[2025-03-08 12:26:58,462 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:26:58,462 INFO  L93              Difference]: Finished difference Result 907 states and 1409 transitions.
[2025-03-08 12:26:58,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-08 12:26:58,463 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 214
[2025-03-08 12:26:58,463 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:26:58,466 INFO  L225             Difference]: With dead ends: 907
[2025-03-08 12:26:58,466 INFO  L226             Difference]: Without dead ends: 671
[2025-03-08 12:26:58,468 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342
[2025-03-08 12:26:58,469 INFO  L435           NwaCegarLoop]: 139 mSDtfsCounter, 641 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 12:26:58,469 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 750 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 12:26:58,471 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 671 states.
[2025-03-08 12:26:58,504 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 567.
[2025-03-08 12:26:58,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 567 states, 464 states have (on average 1.5064655172413792) internal successors, (699), 464 states have internal predecessors, (699), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99)
[2025-03-08 12:26:58,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 897 transitions.
[2025-03-08 12:26:58,512 INFO  L78                 Accepts]: Start accepts. Automaton has 567 states and 897 transitions. Word has length 214
[2025-03-08 12:26:58,512 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:26:58,512 INFO  L471      AbstractCegarLoop]: Abstraction has 567 states and 897 transitions.
[2025-03-08 12:26:58,512 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33)
[2025-03-08 12:26:58,513 INFO  L276                IsEmpty]: Start isEmpty. Operand 567 states and 897 transitions.
[2025-03-08 12:26:58,515 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 215
[2025-03-08 12:26:58,517 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:26:58,517 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 12:26:58,517 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 12:26:58,518 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:26:58,518 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:26:58,518 INFO  L85        PathProgramCache]: Analyzing trace with hash 409886432, now seen corresponding path program 1 times
[2025-03-08 12:26:58,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:26:58,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565149972]
[2025-03-08 12:26:58,519 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:26:58,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:26:58,529 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes.
[2025-03-08 12:26:58,568 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements.
[2025-03-08 12:26:58,569 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:26:58,569 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:26:58,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 12:26:58,779 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:26:58,779 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565149972]
[2025-03-08 12:26:58,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565149972] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:26:58,779 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:26:58,779 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 12:26:58,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544440575]
[2025-03-08 12:26:58,779 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:26:58,780 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 12:26:58,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:26:58,780 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 12:26:58,780 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 12:26:58,780 INFO  L87              Difference]: Start difference. First operand 567 states and 897 transitions. Second operand  has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:26:59,023 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:26:59,024 INFO  L93              Difference]: Finished difference Result 875 states and 1379 transitions.
[2025-03-08 12:26:59,024 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 12:26:59,025 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214
[2025-03-08 12:26:59,025 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:26:59,028 INFO  L225             Difference]: With dead ends: 875
[2025-03-08 12:26:59,028 INFO  L226             Difference]: Without dead ends: 551
[2025-03-08 12:26:59,030 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-08 12:26:59,030 INFO  L435           NwaCegarLoop]: 150 mSDtfsCounter, 106 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 12:26:59,030 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 437 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 12:26:59,032 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 551 states.
[2025-03-08 12:26:59,064 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 523.
[2025-03-08 12:26:59,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 523 states, 420 states have (on average 1.4833333333333334) internal successors, (623), 420 states have internal predecessors, (623), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99)
[2025-03-08 12:26:59,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 821 transitions.
[2025-03-08 12:26:59,069 INFO  L78                 Accepts]: Start accepts. Automaton has 523 states and 821 transitions. Word has length 214
[2025-03-08 12:26:59,069 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:26:59,070 INFO  L471      AbstractCegarLoop]: Abstraction has 523 states and 821 transitions.
[2025-03-08 12:26:59,070 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:26:59,070 INFO  L276                IsEmpty]: Start isEmpty. Operand 523 states and 821 transitions.
[2025-03-08 12:26:59,072 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 215
[2025-03-08 12:26:59,072 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:26:59,072 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 12:26:59,072 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 12:26:59,072 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:26:59,073 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:26:59,073 INFO  L85        PathProgramCache]: Analyzing trace with hash 1627756923, now seen corresponding path program 1 times
[2025-03-08 12:26:59,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:26:59,073 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002501376]
[2025-03-08 12:26:59,073 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:26:59,073 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:26:59,083 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes.
[2025-03-08 12:26:59,140 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements.
[2025-03-08 12:26:59,140 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:26:59,140 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:27:07,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 12:27:07,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:27:07,128 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002501376]
[2025-03-08 12:27:07,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002501376] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:27:07,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:27:07,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-03-08 12:27:07,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602044015]
[2025-03-08 12:27:07,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:27:07,128 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-03-08 12:27:07,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:27:07,129 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-03-08 12:27:07,129 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182
[2025-03-08 12:27:07,129 INFO  L87              Difference]: Start difference. First operand 523 states and 821 transitions. Second operand  has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:27:09,156 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:27:09,156 INFO  L93              Difference]: Finished difference Result 688 states and 1061 transitions.
[2025-03-08 12:27:09,160 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 12:27:09,160 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 214
[2025-03-08 12:27:09,160 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:27:09,162 INFO  L225             Difference]: With dead ends: 688
[2025-03-08 12:27:09,163 INFO  L226             Difference]: Without dead ends: 581
[2025-03-08 12:27:09,163 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506
[2025-03-08 12:27:09,166 INFO  L435           NwaCegarLoop]: 185 mSDtfsCounter, 403 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-08 12:27:09,166 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1307 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-08 12:27:09,167 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 581 states.
[2025-03-08 12:27:09,196 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 503.
[2025-03-08 12:27:09,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 503 states, 400 states have (on average 1.4825) internal successors, (593), 400 states have internal predecessors, (593), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99)
[2025-03-08 12:27:09,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 791 transitions.
[2025-03-08 12:27:09,201 INFO  L78                 Accepts]: Start accepts. Automaton has 503 states and 791 transitions. Word has length 214
[2025-03-08 12:27:09,202 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:27:09,202 INFO  L471      AbstractCegarLoop]: Abstraction has 503 states and 791 transitions.
[2025-03-08 12:27:09,203 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:27:09,203 INFO  L276                IsEmpty]: Start isEmpty. Operand 503 states and 791 transitions.
[2025-03-08 12:27:09,204 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-03-08 12:27:09,204 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:27:09,204 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 12:27:09,205 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 12:27:09,205 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:27:09,205 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:27:09,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -1912496682, now seen corresponding path program 1 times
[2025-03-08 12:27:09,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:27:09,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589498974]
[2025-03-08 12:27:09,205 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:27:09,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:27:09,214 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-08 12:27:09,265 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-08 12:27:09,266 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:27:09,266 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 12:27:38,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked.
[2025-03-08 12:27:38,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 12:27:38,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589498974]
[2025-03-08 12:27:38,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589498974] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 12:27:38,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 12:27:38,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-08 12:27:38,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800667085]
[2025-03-08 12:27:38,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 12:27:38,783 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-08 12:27:38,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 12:27:38,783 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-08 12:27:38,783 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2025-03-08 12:27:38,783 INFO  L87              Difference]: Start difference. First operand 503 states and 791 transitions. Second operand  has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:27:39,237 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 12:27:39,237 INFO  L93              Difference]: Finished difference Result 1092 states and 1685 transitions.
[2025-03-08 12:27:39,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-08 12:27:39,238 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 215
[2025-03-08 12:27:39,238 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 12:27:39,241 INFO  L225             Difference]: With dead ends: 1092
[2025-03-08 12:27:39,241 INFO  L226             Difference]: Without dead ends: 870
[2025-03-08 12:27:39,242 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2025-03-08 12:27:39,243 INFO  L435           NwaCegarLoop]: 187 mSDtfsCounter, 260 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 12:27:39,243 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1139 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 12:27:39,244 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 870 states.
[2025-03-08 12:27:39,274 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 702.
[2025-03-08 12:27:39,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 702 states, 592 states have (on average 1.4831081081081081) internal successors, (878), 593 states have internal predecessors, (878), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104)
[2025-03-08 12:27:39,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1086 transitions.
[2025-03-08 12:27:39,279 INFO  L78                 Accepts]: Start accepts. Automaton has 702 states and 1086 transitions. Word has length 215
[2025-03-08 12:27:39,279 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 12:27:39,279 INFO  L471      AbstractCegarLoop]: Abstraction has 702 states and 1086 transitions.
[2025-03-08 12:27:39,280 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33)
[2025-03-08 12:27:39,280 INFO  L276                IsEmpty]: Start isEmpty. Operand 702 states and 1086 transitions.
[2025-03-08 12:27:39,281 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-03-08 12:27:39,282 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 12:27:39,282 INFO  L218           NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 12:27:39,282 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 12:27:39,282 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 12:27:39,283 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 12:27:39,283 INFO  L85        PathProgramCache]: Analyzing trace with hash -667732201, now seen corresponding path program 1 times
[2025-03-08 12:27:39,283 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 12:27:39,283 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278039686]
[2025-03-08 12:27:39,283 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 12:27:39,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 12:27:39,291 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-08 12:27:39,323 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-08 12:27:39,323 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 12:27:39,323 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat