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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13f0d023cf70be0ab2bade1c9c2a45b94596f842e278edf3cfbd034e77d4c50c
[2025-03-03 19:49:00,294 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 19:49:00,304 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 19:49:00,305 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 19:49:00,306 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 19:49:00,306 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 19:49:00,307 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i
[2025-03-03 19:49:01,454 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ace573b8e/b22bcdb3e5d8444a883af514e64909ef/FLAGee96d7709
[2025-03-03 19:49:01,712 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 19:49:01,714 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i
[2025-03-03 19:49:01,728 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ace573b8e/b22bcdb3e5d8444a883af514e64909ef/FLAGee96d7709
[2025-03-03 19:49:02,014 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ace573b8e/b22bcdb3e5d8444a883af514e64909ef
[2025-03-03 19:49:02,016 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 19:49:02,017 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 19:49:02,018 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 19:49:02,018 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 19:49:02,021 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 19:49:02,022 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,022 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3989e791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02, skipping insertion in model container
[2025-03-03 19:49:02,022 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,042 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 19:49:02,157 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i[916,929]
[2025-03-03 19:49:02,285 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 19:49:02,294 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 19:49:02,301 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-59.i[916,929]
[2025-03-03 19:49:02,343 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 19:49:02,363 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 19:49:02,363 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02 WrapperNode
[2025-03-03 19:49:02,364 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 19:49:02,364 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 19:49:02,364 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 19:49:02,364 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 19:49:02,370 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,381 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,419 INFO  L138                Inliner]: procedures = 26, calls = 72, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458
[2025-03-03 19:49:02,419 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 19:49:02,420 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 19:49:02,420 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 19:49:02,420 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 19:49:02,427 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,428 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,438 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,465 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-03 19:49:02,465 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,465 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,486 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,490 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,497 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,500 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,515 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 19:49:02,515 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 19:49:02,515 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 19:49:02,515 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 19:49:02,517 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (1/1) ...
[2025-03-03 19:49:02,521 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 19:49:02,531 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:49:02,544 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-03 19:49:02,549 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-03 19:49:02,566 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 19:49:02,567 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 19:49:02,567 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 19:49:02,567 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 19:49:02,567 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 19:49:02,568 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 19:49:02,671 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 19:49:02,673 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 19:49:03,365 INFO  L?                        ?]: Removed 20 outVars from TransFormulas that were not future-live.
[2025-03-03 19:49:03,365 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 19:49:03,381 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 19:49:03,382 INFO  L336             CfgBuilder]: Removed 2 assume(true) statements.
[2025-03-03 19:49:03,382 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:49:03 BoogieIcfgContainer
[2025-03-03 19:49:03,382 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 19:49:03,384 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 19:49:03,384 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 19:49:03,387 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 19:49:03,388 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:49:02" (1/3) ...
[2025-03-03 19:49:03,388 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d26f749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:49:03, skipping insertion in model container
[2025-03-03 19:49:03,388 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:49:02" (2/3) ...
[2025-03-03 19:49:03,388 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d26f749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:49:03, skipping insertion in model container
[2025-03-03 19:49:03,388 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:49:03" (3/3) ...
[2025-03-03 19:49:03,389 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-59.i
[2025-03-03 19:49:03,400 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 19:49:03,406 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-59.i that has 2 procedures, 194 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 19:49:03,482 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 19:49:03,491 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;@19820bd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 19:49:03,491 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 19:49:03,497 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 194 states, 132 states have (on average 1.553030303030303) internal successors, (205), 133 states have internal predecessors, (205), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59)
[2025-03-03 19:49:03,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 382
[2025-03-03 19:49:03,514 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:03,516 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:03,516 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:03,521 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:03,522 INFO  L85        PathProgramCache]: Analyzing trace with hash -242777663, now seen corresponding path program 1 times
[2025-03-03 19:49:03,527 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:03,527 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094506692]
[2025-03-03 19:49:03,528 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:03,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:03,622 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes.
[2025-03-03 19:49:03,663 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements.
[2025-03-03 19:49:03,664 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:03,665 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:03,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked.
[2025-03-03 19:49:03,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:03,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094506692]
[2025-03-03 19:49:03,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094506692] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 19:49:03,960 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369208248]
[2025-03-03 19:49:03,960 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:03,960 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 19:49:03,960 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:49:03,963 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 19:49:03,964 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-03 19:49:04,078 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes.
[2025-03-03 19:49:04,199 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements.
[2025-03-03 19:49:04,199 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:04,199 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:04,205 INFO  L256         TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 19:49:04,219 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:49:04,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked.
[2025-03-03 19:49:04,261 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 19:49:04,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369208248] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:04,261 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 19:49:04,262 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-03 19:49:04,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41096530]
[2025-03-03 19:49:04,264 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:04,269 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 19:49:04,270 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:04,289 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 19:49:04,289 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 19:49:04,292 INFO  L87              Difference]: Start difference. First operand  has 194 states, 132 states have (on average 1.553030303030303) internal successors, (205), 133 states have internal predecessors, (205), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand  has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (59), 2 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 2 states have call successors, (59)
[2025-03-03 19:49:04,357 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:04,358 INFO  L93              Difference]: Finished difference Result 382 states and 700 transitions.
[2025-03-03 19:49:04,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 19:49:04,360 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (59), 2 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 2 states have call successors, (59) Word has length 381
[2025-03-03 19:49:04,360 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:04,366 INFO  L225             Difference]: With dead ends: 382
[2025-03-03 19:49:04,366 INFO  L226             Difference]: Without dead ends: 191
[2025-03-03 19:49:04,369 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 19:49:04,371 INFO  L435           NwaCegarLoop]: 311 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:04,372 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:49:04,384 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2025-03-03 19:49:04,417 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191.
[2025-03-03 19:49:04,418 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 191 states, 130 states have (on average 1.5307692307692307) internal successors, (199), 130 states have internal predecessors, (199), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59)
[2025-03-03 19:49:04,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 317 transitions.
[2025-03-03 19:49:04,432 INFO  L78                 Accepts]: Start accepts. Automaton has 191 states and 317 transitions. Word has length 381
[2025-03-03 19:49:04,433 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:04,433 INFO  L471      AbstractCegarLoop]: Abstraction has 191 states and 317 transitions.
[2025-03-03 19:49:04,434 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (59), 2 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 2 states have call successors, (59)
[2025-03-03 19:49:04,434 INFO  L276                IsEmpty]: Start isEmpty. Operand 191 states and 317 transitions.
[2025-03-03 19:49:04,440 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 382
[2025-03-03 19:49:04,441 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:04,441 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:04,452 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-03 19:49:04,641 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-03 19:49:04,642 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:04,642 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:04,642 INFO  L85        PathProgramCache]: Analyzing trace with hash -502614042, now seen corresponding path program 1 times
[2025-03-03 19:49:04,643 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:04,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471386982]
[2025-03-03 19:49:04,643 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:04,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:04,678 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes.
[2025-03-03 19:49:04,768 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements.
[2025-03-03 19:49:04,768 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:04,768 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:05,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:49:05,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:05,436 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471386982]
[2025-03-03 19:49:05,438 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471386982] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:05,438 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:49:05,438 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 19:49:05,438 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9100343]
[2025-03-03 19:49:05,438 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:05,439 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 19:49:05,439 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:05,440 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 19:49:05,440 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 19:49:05,440 INFO  L87              Difference]: Start difference. First operand 191 states and 317 transitions. Second operand  has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:05,763 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:05,763 INFO  L93              Difference]: Finished difference Result 568 states and 946 transitions.
[2025-03-03 19:49:05,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 19:49:05,764 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 381
[2025-03-03 19:49:05,765 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:05,771 INFO  L225             Difference]: With dead ends: 568
[2025-03-03 19:49:05,772 INFO  L226             Difference]: Without dead ends: 380
[2025-03-03 19:49:05,774 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:49:05,776 INFO  L435           NwaCegarLoop]: 308 mSDtfsCounter, 298 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:05,777 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 917 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 19:49:05,778 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 380 states.
[2025-03-03 19:49:05,856 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 361.
[2025-03-03 19:49:05,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 361 states, 240 states have (on average 1.5291666666666666) internal successors, (367), 240 states have internal predecessors, (367), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118)
[2025-03-03 19:49:05,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 603 transitions.
[2025-03-03 19:49:05,863 INFO  L78                 Accepts]: Start accepts. Automaton has 361 states and 603 transitions. Word has length 381
[2025-03-03 19:49:05,864 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:05,866 INFO  L471      AbstractCegarLoop]: Abstraction has 361 states and 603 transitions.
[2025-03-03 19:49:05,866 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:05,866 INFO  L276                IsEmpty]: Start isEmpty. Operand 361 states and 603 transitions.
[2025-03-03 19:49:05,869 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 383
[2025-03-03 19:49:05,870 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:05,870 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:05,870 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 19:49:05,871 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:05,871 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:05,871 INFO  L85        PathProgramCache]: Analyzing trace with hash -1615736225, now seen corresponding path program 1 times
[2025-03-03 19:49:05,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:05,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69419078]
[2025-03-03 19:49:05,874 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:05,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:05,909 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes.
[2025-03-03 19:49:05,944 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements.
[2025-03-03 19:49:05,945 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:05,945 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:06,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:49:06,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:06,307 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69419078]
[2025-03-03 19:49:06,307 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69419078] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:06,307 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:49:06,308 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 19:49:06,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245956642]
[2025-03-03 19:49:06,308 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:06,308 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 19:49:06,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:06,309 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 19:49:06,309 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:49:06,309 INFO  L87              Difference]: Start difference. First operand 361 states and 603 transitions. Second operand  has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:06,592 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:06,592 INFO  L93              Difference]: Finished difference Result 887 states and 1504 transitions.
[2025-03-03 19:49:06,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:49:06,593 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 382
[2025-03-03 19:49:06,594 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:06,598 INFO  L225             Difference]: With dead ends: 887
[2025-03-03 19:49:06,598 INFO  L226             Difference]: Without dead ends: 695
[2025-03-03 19:49:06,599 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:49:06,599 INFO  L435           NwaCegarLoop]: 286 mSDtfsCounter, 444 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:06,600 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 940 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 19:49:06,601 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 695 states.
[2025-03-03 19:49:06,657 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 634.
[2025-03-03 19:49:06,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 634 states, 497 states have (on average 1.663983903420523) internal successors, (827), 498 states have internal predecessors, (827), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 131 states have call predecessors, (132), 132 states have call successors, (132)
[2025-03-03 19:49:06,663 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1091 transitions.
[2025-03-03 19:49:06,664 INFO  L78                 Accepts]: Start accepts. Automaton has 634 states and 1091 transitions. Word has length 382
[2025-03-03 19:49:06,665 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:06,665 INFO  L471      AbstractCegarLoop]: Abstraction has 634 states and 1091 transitions.
[2025-03-03 19:49:06,665 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:06,666 INFO  L276                IsEmpty]: Start isEmpty. Operand 634 states and 1091 transitions.
[2025-03-03 19:49:06,670 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 383
[2025-03-03 19:49:06,670 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:06,670 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:06,671 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 19:49:06,671 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:06,672 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:06,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -2126270402, now seen corresponding path program 1 times
[2025-03-03 19:49:06,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:06,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191911824]
[2025-03-03 19:49:06,673 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:06,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:06,697 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes.
[2025-03-03 19:49:06,814 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements.
[2025-03-03 19:49:06,814 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:06,814 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:07,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:49:07,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:07,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191911824]
[2025-03-03 19:49:07,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191911824] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:07,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:49:07,134 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 19:49:07,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624996443]
[2025-03-03 19:49:07,134 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:07,135 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 19:49:07,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:07,135 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 19:49:07,135 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:49:07,136 INFO  L87              Difference]: Start difference. First operand 634 states and 1091 transitions. Second operand  has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59)
[2025-03-03 19:49:07,577 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:07,577 INFO  L93              Difference]: Finished difference Result 1426 states and 2453 transitions.
[2025-03-03 19:49:07,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:49:07,578 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 382
[2025-03-03 19:49:07,579 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:07,586 INFO  L225             Difference]: With dead ends: 1426
[2025-03-03 19:49:07,586 INFO  L226             Difference]: Without dead ends: 1076
[2025-03-03 19:49:07,587 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:49:07,588 INFO  L435           NwaCegarLoop]: 329 mSDtfsCounter, 549 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:07,588 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 758 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 19:49:07,589 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1076 states.
[2025-03-03 19:49:07,664 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 784.
[2025-03-03 19:49:07,666 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 784 states, 647 states have (on average 1.714064914992272) internal successors, (1109), 648 states have internal predecessors, (1109), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 131 states have call predecessors, (132), 132 states have call successors, (132)
[2025-03-03 19:49:07,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1373 transitions.
[2025-03-03 19:49:07,671 INFO  L78                 Accepts]: Start accepts. Automaton has 784 states and 1373 transitions. Word has length 382
[2025-03-03 19:49:07,672 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:07,672 INFO  L471      AbstractCegarLoop]: Abstraction has 784 states and 1373 transitions.
[2025-03-03 19:49:07,672 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59)
[2025-03-03 19:49:07,672 INFO  L276                IsEmpty]: Start isEmpty. Operand 784 states and 1373 transitions.
[2025-03-03 19:49:07,678 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 383
[2025-03-03 19:49:07,678 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:07,679 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:07,679 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 19:49:07,679 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:07,680 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:07,680 INFO  L85        PathProgramCache]: Analyzing trace with hash 1990404060, now seen corresponding path program 1 times
[2025-03-03 19:49:07,680 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:07,681 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297263763]
[2025-03-03 19:49:07,681 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:07,681 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:07,707 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes.
[2025-03-03 19:49:07,734 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements.
[2025-03-03 19:49:07,734 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:07,734 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:07,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:49:07,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:07,828 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297263763]
[2025-03-03 19:49:07,828 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297263763] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:07,828 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:49:07,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 19:49:07,828 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830007526]
[2025-03-03 19:49:07,828 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:07,828 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 19:49:07,828 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:07,829 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 19:49:07,829 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:49:07,829 INFO  L87              Difference]: Start difference. First operand 784 states and 1373 transitions. Second operand  has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:07,913 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:07,913 INFO  L93              Difference]: Finished difference Result 1942 states and 3443 transitions.
[2025-03-03 19:49:07,914 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 19:49:07,914 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 382
[2025-03-03 19:49:07,915 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:07,920 INFO  L225             Difference]: With dead ends: 1942
[2025-03-03 19:49:07,920 INFO  L226             Difference]: Without dead ends: 1372
[2025-03-03 19:49:07,922 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 19:49:07,923 INFO  L435           NwaCegarLoop]: 400 mSDtfsCounter, 196 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:07,923 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 686 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 19:49:07,924 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1372 states.
[2025-03-03 19:49:07,974 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1369.
[2025-03-03 19:49:07,976 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1369 states, 1187 states have (on average 1.709351305812974) internal successors, (2029), 1190 states have internal predecessors, (2029), 174 states have call successors, (174), 7 states have call predecessors, (174), 7 states have return successors, (174), 171 states have call predecessors, (174), 174 states have call successors, (174)
[2025-03-03 19:49:07,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2377 transitions.
[2025-03-03 19:49:07,982 INFO  L78                 Accepts]: Start accepts. Automaton has 1369 states and 2377 transitions. Word has length 382
[2025-03-03 19:49:07,982 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:07,982 INFO  L471      AbstractCegarLoop]: Abstraction has 1369 states and 2377 transitions.
[2025-03-03 19:49:07,983 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:07,983 INFO  L276                IsEmpty]: Start isEmpty. Operand 1369 states and 2377 transitions.
[2025-03-03 19:49:07,986 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 383
[2025-03-03 19:49:07,986 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:07,986 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:07,986 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 19:49:07,987 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:07,988 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:07,988 INFO  L85        PathProgramCache]: Analyzing trace with hash 2103098971, now seen corresponding path program 1 times
[2025-03-03 19:49:07,988 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:07,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137376098]
[2025-03-03 19:49:07,988 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:07,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:08,011 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes.
[2025-03-03 19:49:08,086 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements.
[2025-03-03 19:49:08,086 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:08,086 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:08,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:49:08,360 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:08,360 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137376098]
[2025-03-03 19:49:08,360 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137376098] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:08,360 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:49:08,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 19:49:08,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599360969]
[2025-03-03 19:49:08,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:08,361 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 19:49:08,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:08,362 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 19:49:08,362 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 19:49:08,362 INFO  L87              Difference]: Start difference. First operand 1369 states and 2377 transitions. Second operand  has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:08,787 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:08,788 INFO  L93              Difference]: Finished difference Result 3820 states and 6633 transitions.
[2025-03-03 19:49:08,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 19:49:08,788 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 382
[2025-03-03 19:49:08,789 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:08,799 INFO  L225             Difference]: With dead ends: 3820
[2025-03-03 19:49:08,800 INFO  L226             Difference]: Without dead ends: 2677
[2025-03-03 19:49:08,803 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 19:49:08,804 INFO  L435           NwaCegarLoop]: 294 mSDtfsCounter, 361 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:08,804 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 798 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 19:49:08,806 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2677 states.
[2025-03-03 19:49:08,889 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2205.
[2025-03-03 19:49:08,892 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2205 states, 1958 states have (on average 1.713993871297242) internal successors, (3356), 1965 states have internal predecessors, (3356), 234 states have call successors, (234), 12 states have call predecessors, (234), 12 states have return successors, (234), 227 states have call predecessors, (234), 234 states have call successors, (234)
[2025-03-03 19:49:08,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 3824 transitions.
[2025-03-03 19:49:08,902 INFO  L78                 Accepts]: Start accepts. Automaton has 2205 states and 3824 transitions. Word has length 382
[2025-03-03 19:49:08,902 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:08,902 INFO  L471      AbstractCegarLoop]: Abstraction has 2205 states and 3824 transitions.
[2025-03-03 19:49:08,903 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:08,903 INFO  L276                IsEmpty]: Start isEmpty. Operand 2205 states and 3824 transitions.
[2025-03-03 19:49:08,907 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 384
[2025-03-03 19:49:08,907 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:08,908 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:08,908 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 19:49:08,908 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:08,908 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:08,909 INFO  L85        PathProgramCache]: Analyzing trace with hash 623745293, now seen corresponding path program 1 times
[2025-03-03 19:49:08,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:08,909 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127722893]
[2025-03-03 19:49:08,909 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:08,909 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:08,929 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes.
[2025-03-03 19:49:08,969 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements.
[2025-03-03 19:49:08,969 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:08,970 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:09,249 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:49:09,250 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:09,250 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127722893]
[2025-03-03 19:49:09,250 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127722893] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:09,250 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:49:09,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 19:49:09,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268989162]
[2025-03-03 19:49:09,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:09,250 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 19:49:09,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:09,251 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 19:49:09,251 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-03 19:49:09,251 INFO  L87              Difference]: Start difference. First operand 2205 states and 3824 transitions. Second operand  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:09,593 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:09,594 INFO  L93              Difference]: Finished difference Result 4807 states and 8267 transitions.
[2025-03-03 19:49:09,594 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 19:49:09,595 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 383
[2025-03-03 19:49:09,595 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:09,610 INFO  L225             Difference]: With dead ends: 4807
[2025-03-03 19:49:09,610 INFO  L226             Difference]: Without dead ends: 3539
[2025-03-03 19:49:09,614 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:49:09,615 INFO  L435           NwaCegarLoop]: 313 mSDtfsCounter, 312 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:09,615 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 915 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 19:49:09,618 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3539 states.
[2025-03-03 19:49:09,772 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 3471.
[2025-03-03 19:49:09,779 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3471 states, 3041 states have (on average 1.6987832949687602) internal successors, (5166), 3055 states have internal predecessors, (5166), 409 states have call successors, (409), 20 states have call predecessors, (409), 20 states have return successors, (409), 395 states have call predecessors, (409), 409 states have call successors, (409)
[2025-03-03 19:49:09,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 5984 transitions.
[2025-03-03 19:49:09,800 INFO  L78                 Accepts]: Start accepts. Automaton has 3471 states and 5984 transitions. Word has length 383
[2025-03-03 19:49:09,801 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:09,801 INFO  L471      AbstractCegarLoop]: Abstraction has 3471 states and 5984 transitions.
[2025-03-03 19:49:09,801 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:09,801 INFO  L276                IsEmpty]: Start isEmpty. Operand 3471 states and 5984 transitions.
[2025-03-03 19:49:09,804 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 385
[2025-03-03 19:49:09,805 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:09,805 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:09,805 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 19:49:09,805 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:09,806 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:09,806 INFO  L85        PathProgramCache]: Analyzing trace with hash 629829080, now seen corresponding path program 1 times
[2025-03-03 19:49:09,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:09,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374539721]
[2025-03-03 19:49:09,806 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:09,806 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:09,831 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes.
[2025-03-03 19:49:09,922 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements.
[2025-03-03 19:49:09,922 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:09,922 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:10,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:49:10,563 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:10,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374539721]
[2025-03-03 19:49:10,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374539721] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:10,564 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:49:10,564 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 19:49:10,564 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473121959]
[2025-03-03 19:49:10,564 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:10,565 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 19:49:10,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:10,565 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 19:49:10,565 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-03 19:49:10,566 INFO  L87              Difference]: Start difference. First operand 3471 states and 5984 transitions. Second operand  has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:11,460 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:11,461 INFO  L93              Difference]: Finished difference Result 11351 states and 19469 transitions.
[2025-03-03 19:49:11,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:49:11,461 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 384
[2025-03-03 19:49:11,462 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:11,503 INFO  L225             Difference]: With dead ends: 11351
[2025-03-03 19:49:11,503 INFO  L226             Difference]: Without dead ends: 8707
[2025-03-03 19:49:11,512 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-03 19:49:11,513 INFO  L435           NwaCegarLoop]: 317 mSDtfsCounter, 489 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:11,513 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 947 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 19:49:11,520 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8707 states.
[2025-03-03 19:49:11,820 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8707 to 7585.
[2025-03-03 19:49:11,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7585 states, 6784 states have (on average 1.713443396226415) internal successors, (11624), 6812 states have internal predecessors, (11624), 759 states have call successors, (759), 41 states have call predecessors, (759), 41 states have return successors, (759), 731 states have call predecessors, (759), 759 states have call successors, (759)
[2025-03-03 19:49:11,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7585 states to 7585 states and 13142 transitions.
[2025-03-03 19:49:11,859 INFO  L78                 Accepts]: Start accepts. Automaton has 7585 states and 13142 transitions. Word has length 384
[2025-03-03 19:49:11,859 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:11,860 INFO  L471      AbstractCegarLoop]: Abstraction has 7585 states and 13142 transitions.
[2025-03-03 19:49:11,863 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:11,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 7585 states and 13142 transitions.
[2025-03-03 19:49:11,869 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 385
[2025-03-03 19:49:11,869 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:11,870 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:11,870 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 19:49:11,870 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:11,870 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:11,870 INFO  L85        PathProgramCache]: Analyzing trace with hash 641145207, now seen corresponding path program 1 times
[2025-03-03 19:49:11,871 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:11,871 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809536143]
[2025-03-03 19:49:11,871 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:11,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:11,888 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes.
[2025-03-03 19:49:11,979 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements.
[2025-03-03 19:49:11,980 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:11,980 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:12,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:49:12,778 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:12,779 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809536143]
[2025-03-03 19:49:12,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809536143] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:12,779 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:49:12,779 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 19:49:12,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624833277]
[2025-03-03 19:49:12,779 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:12,780 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 19:49:12,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:12,780 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 19:49:12,780 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 19:49:12,780 INFO  L87              Difference]: Start difference. First operand 7585 states and 13142 transitions. Second operand  has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:13,910 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:13,910 INFO  L93              Difference]: Finished difference Result 19430 states and 33686 transitions.
[2025-03-03 19:49:13,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-03 19:49:13,911 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 384
[2025-03-03 19:49:13,912 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:13,952 INFO  L225             Difference]: With dead ends: 19430
[2025-03-03 19:49:13,952 INFO  L226             Difference]: Without dead ends: 13182
[2025-03-03 19:49:13,967 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-03-03 19:49:13,967 INFO  L435           NwaCegarLoop]: 505 mSDtfsCounter, 484 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:13,967 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1706 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 19:49:13,978 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13182 states.
[2025-03-03 19:49:14,374 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13182 to 11809.
[2025-03-03 19:49:14,391 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11809 states, 10638 states have (on average 1.7145140063921789) internal successors, (18239), 10680 states have internal predecessors, (18239), 1109 states have call successors, (1109), 61 states have call predecessors, (1109), 61 states have return successors, (1109), 1067 states have call predecessors, (1109), 1109 states have call successors, (1109)
[2025-03-03 19:49:14,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11809 states to 11809 states and 20457 transitions.
[2025-03-03 19:49:14,429 INFO  L78                 Accepts]: Start accepts. Automaton has 11809 states and 20457 transitions. Word has length 384
[2025-03-03 19:49:14,429 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:14,430 INFO  L471      AbstractCegarLoop]: Abstraction has 11809 states and 20457 transitions.
[2025-03-03 19:49:14,430 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:14,431 INFO  L276                IsEmpty]: Start isEmpty. Operand 11809 states and 20457 transitions.
[2025-03-03 19:49:14,437 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 385
[2025-03-03 19:49:14,437 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:14,437 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:14,437 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 19:49:14,437 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:14,438 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:14,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 1693565975, now seen corresponding path program 1 times
[2025-03-03 19:49:14,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:14,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724141405]
[2025-03-03 19:49:14,438 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:14,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:14,455 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes.
[2025-03-03 19:49:14,531 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements.
[2025-03-03 19:49:14,531 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:14,531 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:14,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:49:14,805 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:14,805 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724141405]
[2025-03-03 19:49:14,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724141405] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:14,805 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:49:14,805 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 19:49:14,805 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969830761]
[2025-03-03 19:49:14,805 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:14,805 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 19:49:14,805 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:14,806 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 19:49:14,806 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-03 19:49:14,806 INFO  L87              Difference]: Start difference. First operand 11809 states and 20457 transitions. Second operand  has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59)
[2025-03-03 19:49:15,955 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:15,956 INFO  L93              Difference]: Finished difference Result 24068 states and 41151 transitions.
[2025-03-03 19:49:15,956 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-03 19:49:15,957 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 384
[2025-03-03 19:49:15,957 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:16,003 INFO  L225             Difference]: With dead ends: 24068
[2025-03-03 19:49:16,004 INFO  L226             Difference]: Without dead ends: 14648
[2025-03-03 19:49:16,027 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-03-03 19:49:16,027 INFO  L435           NwaCegarLoop]: 433 mSDtfsCounter, 707 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:16,028 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1036 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 19:49:16,039 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14648 states.
[2025-03-03 19:49:16,692 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14648 to 11794.
[2025-03-03 19:49:16,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11794 states, 10371 states have (on average 1.6828656831549513) internal successors, (17453), 10425 states have internal predecessors, (17453), 1325 states have call successors, (1325), 97 states have call predecessors, (1325), 97 states have return successors, (1325), 1271 states have call predecessors, (1325), 1325 states have call successors, (1325)
[2025-03-03 19:49:16,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11794 states to 11794 states and 20103 transitions.
[2025-03-03 19:49:16,737 INFO  L78                 Accepts]: Start accepts. Automaton has 11794 states and 20103 transitions. Word has length 384
[2025-03-03 19:49:16,737 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:16,737 INFO  L471      AbstractCegarLoop]: Abstraction has 11794 states and 20103 transitions.
[2025-03-03 19:49:16,738 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59)
[2025-03-03 19:49:16,738 INFO  L276                IsEmpty]: Start isEmpty. Operand 11794 states and 20103 transitions.
[2025-03-03 19:49:16,744 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 386
[2025-03-03 19:49:16,744 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:16,744 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:16,745 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 19:49:16,745 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:16,745 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:16,745 INFO  L85        PathProgramCache]: Analyzing trace with hash -1558051903, now seen corresponding path program 1 times
[2025-03-03 19:49:16,745 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:16,745 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896790041]
[2025-03-03 19:49:16,746 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:16,746 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:16,762 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes.
[2025-03-03 19:49:16,823 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements.
[2025-03-03 19:49:16,823 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:16,824 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:17,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:49:17,354 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:17,354 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896790041]
[2025-03-03 19:49:17,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896790041] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:17,354 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:49:17,354 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 19:49:17,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893249039]
[2025-03-03 19:49:17,354 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:17,355 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 19:49:17,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:17,355 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 19:49:17,355 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-03 19:49:17,356 INFO  L87              Difference]: Start difference. First operand 11794 states and 20103 transitions. Second operand  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:18,215 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:18,216 INFO  L93              Difference]: Finished difference Result 19382 states and 32406 transitions.
[2025-03-03 19:49:18,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:49:18,216 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 385
[2025-03-03 19:49:18,217 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:18,309 INFO  L225             Difference]: With dead ends: 19382
[2025-03-03 19:49:18,309 INFO  L226             Difference]: Without dead ends: 16642
[2025-03-03 19:49:18,316 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-03 19:49:18,317 INFO  L435           NwaCegarLoop]: 317 mSDtfsCounter, 456 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:18,317 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 967 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 19:49:18,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16642 states.
[2025-03-03 19:49:18,795 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16642 to 12566.
[2025-03-03 19:49:18,813 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12566 states, 11139 states have (on average 1.69045695304785) internal successors, (18830), 11193 states have internal predecessors, (18830), 1325 states have call successors, (1325), 101 states have call predecessors, (1325), 101 states have return successors, (1325), 1271 states have call predecessors, (1325), 1325 states have call successors, (1325)
[2025-03-03 19:49:18,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12566 states to 12566 states and 21480 transitions.
[2025-03-03 19:49:18,846 INFO  L78                 Accepts]: Start accepts. Automaton has 12566 states and 21480 transitions. Word has length 385
[2025-03-03 19:49:18,847 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:18,847 INFO  L471      AbstractCegarLoop]: Abstraction has 12566 states and 21480 transitions.
[2025-03-03 19:49:18,847 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:18,848 INFO  L276                IsEmpty]: Start isEmpty. Operand 12566 states and 21480 transitions.
[2025-03-03 19:49:18,854 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 386
[2025-03-03 19:49:18,854 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:18,854 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:18,854 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 19:49:18,854 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:18,855 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:18,855 INFO  L85        PathProgramCache]: Analyzing trace with hash -1546735776, now seen corresponding path program 1 times
[2025-03-03 19:49:18,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:18,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139331002]
[2025-03-03 19:49:18,855 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:18,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:18,875 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes.
[2025-03-03 19:49:18,996 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements.
[2025-03-03 19:49:18,997 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:18,997 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:19,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:49:19,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:19,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139331002]
[2025-03-03 19:49:19,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139331002] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:19,687 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:49:19,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-03 19:49:19,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516069487]
[2025-03-03 19:49:19,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:19,688 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-03 19:49:19,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:19,689 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-03 19:49:19,689 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 19:49:19,689 INFO  L87              Difference]: Start difference. First operand 12566 states and 21480 transitions. Second operand  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:21,370 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:21,371 INFO  L93              Difference]: Finished difference Result 46043 states and 79294 transitions.
[2025-03-03 19:49:21,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 19:49:21,371 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 385
[2025-03-03 19:49:21,372 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:21,465 INFO  L225             Difference]: With dead ends: 46043
[2025-03-03 19:49:21,465 INFO  L226             Difference]: Without dead ends: 36375
[2025-03-03 19:49:21,494 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2025-03-03 19:49:21,495 INFO  L435           NwaCegarLoop]: 444 mSDtfsCounter, 807 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:21,495 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1219 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 19:49:21,517 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36375 states.
[2025-03-03 19:49:22,507 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36375 to 21061.
[2025-03-03 19:49:22,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21061 states, 18841 states have (on average 1.7000689984608035) internal successors, (32031), 18943 states have internal predecessors, (32031), 2069 states have call successors, (2069), 150 states have call predecessors, (2069), 150 states have return successors, (2069), 1967 states have call predecessors, (2069), 2069 states have call successors, (2069)
[2025-03-03 19:49:22,574 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21061 states to 21061 states and 36169 transitions.
[2025-03-03 19:49:22,584 INFO  L78                 Accepts]: Start accepts. Automaton has 21061 states and 36169 transitions. Word has length 385
[2025-03-03 19:49:22,584 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:22,584 INFO  L471      AbstractCegarLoop]: Abstraction has 21061 states and 36169 transitions.
[2025-03-03 19:49:22,585 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59)
[2025-03-03 19:49:22,585 INFO  L276                IsEmpty]: Start isEmpty. Operand 21061 states and 36169 transitions.
[2025-03-03 19:49:22,595 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 386
[2025-03-03 19:49:22,595 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:22,595 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:22,595 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-03 19:49:22,596 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:22,596 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:22,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -193426079, now seen corresponding path program 1 times
[2025-03-03 19:49:22,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:22,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158721224]
[2025-03-03 19:49:22,596 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:22,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:22,616 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes.
[2025-03-03 19:49:22,672 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements.
[2025-03-03 19:49:22,672 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:22,672 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:23,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:49:23,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:23,155 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158721224]
[2025-03-03 19:49:23,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158721224] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:49:23,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:49:23,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-03 19:49:23,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298650215]
[2025-03-03 19:49:23,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:49:23,156 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 19:49:23,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:23,156 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 19:49:23,157 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:49:23,157 INFO  L87              Difference]: Start difference. First operand 21061 states and 36169 transitions. Second operand  has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59)
[2025-03-03 19:49:25,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:25,170 INFO  L93              Difference]: Finished difference Result 50039 states and 85520 transitions.
[2025-03-03 19:49:25,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 19:49:25,171 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 385
[2025-03-03 19:49:25,172 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:25,276 INFO  L225             Difference]: With dead ends: 50039
[2025-03-03 19:49:25,276 INFO  L226             Difference]: Without dead ends: 32600
[2025-03-03 19:49:25,317 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-03 19:49:25,318 INFO  L435           NwaCegarLoop]: 399 mSDtfsCounter, 584 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:25,318 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 845 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 19:49:25,341 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32600 states.
[2025-03-03 19:49:26,484 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32600 to 22725.
[2025-03-03 19:49:26,508 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22725 states, 20505 states have (on average 1.708510119483053) internal successors, (35033), 20607 states have internal predecessors, (35033), 2069 states have call successors, (2069), 150 states have call predecessors, (2069), 150 states have return successors, (2069), 1967 states have call predecessors, (2069), 2069 states have call successors, (2069)
[2025-03-03 19:49:26,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 39171 transitions.
[2025-03-03 19:49:26,556 INFO  L78                 Accepts]: Start accepts. Automaton has 22725 states and 39171 transitions. Word has length 385
[2025-03-03 19:49:26,557 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:26,557 INFO  L471      AbstractCegarLoop]: Abstraction has 22725 states and 39171 transitions.
[2025-03-03 19:49:26,557 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59)
[2025-03-03 19:49:26,557 INFO  L276                IsEmpty]: Start isEmpty. Operand 22725 states and 39171 transitions.
[2025-03-03 19:49:26,566 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 386
[2025-03-03 19:49:26,566 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:26,567 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:26,567 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 19:49:26,567 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:26,567 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:26,567 INFO  L85        PathProgramCache]: Analyzing trace with hash -1422662529, now seen corresponding path program 1 times
[2025-03-03 19:49:26,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:26,568 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316862611]
[2025-03-03 19:49:26,568 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:26,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:26,582 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes.
[2025-03-03 19:49:26,800 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements.
[2025-03-03 19:49:26,801 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:26,801 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:27,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 51 proven. 123 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked.
[2025-03-03 19:49:27,335 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:49:27,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316862611]
[2025-03-03 19:49:27,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316862611] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 19:49:27,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101309887]
[2025-03-03 19:49:27,336 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:27,337 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 19:49:27,337 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 19:49:27,339 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 19:49:27,340 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-03 19:49:27,441 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes.
[2025-03-03 19:49:27,520 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements.
[2025-03-03 19:49:27,521 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:27,521 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:49:27,524 INFO  L256         TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-03 19:49:27,533 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 19:49:28,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 3499 proven. 21 refuted. 0 times theorem prover too weak. 3324 trivial. 0 not checked.
[2025-03-03 19:49:28,371 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 19:49:29,353 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 153 proven. 21 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked.
[2025-03-03 19:49:29,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101309887] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 19:49:29,354 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 19:49:29,354 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 19
[2025-03-03 19:49:29,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899878792]
[2025-03-03 19:49:29,354 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 19:49:29,355 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-03-03 19:49:29,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:49:29,356 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-03-03 19:49:29,356 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342
[2025-03-03 19:49:29,357 INFO  L87              Difference]: Start difference. First operand 22725 states and 39171 transitions. Second operand  has 19 states, 18 states have (on average 13.833333333333334) internal successors, (249), 18 states have internal predecessors, (249), 9 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (177), 9 states have call predecessors, (177), 9 states have call successors, (177)
[2025-03-03 19:49:39,264 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 19:49:39,265 INFO  L93              Difference]: Finished difference Result 142580 states and 243303 transitions.
[2025-03-03 19:49:39,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. 
[2025-03-03 19:49:39,265 INFO  L78                 Accepts]: Start accepts. Automaton has  has 19 states, 18 states have (on average 13.833333333333334) internal successors, (249), 18 states have internal predecessors, (249), 9 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (177), 9 states have call predecessors, (177), 9 states have call successors, (177) Word has length 385
[2025-03-03 19:49:39,266 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 19:49:39,539 INFO  L225             Difference]: With dead ends: 142580
[2025-03-03 19:49:39,539 INFO  L226             Difference]: Without dead ends: 121296
[2025-03-03 19:49:39,582 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=790, Invalid=2402, Unknown=0, NotChecked=0, Total=3192
[2025-03-03 19:49:39,583 INFO  L435           NwaCegarLoop]: 302 mSDtfsCounter, 2854 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 3405 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2984 SdHoareTripleChecker+Valid, 3537 SdHoareTripleChecker+Invalid, 4098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 3405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-03-03 19:49:39,583 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2984 Valid, 3537 Invalid, 4098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 3405 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-03-03 19:49:39,651 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 121296 states.
[2025-03-03 19:49:41,959 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 121296 to 35257.
[2025-03-03 19:49:41,992 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35257 states, 31964 states have (on average 1.6858340633212363) internal successors, (53886), 32104 states have internal predecessors, (53886), 3055 states have call successors, (3055), 237 states have call predecessors, (3055), 237 states have return successors, (3055), 2915 states have call predecessors, (3055), 3055 states have call successors, (3055)
[2025-03-03 19:49:42,046 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35257 states to 35257 states and 59996 transitions.
[2025-03-03 19:49:42,073 INFO  L78                 Accepts]: Start accepts. Automaton has 35257 states and 59996 transitions. Word has length 385
[2025-03-03 19:49:42,074 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 19:49:42,074 INFO  L471      AbstractCegarLoop]: Abstraction has 35257 states and 59996 transitions.
[2025-03-03 19:49:42,074 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 18 states have (on average 13.833333333333334) internal successors, (249), 18 states have internal predecessors, (249), 9 states have call successors, (177), 4 states have call predecessors, (177), 7 states have return successors, (177), 9 states have call predecessors, (177), 9 states have call successors, (177)
[2025-03-03 19:49:42,075 INFO  L276                IsEmpty]: Start isEmpty. Operand 35257 states and 59996 transitions.
[2025-03-03 19:49:42,084 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 387
[2025-03-03 19:49:42,084 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 19:49:42,085 INFO  L218           NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 19:49:42,093 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-03 19:49:42,289 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-03-03 19:49:42,289 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 19:49:42,290 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 19:49:42,290 INFO  L85        PathProgramCache]: Analyzing trace with hash 21268877, now seen corresponding path program 1 times
[2025-03-03 19:49:42,291 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 19:49:42,291 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687598736]
[2025-03-03 19:49:42,291 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 19:49:42,291 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 19:49:42,309 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes.
[2025-03-03 19:49:42,606 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements.
[2025-03-03 19:49:42,607 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 19:49:42,607 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 19:50:03,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked.
[2025-03-03 19:50:03,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 19:50:03,346 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687598736]
[2025-03-03 19:50:03,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687598736] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 19:50:03,347 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 19:50:03,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2025-03-03 19:50:03,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379654208]
[2025-03-03 19:50:03,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 19:50:03,347 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-03-03 19:50:03,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 19:50:03,348 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-03-03 19:50:03,348 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380
[2025-03-03 19:50:03,348 INFO  L87              Difference]: Start difference. First operand 35257 states and 59996 transitions. Second operand  has 20 states, 20 states have (on average 4.7) internal successors, (94), 20 states have internal predecessors, (94), 4 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59)