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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a0269ef8e9a97039e55b7063c2b754c2dc0d4d1e8e94f452102270054dac0b8
[2025-02-05 22:01:56,701 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 22:01:56,706 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 22:01:56,708 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 22:01:56,708 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 22:01:56,709 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 22:01:56,709 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-85.i
[2025-02-05 22:01:57,865 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3e7447f7/ef9d5c08120c43f7a46685de11d6629a/FLAG7e1d82943
[2025-02-05 22:01:58,195 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 22:01:58,197 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-85.i
[2025-02-05 22:01:58,213 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3e7447f7/ef9d5c08120c43f7a46685de11d6629a/FLAG7e1d82943
[2025-02-05 22:01:58,446 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3e7447f7/ef9d5c08120c43f7a46685de11d6629a
[2025-02-05 22:01:58,448 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 22:01:58,451 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 22:01:58,453 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 22:01:58,453 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 22:01:58,457 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 22:01:58,458 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:58,459 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58, skipping insertion in model container
[2025-02-05 22:01:58,460 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:58,490 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 22:01:58,607 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-85.i[916,929]
[2025-02-05 22:01:58,751 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 22:01:58,762 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 22:01:58,781 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-85.i[916,929]
[2025-02-05 22:01:58,858 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 22:01:58,875 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 22:01:58,875 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58 WrapperNode
[2025-02-05 22:01:58,876 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 22:01:58,876 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 22:01:58,876 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 22:01:58,876 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 22:01:58,880 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:58,894 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:58,945 INFO  L138                Inliner]: procedures = 26, calls = 113, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 855
[2025-02-05 22:01:58,945 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 22:01:58,945 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 22:01:58,946 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 22:01:58,946 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 22:01:58,953 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:58,953 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:58,964 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:58,999 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 22:01:58,999 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:58,999 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:59,026 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:59,036 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:59,043 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:59,047 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:59,061 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 22:01:59,063 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 22:01:59,063 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 22:01:59,063 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 22:01:59,064 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (1/1) ...
[2025-02-05 22:01:59,068 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 22:01:59,079 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 22:01:59,092 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 22:01:59,094 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 22:01:59,113 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 22:01:59,113 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-05 22:01:59,113 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-05 22:01:59,113 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 22:01:59,113 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 22:01:59,114 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 22:01:59,222 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 22:01:59,224 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 22:02:00,340 INFO  L?                        ?]: Removed 26 outVars from TransFormulas that were not future-live.
[2025-02-05 22:02:00,341 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 22:02:00,380 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 22:02:00,380 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 22:02:00,380 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:00 BoogieIcfgContainer
[2025-02-05 22:02:00,381 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 22:02:00,384 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 22:02:00,385 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 22:02:00,388 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 22:02:00,388 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:01:58" (1/3) ...
[2025-02-05 22:02:00,389 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f4f869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:00, skipping insertion in model container
[2025-02-05 22:02:00,390 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:58" (2/3) ...
[2025-02-05 22:02:00,390 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f4f869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:00, skipping insertion in model container
[2025-02-05 22:02:00,390 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:00" (3/3) ...
[2025-02-05 22:02:00,391 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-85.i
[2025-02-05 22:02:00,402 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 22:02:00,405 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-85.i that has 2 procedures, 351 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 22:02:00,470 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 22:02:00,481 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;@7a07e3ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 22:02:00,481 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 22:02:00,485 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 351 states, 248 states have (on average 1.6290322580645162) internal successors, (404), 249 states have internal predecessors, (404), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100)
[2025-02-05 22:02:00,506 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 643
[2025-02-05 22:02:00,506 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:02:00,507 INFO  L218           NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:02:00,508 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:02:00,511 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:02:00,512 INFO  L85        PathProgramCache]: Analyzing trace with hash -876989981, now seen corresponding path program 1 times
[2025-02-05 22:02:00,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:02:00,517 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053742207]
[2025-02-05 22:02:00,518 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:02:00,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:02:00,618 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes.
[2025-02-05 22:02:00,670 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements.
[2025-02-05 22:02:00,670 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:02:00,670 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:02:01,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 19602 trivial. 0 not checked.
[2025-02-05 22:02:01,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:02:01,074 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053742207]
[2025-02-05 22:02:01,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053742207] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 22:02:01,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589281874]
[2025-02-05 22:02:01,075 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:02:01,075 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 22:02:01,076 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 22:02:01,077 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 22:02:01,083 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 22:02:01,235 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes.
[2025-02-05 22:02:01,410 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements.
[2025-02-05 22:02:01,410 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:02:01,410 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:02:01,416 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-05 22:02:01,432 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 22:02:01,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 19800 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 19602 trivial. 0 not checked.
[2025-02-05 22:02:01,497 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 22:02:01,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [589281874] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:02:01,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 22:02:01,497 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-05 22:02:01,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072826349]
[2025-02-05 22:02:01,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:02:01,503 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 22:02:01,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:02:01,525 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 22:02:01,525 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 22:02:01,529 INFO  L87              Difference]: Start difference. First operand  has 351 states, 248 states have (on average 1.6290322580645162) internal successors, (404), 249 states have internal predecessors, (404), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand  has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (100), 2 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 2 states have call successors, (100)
[2025-02-05 22:02:01,632 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:02:01,633 INFO  L93              Difference]: Finished difference Result 696 states and 1303 transitions.
[2025-02-05 22:02:01,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 22:02:01,639 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (100), 2 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 2 states have call successors, (100) Word has length 642
[2025-02-05 22:02:01,639 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:02:01,648 INFO  L225             Difference]: With dead ends: 696
[2025-02-05 22:02:01,648 INFO  L226             Difference]: Without dead ends: 348
[2025-02-05 22:02:01,654 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 22:02:01,656 INFO  L435           NwaCegarLoop]: 578 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 22:02:01,656 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 22:02:01,667 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 348 states.
[2025-02-05 22:02:01,708 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348.
[2025-02-05 22:02:01,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 348 states, 246 states have (on average 1.613821138211382) internal successors, (397), 246 states have internal predecessors, (397), 100 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100)
[2025-02-05 22:02:01,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 597 transitions.
[2025-02-05 22:02:01,720 INFO  L78                 Accepts]: Start accepts. Automaton has 348 states and 597 transitions. Word has length 642
[2025-02-05 22:02:01,721 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:02:01,721 INFO  L471      AbstractCegarLoop]: Abstraction has 348 states and 597 transitions.
[2025-02-05 22:02:01,722 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (100), 2 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 2 states have call successors, (100)
[2025-02-05 22:02:01,722 INFO  L276                IsEmpty]: Start isEmpty. Operand 348 states and 597 transitions.
[2025-02-05 22:02:01,736 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 643
[2025-02-05 22:02:01,736 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:02:01,737 INFO  L218           NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:02:01,745 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 22:02:01,941 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-05 22:02:01,941 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:02:01,942 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:02:01,943 INFO  L85        PathProgramCache]: Analyzing trace with hash 494104475, now seen corresponding path program 1 times
[2025-02-05 22:02:01,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:02:01,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203069200]
[2025-02-05 22:02:01,943 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:02:01,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:02:01,989 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes.
[2025-02-05 22:02:02,101 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements.
[2025-02-05 22:02:02,101 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:02:02,101 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:02:02,580 INFO  L134       CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked.
[2025-02-05 22:02:02,580 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:02:02,580 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203069200]
[2025-02-05 22:02:02,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203069200] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:02:02,580 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:02:02,580 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 22:02:02,580 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362569390]
[2025-02-05 22:02:02,580 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:02:02,583 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 22:02:02,583 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:02:02,584 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 22:02:02,584 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 22:02:02,584 INFO  L87              Difference]: Start difference. First operand 348 states and 597 transitions. Second operand  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)
[2025-02-05 22:02:02,706 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:02:02,708 INFO  L93              Difference]: Finished difference Result 902 states and 1559 transitions.
[2025-02-05 22:02:02,708 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 22:02:02,709 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 642
[2025-02-05 22:02:02,710 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:02:02,715 INFO  L225             Difference]: With dead ends: 902
[2025-02-05 22:02:02,715 INFO  L226             Difference]: Without dead ends: 557
[2025-02-05 22:02:02,716 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 22:02:02,718 INFO  L435           NwaCegarLoop]: 832 mSDtfsCounter, 355 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 22:02:02,719 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1393 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 22:02:02,721 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 557 states.
[2025-02-05 22:02:02,778 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 554.
[2025-02-05 22:02:02,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 554 states, 436 states have (on average 1.6720183486238531) internal successors, (729), 437 states have internal predecessors, (729), 115 states have call successors, (115), 2 states have call predecessors, (115), 2 states have return successors, (115), 114 states have call predecessors, (115), 115 states have call successors, (115)
[2025-02-05 22:02:02,787 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 959 transitions.
[2025-02-05 22:02:02,788 INFO  L78                 Accepts]: Start accepts. Automaton has 554 states and 959 transitions. Word has length 642
[2025-02-05 22:02:02,789 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:02:02,789 INFO  L471      AbstractCegarLoop]: Abstraction has 554 states and 959 transitions.
[2025-02-05 22:02:02,789 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)
[2025-02-05 22:02:02,789 INFO  L276                IsEmpty]: Start isEmpty. Operand 554 states and 959 transitions.
[2025-02-05 22:02:02,793 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 644
[2025-02-05 22:02:02,793 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:02:02,794 INFO  L218           NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:02:02,794 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 22:02:02,794 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:02:02,794 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:02:02,795 INFO  L85        PathProgramCache]: Analyzing trace with hash 733757028, now seen corresponding path program 1 times
[2025-02-05 22:02:02,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:02:02,795 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745907009]
[2025-02-05 22:02:02,795 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:02:02,795 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:02:02,843 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes.
[2025-02-05 22:02:02,914 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements.
[2025-02-05 22:02:02,914 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:02:02,914 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:02:03,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked.
[2025-02-05 22:02:03,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:02:03,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745907009]
[2025-02-05 22:02:03,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745907009] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:02:03,127 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:02:03,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 22:02:03,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592116893]
[2025-02-05 22:02:03,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:02:03,128 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 22:02:03,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:02:03,131 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 22:02:03,132 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 22:02:03,132 INFO  L87              Difference]: Start difference. First operand 554 states and 959 transitions. Second operand  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)
[2025-02-05 22:02:03,248 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:02:03,249 INFO  L93              Difference]: Finished difference Result 1487 states and 2569 transitions.
[2025-02-05 22:02:03,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 22:02:03,249 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 643
[2025-02-05 22:02:03,250 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:02:03,256 INFO  L225             Difference]: With dead ends: 1487
[2025-02-05 22:02:03,256 INFO  L226             Difference]: Without dead ends: 936
[2025-02-05 22:02:03,258 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 22:02:03,258 INFO  L435           NwaCegarLoop]: 925 mSDtfsCounter, 394 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 22:02:03,259 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1482 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 22:02:03,260 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 936 states.
[2025-02-05 22:02:03,325 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 933.
[2025-02-05 22:02:03,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 933 states, 729 states have (on average 1.6529492455418382) internal successors, (1205), 732 states have internal predecessors, (1205), 199 states have call successors, (199), 4 states have call predecessors, (199), 4 states have return successors, (199), 196 states have call predecessors, (199), 199 states have call successors, (199)
[2025-02-05 22:02:03,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1603 transitions.
[2025-02-05 22:02:03,335 INFO  L78                 Accepts]: Start accepts. Automaton has 933 states and 1603 transitions. Word has length 643
[2025-02-05 22:02:03,336 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:02:03,337 INFO  L471      AbstractCegarLoop]: Abstraction has 933 states and 1603 transitions.
[2025-02-05 22:02:03,337 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)
[2025-02-05 22:02:03,337 INFO  L276                IsEmpty]: Start isEmpty. Operand 933 states and 1603 transitions.
[2025-02-05 22:02:03,344 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 644
[2025-02-05 22:02:03,344 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:02:03,345 INFO  L218           NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:02:03,345 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 22:02:03,345 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:02:03,346 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:02:03,346 INFO  L85        PathProgramCache]: Analyzing trace with hash 1623631877, now seen corresponding path program 1 times
[2025-02-05 22:02:03,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:02:03,346 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127468340]
[2025-02-05 22:02:03,346 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:02:03,346 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:02:03,380 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes.
[2025-02-05 22:02:03,432 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements.
[2025-02-05 22:02:03,432 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:02:03,432 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:02:03,737 INFO  L134       CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked.
[2025-02-05 22:02:03,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:02:03,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127468340]
[2025-02-05 22:02:03,737 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127468340] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:02:03,738 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:02:03,738 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 22:02:03,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081182000]
[2025-02-05 22:02:03,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:02:03,739 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 22:02:03,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:02:03,740 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 22:02:03,740 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 22:02:03,741 INFO  L87              Difference]: Start difference. First operand 933 states and 1603 transitions. Second operand  has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)
[2025-02-05 22:02:04,309 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:02:04,310 INFO  L93              Difference]: Finished difference Result 3498 states and 6018 transitions.
[2025-02-05 22:02:04,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 22:02:04,311 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 643
[2025-02-05 22:02:04,312 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:02:04,327 INFO  L225             Difference]: With dead ends: 3498
[2025-02-05 22:02:04,327 INFO  L226             Difference]: Without dead ends: 2568
[2025-02-05 22:02:04,331 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-05 22:02:04,333 INFO  L435           NwaCegarLoop]: 821 mSDtfsCounter, 763 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 22:02:04,334 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1848 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 22:02:04,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2568 states.
[2025-02-05 22:02:04,525 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2562.
[2025-02-05 22:02:04,531 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2562 states, 2051 states have (on average 1.6567528035104826) internal successors, (3398), 2061 states have internal predecessors, (3398), 498 states have call successors, (498), 12 states have call predecessors, (498), 12 states have return successors, (498), 488 states have call predecessors, (498), 498 states have call successors, (498)
[2025-02-05 22:02:04,547 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 4394 transitions.
[2025-02-05 22:02:04,550 INFO  L78                 Accepts]: Start accepts. Automaton has 2562 states and 4394 transitions. Word has length 643
[2025-02-05 22:02:04,551 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:02:04,551 INFO  L471      AbstractCegarLoop]: Abstraction has 2562 states and 4394 transitions.
[2025-02-05 22:02:04,552 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)
[2025-02-05 22:02:04,552 INFO  L276                IsEmpty]: Start isEmpty. Operand 2562 states and 4394 transitions.
[2025-02-05 22:02:04,560 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 645
[2025-02-05 22:02:04,560 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:02:04,561 INFO  L218           NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:02:04,561 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 22:02:04,561 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:02:04,562 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:02:04,562 INFO  L85        PathProgramCache]: Analyzing trace with hash -1643846409, now seen corresponding path program 1 times
[2025-02-05 22:02:04,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:02:04,562 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536075210]
[2025-02-05 22:02:04,562 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:02:04,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:02:04,603 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes.
[2025-02-05 22:02:04,645 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements.
[2025-02-05 22:02:04,645 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:02:04,645 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:02:04,922 INFO  L134       CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked.
[2025-02-05 22:02:04,922 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:02:04,922 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536075210]
[2025-02-05 22:02:04,922 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536075210] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:02:04,922 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:02:04,922 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 22:02:04,922 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837267683]
[2025-02-05 22:02:04,923 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:02:04,924 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 22:02:04,924 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:02:04,924 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 22:02:04,925 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 22:02:04,925 INFO  L87              Difference]: Start difference. First operand 2562 states and 4394 transitions. Second operand  has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)
[2025-02-05 22:02:05,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:02:05,301 INFO  L93              Difference]: Finished difference Result 5810 states and 9986 transitions.
[2025-02-05 22:02:05,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 22:02:05,302 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 644
[2025-02-05 22:02:05,302 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:02:05,328 INFO  L225             Difference]: With dead ends: 5810
[2025-02-05 22:02:05,329 INFO  L226             Difference]: Without dead ends: 4880
[2025-02-05 22:02:05,334 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-05 22:02:05,336 INFO  L435           NwaCegarLoop]: 1139 mSDtfsCounter, 1364 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 22:02:05,336 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 2987 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 22:02:05,340 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4880 states.
[2025-02-05 22:02:05,561 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4868.
[2025-02-05 22:02:05,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4868 states, 3946 states have (on average 1.6662442980233148) internal successors, (6575), 3967 states have internal predecessors, (6575), 897 states have call successors, (897), 24 states have call predecessors, (897), 24 states have return successors, (897), 876 states have call predecessors, (897), 897 states have call successors, (897)
[2025-02-05 22:02:05,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 8369 transitions.
[2025-02-05 22:02:05,598 INFO  L78                 Accepts]: Start accepts. Automaton has 4868 states and 8369 transitions. Word has length 644
[2025-02-05 22:02:05,599 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:02:05,599 INFO  L471      AbstractCegarLoop]: Abstraction has 4868 states and 8369 transitions.
[2025-02-05 22:02:05,600 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)
[2025-02-05 22:02:05,600 INFO  L276                IsEmpty]: Start isEmpty. Operand 4868 states and 8369 transitions.
[2025-02-05 22:02:05,607 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 646
[2025-02-05 22:02:05,607 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:02:05,608 INFO  L218           NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:02:05,608 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 22:02:05,608 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:02:05,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:02:05,609 INFO  L85        PathProgramCache]: Analyzing trace with hash 236654037, now seen corresponding path program 1 times
[2025-02-05 22:02:05,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:02:05,609 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715297601]
[2025-02-05 22:02:05,609 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:02:05,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:02:05,640 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes.
[2025-02-05 22:02:05,727 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements.
[2025-02-05 22:02:05,728 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:02:05,728 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:02:06,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked.
[2025-02-05 22:02:06,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:02:06,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715297601]
[2025-02-05 22:02:06,455 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715297601] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:02:06,455 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:02:06,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 22:02:06,456 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540345042]
[2025-02-05 22:02:06,456 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:02:06,456 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 22:02:06,457 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:02:06,457 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 22:02:06,457 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 22:02:06,458 INFO  L87              Difference]: Start difference. First operand 4868 states and 8369 transitions. Second operand  has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)
[2025-02-05 22:02:07,262 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:02:07,262 INFO  L93              Difference]: Finished difference Result 18476 states and 31840 transitions.
[2025-02-05 22:02:07,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-05 22:02:07,263 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 645
[2025-02-05 22:02:07,264 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:02:07,346 INFO  L225             Difference]: With dead ends: 18476
[2025-02-05 22:02:07,346 INFO  L226             Difference]: Without dead ends: 15240
[2025-02-05 22:02:07,365 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-02-05 22:02:07,365 INFO  L435           NwaCegarLoop]: 1269 mSDtfsCounter, 1166 mSDsluCounter, 2985 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 4254 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 22:02:07,366 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 4254 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 22:02:07,382 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15240 states.
[2025-02-05 22:02:07,973 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15240 to 12193.
[2025-02-05 22:02:08,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12193 states, 10116 states have (on average 1.6785290628707) internal successors, (16980), 10176 states have internal predecessors, (16980), 2012 states have call successors, (2012), 64 states have call predecessors, (2012), 64 states have return successors, (2012), 1952 states have call predecessors, (2012), 2012 states have call successors, (2012)
[2025-02-05 22:02:08,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12193 states to 12193 states and 21004 transitions.
[2025-02-05 22:02:08,046 INFO  L78                 Accepts]: Start accepts. Automaton has 12193 states and 21004 transitions. Word has length 645
[2025-02-05 22:02:08,047 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:02:08,047 INFO  L471      AbstractCegarLoop]: Abstraction has 12193 states and 21004 transitions.
[2025-02-05 22:02:08,050 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)
[2025-02-05 22:02:08,051 INFO  L276                IsEmpty]: Start isEmpty. Operand 12193 states and 21004 transitions.
[2025-02-05 22:02:08,064 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 646
[2025-02-05 22:02:08,064 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:02:08,064 INFO  L218           NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:02:08,064 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 22:02:08,065 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:02:08,065 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:02:08,065 INFO  L85        PathProgramCache]: Analyzing trace with hash -199524970, now seen corresponding path program 1 times
[2025-02-05 22:02:08,065 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:02:08,065 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691492668]
[2025-02-05 22:02:08,065 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:02:08,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:02:08,092 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes.
[2025-02-05 22:02:08,168 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements.
[2025-02-05 22:02:08,168 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:02:08,168 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:02:08,946 INFO  L134       CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked.
[2025-02-05 22:02:08,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:02:08,947 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691492668]
[2025-02-05 22:02:08,947 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691492668] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:02:08,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:02:08,947 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-02-05 22:02:08,947 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630557646]
[2025-02-05 22:02:08,947 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:02:08,948 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-05 22:02:08,948 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:02:08,949 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-05 22:02:08,949 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-02-05 22:02:08,952 INFO  L87              Difference]: Start difference. First operand 12193 states and 21004 transitions. Second operand  has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 2 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 2 states have call predecessors, (100), 2 states have call successors, (100)
[2025-02-05 22:02:12,226 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:02:12,227 INFO  L93              Difference]: Finished difference Result 53406 states and 91734 transitions.
[2025-02-05 22:02:12,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-02-05 22:02:12,228 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 2 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 2 states have call predecessors, (100), 2 states have call successors, (100) Word has length 645
[2025-02-05 22:02:12,229 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:02:12,366 INFO  L225             Difference]: With dead ends: 53406
[2025-02-05 22:02:12,366 INFO  L226             Difference]: Without dead ends: 41216
[2025-02-05 22:02:12,406 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132
[2025-02-05 22:02:12,407 INFO  L435           NwaCegarLoop]: 1571 mSDtfsCounter, 1695 mSDsluCounter, 4626 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 6197 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 22:02:12,408 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 6197 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 22:02:12,440 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41216 states.
[2025-02-05 22:02:13,567 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41216 to 27380.
[2025-02-05 22:02:13,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27380 states, 22708 states have (on average 1.672978685925665) internal successors, (37990), 22843 states have internal predecessors, (37990), 4527 states have call successors, (4527), 144 states have call predecessors, (4527), 144 states have return successors, (4527), 4392 states have call predecessors, (4527), 4527 states have call successors, (4527)
[2025-02-05 22:02:13,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27380 states to 27380 states and 47044 transitions.
[2025-02-05 22:02:13,689 INFO  L78                 Accepts]: Start accepts. Automaton has 27380 states and 47044 transitions. Word has length 645
[2025-02-05 22:02:13,691 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:02:13,691 INFO  L471      AbstractCegarLoop]: Abstraction has 27380 states and 47044 transitions.
[2025-02-05 22:02:13,692 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 2 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 2 states have call predecessors, (100), 2 states have call successors, (100)
[2025-02-05 22:02:13,692 INFO  L276                IsEmpty]: Start isEmpty. Operand 27380 states and 47044 transitions.
[2025-02-05 22:02:13,712 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 647
[2025-02-05 22:02:13,712 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:02:13,712 INFO  L218           NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:02:13,712 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 22:02:13,712 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:02:13,713 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:02:13,713 INFO  L85        PathProgramCache]: Analyzing trace with hash 2000654590, now seen corresponding path program 1 times
[2025-02-05 22:02:13,714 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:02:13,714 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211637788]
[2025-02-05 22:02:13,714 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:02:13,714 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:02:13,749 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes.
[2025-02-05 22:02:13,775 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements.
[2025-02-05 22:02:13,776 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:02:13,776 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:02:13,883 INFO  L134       CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked.
[2025-02-05 22:02:13,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:02:13,884 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211637788]
[2025-02-05 22:02:13,884 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211637788] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:02:13,884 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:02:13,884 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 22:02:13,884 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107581037]
[2025-02-05 22:02:13,884 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:02:13,885 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 22:02:13,885 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:02:13,885 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 22:02:13,885 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 22:02:13,885 INFO  L87              Difference]: Start difference. First operand 27380 states and 47044 transitions. Second operand  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)
[2025-02-05 22:02:15,254 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:02:15,255 INFO  L93              Difference]: Finished difference Result 73659 states and 125732 transitions.
[2025-02-05 22:02:15,257 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 22:02:15,258 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100) Word has length 646
[2025-02-05 22:02:15,259 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:02:15,442 INFO  L225             Difference]: With dead ends: 73659
[2025-02-05 22:02:15,442 INFO  L226             Difference]: Without dead ends: 46282
[2025-02-05 22:02:15,511 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 22:02:15,511 INFO  L435           NwaCegarLoop]: 576 mSDtfsCounter, 375 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 22:02:15,512 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1137 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 22:02:15,545 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46282 states.
[2025-02-05 22:02:17,230 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46282 to 46271.
[2025-02-05 22:02:17,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 46271 states, 37189 states have (on average 1.6331442093092043) internal successors, (60735), 37468 states have internal predecessors, (60735), 8793 states have call successors, (8793), 288 states have call predecessors, (8793), 288 states have return successors, (8793), 8514 states have call predecessors, (8793), 8793 states have call successors, (8793)
[2025-02-05 22:02:17,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46271 states to 46271 states and 78321 transitions.
[2025-02-05 22:02:17,450 INFO  L78                 Accepts]: Start accepts. Automaton has 46271 states and 78321 transitions. Word has length 646
[2025-02-05 22:02:17,451 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:02:17,451 INFO  L471      AbstractCegarLoop]: Abstraction has 46271 states and 78321 transitions.
[2025-02-05 22:02:17,452 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 1 states have call predecessors, (100), 1 states have call successors, (100)
[2025-02-05 22:02:17,452 INFO  L276                IsEmpty]: Start isEmpty. Operand 46271 states and 78321 transitions.
[2025-02-05 22:02:17,486 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 647
[2025-02-05 22:02:17,486 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:02:17,487 INFO  L218           NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:02:17,487 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 22:02:17,487 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:02:17,487 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:02:17,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 1146610077, now seen corresponding path program 1 times
[2025-02-05 22:02:17,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:02:17,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251106900]
[2025-02-05 22:02:17,488 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:02:17,488 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:02:17,710 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes.
[2025-02-05 22:02:17,785 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements.
[2025-02-05 22:02:17,785 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:02:17,785 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:02:24,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked.
[2025-02-05 22:02:24,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:02:24,313 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251106900]
[2025-02-05 22:02:24,313 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251106900] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:02:24,313 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:02:24,313 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-02-05 22:02:24,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295681819]
[2025-02-05 22:02:24,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:02:24,314 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-02-05 22:02:24,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:02:24,314 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-02-05 22:02:24,315 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2025-02-05 22:02:24,315 INFO  L87              Difference]: Start difference. First operand 46271 states and 78321 transitions. Second operand  has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 3 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 3 states have call predecessors, (100), 3 states have call successors, (100)
[2025-02-05 22:02:56,359 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 22:02:56,360 INFO  L93              Difference]: Finished difference Result 266254 states and 448596 transitions.
[2025-02-05 22:02:56,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2025-02-05 22:02:56,361 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 3 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 3 states have call predecessors, (100), 3 states have call successors, (100) Word has length 646
[2025-02-05 22:02:56,361 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 22:02:57,162 INFO  L225             Difference]: With dead ends: 266254
[2025-02-05 22:02:57,162 INFO  L226             Difference]: Without dead ends: 219986
[2025-02-05 22:02:57,301 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=397, Invalid=1325, Unknown=0, NotChecked=0, Total=1722
[2025-02-05 22:02:57,302 INFO  L435           NwaCegarLoop]: 1172 mSDtfsCounter, 6318 mSDsluCounter, 9585 mSDsCounter, 0 mSdLazyCounter, 6869 mSolverCounterSat, 1431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6318 SdHoareTripleChecker+Valid, 10757 SdHoareTripleChecker+Invalid, 8300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1431 IncrementalHoareTripleChecker+Valid, 6869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time
[2025-02-05 22:02:57,302 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [6318 Valid, 10757 Invalid, 8300 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1431 Valid, 6869 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time]
[2025-02-05 22:02:57,429 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 219986 states.
[2025-02-05 22:03:06,545 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 219986 to 122651.
[2025-02-05 22:03:06,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 122651 states, 99720 states have (on average 1.6317689530685922) internal successors, (162720), 100470 states have internal predecessors, (162720), 22130 states have call successors, (22130), 800 states have call predecessors, (22130), 800 states have return successors, (22130), 21380 states have call predecessors, (22130), 22130 states have call successors, (22130)
[2025-02-05 22:03:06,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 122651 states to 122651 states and 206980 transitions.
[2025-02-05 22:03:07,138 INFO  L78                 Accepts]: Start accepts. Automaton has 122651 states and 206980 transitions. Word has length 646
[2025-02-05 22:03:07,139 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 22:03:07,139 INFO  L471      AbstractCegarLoop]: Abstraction has 122651 states and 206980 transitions.
[2025-02-05 22:03:07,140 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 12.416666666666666) internal successors, (149), 12 states have internal predecessors, (149), 3 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 3 states have call predecessors, (100), 3 states have call successors, (100)
[2025-02-05 22:03:07,140 INFO  L276                IsEmpty]: Start isEmpty. Operand 122651 states and 206980 transitions.
[2025-02-05 22:03:07,180 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 647
[2025-02-05 22:03:07,180 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 22:03:07,180 INFO  L218           NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 22:03:07,180 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 22:03:07,181 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 22:03:07,181 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 22:03:07,181 INFO  L85        PathProgramCache]: Analyzing trace with hash 509962748, now seen corresponding path program 1 times
[2025-02-05 22:03:07,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 22:03:07,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768733618]
[2025-02-05 22:03:07,182 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 22:03:07,182 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 22:03:07,208 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 646 statements into 1 equivalence classes.
[2025-02-05 22:03:07,516 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 646 of 646 statements.
[2025-02-05 22:03:07,516 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 22:03:07,516 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 22:03:16,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 19800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19800 trivial. 0 not checked.
[2025-02-05 22:03:16,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 22:03:16,536 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768733618]
[2025-02-05 22:03:16,536 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768733618] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 22:03:16,536 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 22:03:16,536 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-02-05 22:03:16,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927257224]
[2025-02-05 22:03:16,536 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 22:03:16,537 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-02-05 22:03:16,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 22:03:16,538 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-02-05 22:03:16,538 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2025-02-05 22:03:16,538 INFO  L87              Difference]: Start difference. First operand 122651 states and 206980 transitions. Second operand  has 11 states, 11 states have (on average 13.545454545454545) internal successors, (149), 11 states have internal predecessors, (149), 3 states have call successors, (100), 1 states have call predecessors, (100), 1 states have return successors, (100), 3 states have call predecessors, (100), 3 states have call successors, (100)