./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c --full-output --architecture 64bit


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 09:39:08,943 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 09:39:08,998 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-03-08 09:39:09,002 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 09:39:09,004 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 09:39:09,028 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 09:39:09,029 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 09:39:09,029 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 09:39:09,030 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 09:39:09,030 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 09:39:09,030 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 09:39:09,031 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 09:39:09,031 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 09:39:09,031 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 09:39:09,031 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 09:39:09,032 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 09:39:09,032 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 09:39:09,032 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 09:39:09,032 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 09:39:09,032 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 09:39:09,032 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 09:39:09,032 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 09:39:09,032 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 09:39:09,032 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 09:39:09,032 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 09:39:09,033 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 09:39:09,033 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 09:39:09,033 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 09:39:09,033 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 09:39:09,033 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 09:39:09,033 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 09:39:09,033 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 09:39:09,034 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 09:39:09,034 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 09:39:09,034 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 09:39:09,034 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 09:39:09,034 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 09:39:09,034 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 09:39:09,034 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 09:39:09,034 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 09:39:09,034 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 -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e
[2025-03-08 09:39:09,311 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 09:39:09,320 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 09:39:09,323 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 09:39:09,324 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 09:39:09,324 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 09:39:09,326 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c
[2025-03-08 09:39:10,498 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7bf4984/7c8d05b4badd46f6bbfa54b2ac48e021/FLAG28a6e020c
[2025-03-08 09:39:10,842 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 09:39:10,843 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c
[2025-03-08 09:39:10,859 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7bf4984/7c8d05b4badd46f6bbfa54b2ac48e021/FLAG28a6e020c
[2025-03-08 09:39:11,080 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d7bf4984/7c8d05b4badd46f6bbfa54b2ac48e021
[2025-03-08 09:39:11,082 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 09:39:11,083 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 09:39:11,084 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 09:39:11,084 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 09:39:11,087 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 09:39:11,087 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:11,088 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548803b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11, skipping insertion in model container
[2025-03-08 09:39:11,088 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:11,144 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 09:39:11,290 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c[1268,1281]
[2025-03-08 09:39:11,568 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 09:39:11,576 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 09:39:11,584 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c[1268,1281]
[2025-03-08 09:39:11,742 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 09:39:11,752 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 09:39:11,753 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11 WrapperNode
[2025-03-08 09:39:11,753 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 09:39:11,754 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 09:39:11,754 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 09:39:11,754 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 09:39:11,759 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:11,801 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:12,221 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4812
[2025-03-08 09:39:12,222 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 09:39:12,223 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 09:39:12,223 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 09:39:12,223 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 09:39:12,230 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:12,231 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:12,316 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:12,448 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 09:39:12,449 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:12,450 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:12,584 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:12,599 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:12,620 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:12,645 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:12,690 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 09:39:12,691 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 09:39:12,692 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 09:39:12,692 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 09:39:12,693 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (1/1) ...
[2025-03-08 09:39:12,697 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 09:39:12,707 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:39:12,718 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 09:39:12,720 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 09:39:12,742 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 09:39:12,743 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 09:39:12,743 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 09:39:12,743 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 09:39:13,114 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 09:39:13,115 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 09:39:16,782 INFO  L?                        ?]: Removed 3115 outVars from TransFormulas that were not future-live.
[2025-03-08 09:39:16,782 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 09:39:16,915 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 09:39:16,915 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 09:39:16,916 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:39:16 BoogieIcfgContainer
[2025-03-08 09:39:16,916 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 09:39:16,920 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 09:39:16,921 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 09:39:16,925 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 09:39:16,925 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:39:11" (1/3) ...
[2025-03-08 09:39:16,925 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddf3f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:39:16, skipping insertion in model container
[2025-03-08 09:39:16,926 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:11" (2/3) ...
[2025-03-08 09:39:16,926 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ddf3f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:39:16, skipping insertion in model container
[2025-03-08 09:39:16,926 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:39:16" (3/3) ...
[2025-03-08 09:39:16,927 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c
[2025-03-08 09:39:16,938 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 09:39:16,939 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c that has 1 procedures, 1110 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 09:39:17,011 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 09:39:17,021 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;@32c12f16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 09:39:17,022 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 09:39:17,029 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1110 states, 1108 states have (on average 1.4990974729241877) internal successors, (1661), 1109 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:17,037 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-03-08 09:39:17,038 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:17,038 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:17,039 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:17,044 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:17,044 INFO  L85        PathProgramCache]: Analyzing trace with hash -805461963, now seen corresponding path program 1 times
[2025-03-08 09:39:17,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:17,051 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533604024]
[2025-03-08 09:39:17,051 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:17,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:17,158 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-03-08 09:39:17,250 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-03-08 09:39:17,251 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:17,251 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:17,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:17,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:39:17,862 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533604024]
[2025-03-08 09:39:17,862 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533604024] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:17,862 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:17,862 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:39:17,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557977251]
[2025-03-08 09:39:17,864 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:17,868 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:39:17,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:39:17,882 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:39:17,883 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:39:17,887 INFO  L87              Difference]: Start difference. First operand  has 1110 states, 1108 states have (on average 1.4990974729241877) internal successors, (1661), 1109 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:18,469 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:18,469 INFO  L93              Difference]: Finished difference Result 2101 states and 3147 transitions.
[2025-03-08 09:39:18,471 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:39:18,472 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2025-03-08 09:39:18,472 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:18,489 INFO  L225             Difference]: With dead ends: 2101
[2025-03-08 09:39:18,490 INFO  L226             Difference]: Without dead ends: 1109
[2025-03-08 09:39:18,494 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:39:18,500 INFO  L435           NwaCegarLoop]: 1380 mSDtfsCounter, 0 mSDsluCounter, 2755 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:18,500 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4135 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:39:18,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1109 states.
[2025-03-08 09:39:18,567 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109.
[2025-03-08 09:39:18,569 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1109 states, 1108 states have (on average 1.4972924187725631) internal successors, (1659), 1108 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:18,577 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1659 transitions.
[2025-03-08 09:39:18,578 INFO  L78                 Accepts]: Start accepts. Automaton has 1109 states and 1659 transitions. Word has length 81
[2025-03-08 09:39:18,579 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:18,579 INFO  L471      AbstractCegarLoop]: Abstraction has 1109 states and 1659 transitions.
[2025-03-08 09:39:18,580 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:18,580 INFO  L276                IsEmpty]: Start isEmpty. Operand 1109 states and 1659 transitions.
[2025-03-08 09:39:18,583 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2025-03-08 09:39:18,583 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:18,583 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:18,583 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 09:39:18,584 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:18,584 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:18,585 INFO  L85        PathProgramCache]: Analyzing trace with hash 805163727, now seen corresponding path program 1 times
[2025-03-08 09:39:18,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:18,585 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987022781]
[2025-03-08 09:39:18,585 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:18,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:18,628 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes.
[2025-03-08 09:39:18,655 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements.
[2025-03-08 09:39:18,656 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:18,656 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:18,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:18,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:39:18,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987022781]
[2025-03-08 09:39:18,835 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987022781] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:18,835 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:18,835 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:39:18,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720982619]
[2025-03-08 09:39:18,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:18,836 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:39:18,836 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:39:18,836 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:39:18,836 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:39:18,837 INFO  L87              Difference]: Start difference. First operand 1109 states and 1659 transitions. Second operand  has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:19,296 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:19,296 INFO  L93              Difference]: Finished difference Result 2102 states and 3145 transitions.
[2025-03-08 09:39:19,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:39:19,297 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82
[2025-03-08 09:39:19,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:19,300 INFO  L225             Difference]: With dead ends: 2102
[2025-03-08 09:39:19,300 INFO  L226             Difference]: Without dead ends: 1111
[2025-03-08 09:39:19,301 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:39:19,302 INFO  L435           NwaCegarLoop]: 1380 mSDtfsCounter, 0 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4132 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:19,302 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4132 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:39:19,304 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1111 states.
[2025-03-08 09:39:19,325 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111.
[2025-03-08 09:39:19,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1111 states, 1110 states have (on average 1.4963963963963964) internal successors, (1661), 1110 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:19,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1661 transitions.
[2025-03-08 09:39:19,331 INFO  L78                 Accepts]: Start accepts. Automaton has 1111 states and 1661 transitions. Word has length 82
[2025-03-08 09:39:19,332 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:19,332 INFO  L471      AbstractCegarLoop]: Abstraction has 1111 states and 1661 transitions.
[2025-03-08 09:39:19,333 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:19,333 INFO  L276                IsEmpty]: Start isEmpty. Operand 1111 states and 1661 transitions.
[2025-03-08 09:39:19,335 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-03-08 09:39:19,336 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:19,336 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:19,336 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 09:39:19,336 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:19,337 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:19,337 INFO  L85        PathProgramCache]: Analyzing trace with hash 1121782640, now seen corresponding path program 1 times
[2025-03-08 09:39:19,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:19,337 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033049824]
[2025-03-08 09:39:19,337 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:19,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:19,381 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-03-08 09:39:19,453 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-03-08 09:39:19,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:19,454 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:20,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:20,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:39:20,166 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033049824]
[2025-03-08 09:39:20,166 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033049824] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:20,166 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:20,166 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:39:20,166 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306724224]
[2025-03-08 09:39:20,166 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:20,166 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:39:20,167 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:39:20,167 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:39:20,167 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:39:20,168 INFO  L87              Difference]: Start difference. First operand 1111 states and 1661 transitions. Second operand  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:21,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:21,295 INFO  L93              Difference]: Finished difference Result 2993 states and 4475 transitions.
[2025-03-08 09:39:21,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:39:21,296 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83
[2025-03-08 09:39:21,296 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:21,303 INFO  L225             Difference]: With dead ends: 2993
[2025-03-08 09:39:21,303 INFO  L226             Difference]: Without dead ends: 2000
[2025-03-08 09:39:21,305 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:39:21,305 INFO  L435           NwaCegarLoop]: 1354 mSDtfsCounter, 2922 mSDsluCounter, 5412 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2922 SdHoareTripleChecker+Valid, 6766 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:21,305 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2922 Valid, 6766 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 09:39:21,307 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2000 states.
[2025-03-08 09:39:21,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1120.
[2025-03-08 09:39:21,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1120 states, 1119 states have (on average 1.4950848972296693) internal successors, (1673), 1119 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:21,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1673 transitions.
[2025-03-08 09:39:21,332 INFO  L78                 Accepts]: Start accepts. Automaton has 1120 states and 1673 transitions. Word has length 83
[2025-03-08 09:39:21,332 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:21,332 INFO  L471      AbstractCegarLoop]: Abstraction has 1120 states and 1673 transitions.
[2025-03-08 09:39:21,332 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:21,332 INFO  L276                IsEmpty]: Start isEmpty. Operand 1120 states and 1673 transitions.
[2025-03-08 09:39:21,333 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-03-08 09:39:21,333 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:21,333 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:21,333 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 09:39:21,333 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:21,334 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:21,334 INFO  L85        PathProgramCache]: Analyzing trace with hash 414752040, now seen corresponding path program 1 times
[2025-03-08 09:39:21,334 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:21,334 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750997924]
[2025-03-08 09:39:21,334 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:21,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:21,364 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-03-08 09:39:21,396 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-03-08 09:39:21,396 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:21,396 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:22,275 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:22,275 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:39:22,275 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750997924]
[2025-03-08 09:39:22,275 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750997924] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:22,275 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:22,275 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:39:22,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025893450]
[2025-03-08 09:39:22,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:22,276 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:39:22,276 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:39:22,276 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:39:22,277 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:39:22,277 INFO  L87              Difference]: Start difference. First operand 1120 states and 1673 transitions. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:23,728 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:23,729 INFO  L93              Difference]: Finished difference Result 2997 states and 4479 transitions.
[2025-03-08 09:39:23,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:39:23,729 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84
[2025-03-08 09:39:23,730 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:23,736 INFO  L225             Difference]: With dead ends: 2997
[2025-03-08 09:39:23,736 INFO  L226             Difference]: Without dead ends: 2004
[2025-03-08 09:39:23,738 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272
[2025-03-08 09:39:23,740 INFO  L435           NwaCegarLoop]: 1352 mSDtfsCounter, 4254 mSDsluCounter, 8104 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4254 SdHoareTripleChecker+Valid, 9456 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:23,741 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4254 Valid, 9456 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2144 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-08 09:39:23,745 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2004 states.
[2025-03-08 09:39:23,761 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1123.
[2025-03-08 09:39:23,763 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1123 states, 1122 states have (on average 1.4946524064171123) internal successors, (1677), 1122 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:23,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1677 transitions.
[2025-03-08 09:39:23,766 INFO  L78                 Accepts]: Start accepts. Automaton has 1123 states and 1677 transitions. Word has length 84
[2025-03-08 09:39:23,767 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:23,767 INFO  L471      AbstractCegarLoop]: Abstraction has 1123 states and 1677 transitions.
[2025-03-08 09:39:23,767 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:23,767 INFO  L276                IsEmpty]: Start isEmpty. Operand 1123 states and 1677 transitions.
[2025-03-08 09:39:23,768 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2025-03-08 09:39:23,768 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:23,769 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:23,769 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 09:39:23,769 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:23,769 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:23,770 INFO  L85        PathProgramCache]: Analyzing trace with hash -1265410056, now seen corresponding path program 1 times
[2025-03-08 09:39:23,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:23,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932752744]
[2025-03-08 09:39:23,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:23,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:23,806 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-03-08 09:39:23,850 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-03-08 09:39:23,850 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:23,851 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:24,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:24,130 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:39:24,130 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932752744]
[2025-03-08 09:39:24,130 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932752744] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:24,130 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:24,130 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:39:24,130 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362997277]
[2025-03-08 09:39:24,131 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:24,131 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:39:24,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:39:24,132 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:39:24,133 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:39:24,133 INFO  L87              Difference]: Start difference. First operand 1123 states and 1677 transitions. Second operand  has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:24,844 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:24,844 INFO  L93              Difference]: Finished difference Result 2993 states and 4473 transitions.
[2025-03-08 09:39:24,844 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:39:24,845 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85
[2025-03-08 09:39:24,845 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:24,850 INFO  L225             Difference]: With dead ends: 2993
[2025-03-08 09:39:24,851 INFO  L226             Difference]: Without dead ends: 2000
[2025-03-08 09:39:24,852 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:39:24,853 INFO  L435           NwaCegarLoop]: 1357 mSDtfsCounter, 4225 mSDsluCounter, 2713 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4225 SdHoareTripleChecker+Valid, 4070 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:24,853 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4225 Valid, 4070 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 09:39:24,855 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2000 states.
[2025-03-08 09:39:24,871 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1127.
[2025-03-08 09:39:24,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1127 states, 1126 states have (on average 1.4928952042628774) internal successors, (1681), 1126 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:24,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1681 transitions.
[2025-03-08 09:39:24,875 INFO  L78                 Accepts]: Start accepts. Automaton has 1127 states and 1681 transitions. Word has length 85
[2025-03-08 09:39:24,875 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:24,875 INFO  L471      AbstractCegarLoop]: Abstraction has 1127 states and 1681 transitions.
[2025-03-08 09:39:24,875 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:24,876 INFO  L276                IsEmpty]: Start isEmpty. Operand 1127 states and 1681 transitions.
[2025-03-08 09:39:24,876 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2025-03-08 09:39:24,876 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:24,876 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:24,876 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 09:39:24,877 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:24,877 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:24,877 INFO  L85        PathProgramCache]: Analyzing trace with hash 29332811, now seen corresponding path program 1 times
[2025-03-08 09:39:24,877 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:24,877 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357260559]
[2025-03-08 09:39:24,877 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:24,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:24,907 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-03-08 09:39:24,929 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-03-08 09:39:24,930 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:24,930 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:25,270 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:25,271 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:39:25,271 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357260559]
[2025-03-08 09:39:25,271 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357260559] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:25,271 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:25,271 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:39:25,271 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23234569]
[2025-03-08 09:39:25,271 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:25,271 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:39:25,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:39:25,272 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:39:25,272 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:39:25,272 INFO  L87              Difference]: Start difference. First operand 1127 states and 1681 transitions. Second operand  has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:26,320 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:26,320 INFO  L93              Difference]: Finished difference Result 2997 states and 4477 transitions.
[2025-03-08 09:39:26,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:39:26,324 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85
[2025-03-08 09:39:26,325 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:26,331 INFO  L225             Difference]: With dead ends: 2997
[2025-03-08 09:39:26,331 INFO  L226             Difference]: Without dead ends: 2004
[2025-03-08 09:39:26,332 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-03-08 09:39:26,333 INFO  L435           NwaCegarLoop]: 1356 mSDtfsCounter, 4232 mSDsluCounter, 4854 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4232 SdHoareTripleChecker+Valid, 6210 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:26,334 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4232 Valid, 6210 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 09:39:26,337 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2004 states.
[2025-03-08 09:39:26,368 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1132.
[2025-03-08 09:39:26,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1132 states, 1131 states have (on average 1.4924845269672855) internal successors, (1688), 1131 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:26,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1688 transitions.
[2025-03-08 09:39:26,402 INFO  L78                 Accepts]: Start accepts. Automaton has 1132 states and 1688 transitions. Word has length 85
[2025-03-08 09:39:26,407 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:26,407 INFO  L471      AbstractCegarLoop]: Abstraction has 1132 states and 1688 transitions.
[2025-03-08 09:39:26,407 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:26,407 INFO  L276                IsEmpty]: Start isEmpty. Operand 1132 states and 1688 transitions.
[2025-03-08 09:39:26,408 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2025-03-08 09:39:26,408 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:26,408 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:26,408 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 09:39:26,408 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:26,409 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:26,409 INFO  L85        PathProgramCache]: Analyzing trace with hash 1946209179, now seen corresponding path program 1 times
[2025-03-08 09:39:26,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:26,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343004104]
[2025-03-08 09:39:26,409 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:26,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:26,471 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-03-08 09:39:26,496 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-03-08 09:39:26,497 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:26,497 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:26,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:26,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:39:26,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343004104]
[2025-03-08 09:39:26,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343004104] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:26,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:26,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:39:26,696 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885402694]
[2025-03-08 09:39:26,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:26,696 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:39:26,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:39:26,697 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:39:26,697 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:39:26,697 INFO  L87              Difference]: Start difference. First operand 1132 states and 1688 transitions. Second operand  has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:27,374 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:27,375 INFO  L93              Difference]: Finished difference Result 2998 states and 4477 transitions.
[2025-03-08 09:39:27,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:39:27,376 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85
[2025-03-08 09:39:27,376 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:27,382 INFO  L225             Difference]: With dead ends: 2998
[2025-03-08 09:39:27,383 INFO  L226             Difference]: Without dead ends: 1995
[2025-03-08 09:39:27,384 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:39:27,386 INFO  L435           NwaCegarLoop]: 1359 mSDtfsCounter, 4217 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4217 SdHoareTripleChecker+Valid, 4073 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:27,386 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4217 Valid, 4073 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:39:27,389 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1995 states.
[2025-03-08 09:39:27,405 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1125.
[2025-03-08 09:39:27,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1125 states, 1124 states have (on average 1.49288256227758) internal successors, (1678), 1124 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:27,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1678 transitions.
[2025-03-08 09:39:27,410 INFO  L78                 Accepts]: Start accepts. Automaton has 1125 states and 1678 transitions. Word has length 85
[2025-03-08 09:39:27,410 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:27,410 INFO  L471      AbstractCegarLoop]: Abstraction has 1125 states and 1678 transitions.
[2025-03-08 09:39:27,411 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:27,411 INFO  L276                IsEmpty]: Start isEmpty. Operand 1125 states and 1678 transitions.
[2025-03-08 09:39:27,411 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-03-08 09:39:27,411 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:27,411 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:27,412 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 09:39:27,412 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:27,412 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:27,412 INFO  L85        PathProgramCache]: Analyzing trace with hash 1797582627, now seen corresponding path program 1 times
[2025-03-08 09:39:27,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:27,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765657199]
[2025-03-08 09:39:27,413 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:27,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:27,469 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-03-08 09:39:27,498 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-03-08 09:39:27,498 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:27,499 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:27,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:27,926 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:39:27,926 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765657199]
[2025-03-08 09:39:27,926 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765657199] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:27,926 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:27,926 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 09:39:27,926 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870428855]
[2025-03-08 09:39:27,926 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:27,926 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 09:39:27,926 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:39:27,926 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 09:39:27,926 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:39:27,927 INFO  L87              Difference]: Start difference. First operand 1125 states and 1678 transitions. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:28,656 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:28,656 INFO  L93              Difference]: Finished difference Result 2132 states and 3183 transitions.
[2025-03-08 09:39:28,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 09:39:28,657 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86
[2025-03-08 09:39:28,657 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:28,660 INFO  L225             Difference]: With dead ends: 2132
[2025-03-08 09:39:28,660 INFO  L226             Difference]: Without dead ends: 1139
[2025-03-08 09:39:28,661 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2025-03-08 09:39:28,661 INFO  L435           NwaCegarLoop]: 1366 mSDtfsCounter, 1637 mSDsluCounter, 5469 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 6835 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:28,662 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 6835 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 09:39:28,663 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1139 states.
[2025-03-08 09:39:28,672 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1131.
[2025-03-08 09:39:28,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1131 states, 1130 states have (on average 1.4920353982300885) internal successors, (1686), 1130 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:28,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1686 transitions.
[2025-03-08 09:39:28,675 INFO  L78                 Accepts]: Start accepts. Automaton has 1131 states and 1686 transitions. Word has length 86
[2025-03-08 09:39:28,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:28,675 INFO  L471      AbstractCegarLoop]: Abstraction has 1131 states and 1686 transitions.
[2025-03-08 09:39:28,675 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:28,675 INFO  L276                IsEmpty]: Start isEmpty. Operand 1131 states and 1686 transitions.
[2025-03-08 09:39:28,676 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-03-08 09:39:28,676 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:28,676 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:28,676 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 09:39:28,676 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:28,677 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:28,677 INFO  L85        PathProgramCache]: Analyzing trace with hash -452047351, now seen corresponding path program 1 times
[2025-03-08 09:39:28,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:28,677 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004283215]
[2025-03-08 09:39:28,677 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:28,677 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:28,702 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-03-08 09:39:28,720 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-03-08 09:39:28,723 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:28,724 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:28,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:28,931 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:39:28,931 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004283215]
[2025-03-08 09:39:28,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004283215] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:28,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:28,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:39:28,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400790525]
[2025-03-08 09:39:28,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:28,932 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:39:28,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:39:28,932 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:39:28,932 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:39:28,933 INFO  L87              Difference]: Start difference. First operand 1131 states and 1686 transitions. Second operand  has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:29,803 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:29,804 INFO  L93              Difference]: Finished difference Result 2993 states and 4469 transitions.
[2025-03-08 09:39:29,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:39:29,804 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86
[2025-03-08 09:39:29,804 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:29,811 INFO  L225             Difference]: With dead ends: 2993
[2025-03-08 09:39:29,811 INFO  L226             Difference]: Without dead ends: 1994
[2025-03-08 09:39:29,813 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:39:29,813 INFO  L435           NwaCegarLoop]: 1358 mSDtfsCounter, 4206 mSDsluCounter, 2713 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4206 SdHoareTripleChecker+Valid, 4071 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:29,814 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4206 Valid, 4071 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 09:39:29,817 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1994 states.
[2025-03-08 09:39:29,834 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1128.
[2025-03-08 09:39:29,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1128 states, 1127 states have (on average 1.4915705412599822) internal successors, (1681), 1127 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:29,839 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1681 transitions.
[2025-03-08 09:39:29,839 INFO  L78                 Accepts]: Start accepts. Automaton has 1128 states and 1681 transitions. Word has length 86
[2025-03-08 09:39:29,839 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:29,839 INFO  L471      AbstractCegarLoop]: Abstraction has 1128 states and 1681 transitions.
[2025-03-08 09:39:29,839 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:29,840 INFO  L276                IsEmpty]: Start isEmpty. Operand 1128 states and 1681 transitions.
[2025-03-08 09:39:29,840 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-03-08 09:39:29,840 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:29,840 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:29,841 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 09:39:29,841 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:29,841 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:29,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -1030436698, now seen corresponding path program 1 times
[2025-03-08 09:39:29,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:29,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046965867]
[2025-03-08 09:39:29,842 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:29,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:29,873 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-03-08 09:39:29,900 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-03-08 09:39:29,900 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:29,900 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:30,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:30,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:39:30,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046965867]
[2025-03-08 09:39:30,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046965867] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:30,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:30,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:39:30,215 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409565515]
[2025-03-08 09:39:30,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:30,215 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:39:30,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:39:30,216 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:39:30,216 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:39:30,216 INFO  L87              Difference]: Start difference. First operand 1128 states and 1681 transitions. Second operand  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:30,818 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:30,819 INFO  L93              Difference]: Finished difference Result 2125 states and 3172 transitions.
[2025-03-08 09:39:30,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:39:30,819 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87
[2025-03-08 09:39:30,819 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:30,822 INFO  L225             Difference]: With dead ends: 2125
[2025-03-08 09:39:30,822 INFO  L226             Difference]: Without dead ends: 1132
[2025-03-08 09:39:30,823 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:39:30,823 INFO  L435           NwaCegarLoop]: 1374 mSDtfsCounter, 17 mSDsluCounter, 5467 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6841 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:30,823 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6841 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:39:30,824 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1132 states.
[2025-03-08 09:39:30,833 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1131.
[2025-03-08 09:39:30,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1131 states, 1130 states have (on average 1.4902654867256637) internal successors, (1684), 1130 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:30,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1684 transitions.
[2025-03-08 09:39:30,836 INFO  L78                 Accepts]: Start accepts. Automaton has 1131 states and 1684 transitions. Word has length 87
[2025-03-08 09:39:30,836 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:30,836 INFO  L471      AbstractCegarLoop]: Abstraction has 1131 states and 1684 transitions.
[2025-03-08 09:39:30,837 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:30,837 INFO  L276                IsEmpty]: Start isEmpty. Operand 1131 states and 1684 transitions.
[2025-03-08 09:39:30,837 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-03-08 09:39:30,837 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:30,837 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:30,837 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 09:39:30,838 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:30,838 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:30,838 INFO  L85        PathProgramCache]: Analyzing trace with hash 1416196138, now seen corresponding path program 1 times
[2025-03-08 09:39:30,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:30,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326377194]
[2025-03-08 09:39:30,838 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:30,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:30,862 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-03-08 09:39:30,874 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-03-08 09:39:30,875 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:30,875 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:31,080 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:31,080 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:39:31,080 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326377194]
[2025-03-08 09:39:31,080 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326377194] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:31,080 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:31,080 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:39:31,080 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030036726]
[2025-03-08 09:39:31,080 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:31,081 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:39:31,081 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:39:31,081 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:39:31,081 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:39:31,081 INFO  L87              Difference]: Start difference. First operand 1131 states and 1684 transitions. Second operand  has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:31,744 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:31,744 INFO  L93              Difference]: Finished difference Result 2993 states and 4465 transitions.
[2025-03-08 09:39:31,745 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:39:31,745 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87
[2025-03-08 09:39:31,745 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:31,750 INFO  L225             Difference]: With dead ends: 2993
[2025-03-08 09:39:31,750 INFO  L226             Difference]: Without dead ends: 1997
[2025-03-08 09:39:31,751 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:39:31,752 INFO  L435           NwaCegarLoop]: 1358 mSDtfsCounter, 4197 mSDsluCounter, 2713 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4197 SdHoareTripleChecker+Valid, 4071 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:31,752 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4197 Valid, 4071 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:39:31,754 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1997 states.
[2025-03-08 09:39:31,765 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1131.
[2025-03-08 09:39:31,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1131 states, 1130 states have (on average 1.4893805309734514) internal successors, (1683), 1130 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:31,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1683 transitions.
[2025-03-08 09:39:31,769 INFO  L78                 Accepts]: Start accepts. Automaton has 1131 states and 1683 transitions. Word has length 87
[2025-03-08 09:39:31,769 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:31,769 INFO  L471      AbstractCegarLoop]: Abstraction has 1131 states and 1683 transitions.
[2025-03-08 09:39:31,769 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:31,769 INFO  L276                IsEmpty]: Start isEmpty. Operand 1131 states and 1683 transitions.
[2025-03-08 09:39:31,769 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2025-03-08 09:39:31,769 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:31,770 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:31,770 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 09:39:31,771 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:31,771 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:31,771 INFO  L85        PathProgramCache]: Analyzing trace with hash 1154769310, now seen corresponding path program 1 times
[2025-03-08 09:39:31,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:31,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117098876]
[2025-03-08 09:39:31,771 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:31,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:31,798 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes.
[2025-03-08 09:39:31,831 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements.
[2025-03-08 09:39:31,831 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:31,831 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:32,606 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:32,607 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:39:32,607 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117098876]
[2025-03-08 09:39:32,607 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117098876] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:32,607 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:32,607 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-08 09:39:32,607 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717907597]
[2025-03-08 09:39:32,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:32,608 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 09:39:32,608 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:39:32,608 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 09:39:32,609 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132
[2025-03-08 09:39:32,609 INFO  L87              Difference]: Start difference. First operand 1131 states and 1683 transitions. Second operand  has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:34,228 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:34,228 INFO  L93              Difference]: Finished difference Result 2142 states and 3194 transitions.
[2025-03-08 09:39:34,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 09:39:34,228 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88
[2025-03-08 09:39:34,228 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:34,231 INFO  L225             Difference]: With dead ends: 2142
[2025-03-08 09:39:34,231 INFO  L226             Difference]: Without dead ends: 1146
[2025-03-08 09:39:34,232 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132
[2025-03-08 09:39:34,232 INFO  L435           NwaCegarLoop]: 1367 mSDtfsCounter, 5 mSDsluCounter, 13632 mSDsCounter, 0 mSdLazyCounter, 3299 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14999 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:34,232 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14999 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3299 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-03-08 09:39:34,233 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1146 states.
[2025-03-08 09:39:34,242 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1143.
[2025-03-08 09:39:34,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1143 states, 1142 states have (on average 1.4903677758318739) internal successors, (1702), 1142 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:34,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1702 transitions.
[2025-03-08 09:39:34,245 INFO  L78                 Accepts]: Start accepts. Automaton has 1143 states and 1702 transitions. Word has length 88
[2025-03-08 09:39:34,245 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:34,245 INFO  L471      AbstractCegarLoop]: Abstraction has 1143 states and 1702 transitions.
[2025-03-08 09:39:34,245 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:34,245 INFO  L276                IsEmpty]: Start isEmpty. Operand 1143 states and 1702 transitions.
[2025-03-08 09:39:34,246 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2025-03-08 09:39:34,246 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:34,246 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:34,246 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 09:39:34,246 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:34,246 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:34,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -1831165033, now seen corresponding path program 1 times
[2025-03-08 09:39:34,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:39:34,247 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007990224]
[2025-03-08 09:39:34,247 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:34,247 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:39:34,275 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-03-08 09:39:34,310 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-03-08 09:39:34,310 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:34,310 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 09:39:34,310 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 09:39:34,324 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-03-08 09:39:34,357 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-03-08 09:39:34,357 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:34,357 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 09:39:34,419 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 09:39:34,419 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 09:39:34,420 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 09:39:34,421 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 09:39:34,424 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:34,464 WARN  L310   BoogieBacktranslator]: Removing null node from list of ATEs: ATE  program state null
[2025-03-08 09:39:34,481 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 09:39:34,483 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:39:34 BoogieIcfgContainer
[2025-03-08 09:39:34,483 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 09:39:34,487 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 09:39:34,487 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 09:39:34,488 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 09:39:34,488 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:39:16" (3/4) ...
[2025-03-08 09:39:34,491 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-08 09:39:34,491 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 09:39:34,492 INFO  L158              Benchmark]: Toolchain (without parser) took 23408.86ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 103.8MB in the beginning and 127.5MB in the end (delta: -23.7MB). Peak memory consumption was 293.6MB. Max. memory is 16.1GB.
[2025-03-08 09:39:34,492 INFO  L158              Benchmark]: CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 09:39:34,492 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 669.21ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 73.3MB in the end (delta: 30.5MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB.
[2025-03-08 09:39:34,493 INFO  L158              Benchmark]: Boogie Procedure Inliner took 468.60ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 73.3MB in the beginning and 215.0MB in the end (delta: -141.6MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB.
[2025-03-08 09:39:34,493 INFO  L158              Benchmark]: Boogie Preprocessor took 467.10ms. Allocated memory is still 335.5MB. Free memory was 215.0MB in the beginning and 196.7MB in the end (delta: 18.3MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB.
[2025-03-08 09:39:34,494 INFO  L158              Benchmark]: IcfgBuilder took 4224.61ms. Allocated memory was 335.5MB in the beginning and 553.6MB in the end (delta: 218.1MB). Free memory was 196.7MB in the beginning and 176.3MB in the end (delta: 20.3MB). Peak memory consumption was 262.2MB. Max. memory is 16.1GB.
[2025-03-08 09:39:34,495 INFO  L158              Benchmark]: TraceAbstraction took 17562.67ms. Allocated memory was 553.6MB in the beginning and 453.0MB in the end (delta: -100.7MB). Free memory was 176.3MB in the beginning and 127.5MB in the end (delta: 48.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 09:39:34,495 INFO  L158              Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 453.0MB. Free memory was 127.5MB in the beginning and 127.5MB in the end (delta: 39.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 09:39:34,496 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 669.21ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 73.3MB in the end (delta: 30.5MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 468.60ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 73.3MB in the beginning and 215.0MB in the end (delta: -141.6MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 467.10ms. Allocated memory is still 335.5MB. Free memory was 215.0MB in the beginning and 196.7MB in the end (delta: 18.3MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB.
 * IcfgBuilder took 4224.61ms. Allocated memory was 335.5MB in the beginning and 553.6MB in the end (delta: 218.1MB). Free memory was 196.7MB in the beginning and 176.3MB in the end (delta: 20.3MB). Peak memory consumption was 262.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 17562.67ms. Allocated memory was 553.6MB in the beginning and 453.0MB in the end (delta: -100.7MB). Free memory was 176.3MB in the beginning and 127.5MB in the end (delta: 48.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * Witness Printer took 4.20ms. Allocated memory is still 453.0MB. Free memory was 127.5MB in the beginning and 127.5MB in the end (delta: 39.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: overapproximation of bitwiseOr at line 376. 
Possible FailurePath: 
[L26]              const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2);
[L27]              const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1);
[L29]              const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1);
[L30]              const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1);
[L32]              const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3);
[L33]              const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1);
[L35]              const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4);
[L36]              const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1);
[L38]              const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8);
[L39]              const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1);
[L41]              const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7);
[L42]              const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1);
[L44]              const SORT_21 var_22 = 1;
[L45]              const SORT_21 var_28 = 0;
[L46]              const SORT_21 var_32 = 2;
[L47]              const SORT_21 var_35 = 4;
[L48]              const SORT_21 var_38 = 64;
[L49]              const SORT_3 var_45 = 1;
[L50]              const SORT_3 var_49 = 0;
[L51]              const SORT_6 var_134 = 0;
[L52]              const SORT_21 var_728 = 8;
[L53]              const SORT_21 var_748 = 16;
[L54]              const SORT_21 var_763 = 32;
[L56]              SORT_1 input_2;
[L57]              SORT_3 input_4;
[L58]              SORT_3 input_5;
[L59]              SORT_6 input_7;
[L60]              SORT_3 input_8;
[L61]              SORT_3 input_9;
[L62]              SORT_3 input_10;
[L63]              SORT_3 input_11;
[L64]              SORT_12 input_13;
[L65]              SORT_3 input_14;
[L66]              SORT_3 input_15;
[L67]              SORT_16 input_17;
[L68]              SORT_3 input_18;
[L69]              SORT_3 input_19;
[L70]              SORT_3 input_20;
[L71]              SORT_3 input_356;
[L72]              SORT_3 input_378;
[L73]              SORT_3 input_393;
[L74]              SORT_3 input_408;
[L75]              SORT_3 input_423;
[L76]              SORT_3 input_438;
[L77]              SORT_3 input_453;
[L78]              SORT_3 input_468;
[L79]              SORT_3 input_483;
[L80]              SORT_3 input_498;
[L81]              SORT_3 input_513;
[L82]              SORT_3 input_528;
[L83]              SORT_3 input_543;
[L84]              SORT_3 input_558;
[L85]              SORT_3 input_573;
[L86]              SORT_3 input_588;
[L87]              SORT_3 input_604;
[L88]              SORT_3 input_606;
[L89]              SORT_3 input_608;
[L90]              SORT_3 input_610;
[L91]              SORT_3 input_612;
[L92]              SORT_3 input_614;
[L93]              SORT_3 input_616;
[L94]              SORT_3 input_618;
[L95]              SORT_3 input_623;
[L96]              SORT_21 input_664;
[L97]              SORT_21 input_665;
[L98]              SORT_21 input_666;
[L99]              SORT_21 input_667;
[L100]             SORT_21 input_670;
[L101]             SORT_21 input_674;
[L102]             SORT_21 input_678;
[L103]             SORT_21 input_686;
[L104]             SORT_21 input_690;
[L105]             SORT_21 input_692;
[L106]             SORT_21 input_696;
[L107]             SORT_21 input_699;
[L108]             SORT_21 input_703;
[L109]             SORT_21 input_708;
[L110]             SORT_21 input_712;
[L111]             SORT_21 input_717;
[L112]             SORT_21 input_719;
[L113]             SORT_21 input_720;
[L114]             SORT_21 input_722;
[L115]             SORT_21 input_726;
[L116]             SORT_21 input_732;
[L117]             SORT_21 input_739;
[L118]             SORT_21 input_740;
[L119]             SORT_21 input_742;
[L120]             SORT_21 input_746;
[L121]             SORT_21 input_752;
[L122]             SORT_21 input_754;
[L123]             SORT_21 input_755;
[L124]             SORT_21 input_757;
[L125]             SORT_21 input_761;
[L126]             SORT_21 input_767;
[L127]             SORT_21 input_771;
[L128]             SORT_21 input_776;
[L129]             SORT_21 input_778;
[L130]             SORT_21 input_784;
[L131]             SORT_21 input_796;
[L132]             SORT_3 input_801;
[L133]             SORT_3 input_810;
[L134]             SORT_3 input_829;
[L135]             SORT_3 input_836;
[L136]             SORT_3 input_847;
[L137]             SORT_3 input_853;
[L138]             SORT_3 input_859;
[L139]             SORT_3 input_865;
[L140]             SORT_3 input_871;
[L141]             SORT_3 input_877;
[L142]             SORT_3 input_883;
[L143]             SORT_3 input_889;
[L144]             SORT_3 input_895;
[L145]             SORT_3 input_901;
[L146]             SORT_3 input_907;
[L147]             SORT_3 input_913;
[L148]             SORT_3 input_919;
[L150]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_21
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L150]             SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21;
[L151]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_21
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L151]             SORT_21 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_21;
[L152]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L152]             SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L153]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L153]             SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L154]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L154]             SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L155]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L155]             SORT_3 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L156]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L156]             SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L157]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L157]             SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L158]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L158]             SORT_3 state_82 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L159]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L159]             SORT_3 state_99 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L160]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L160]             SORT_3 state_102 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L161]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L161]             SORT_3 state_104 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L162]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L162]             SORT_3 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L163]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L163]             SORT_3 state_112 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L164]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L164]             SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L165]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L165]             SORT_3 state_120 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L166]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L166]             SORT_3 state_130 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L167]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L167]             SORT_3 state_137 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L168]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L168]             SORT_3 state_140 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L169]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L169]             SORT_3 state_149 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L170]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L170]             SORT_3 state_154 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L171]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L171]             SORT_3 state_157 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L172]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L172]             SORT_3 state_169 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L173]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L173]             SORT_3 state_179 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L174]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L174]             SORT_3 state_184 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L175]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L175]             SORT_3 state_187 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L176]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L176]             SORT_3 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L177]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L177]             SORT_3 state_209 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L178]  EXPR       __VERIFIER_nondet_uchar() & mask_SORT_3
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L178]             SORT_3 state_222 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L180]             SORT_21 init_24_arg_1 = var_22;
[L181]             state_23 = init_24_arg_1
[L182]             SORT_21 init_27_arg_1 = var_22;
[L183]             state_26 = init_27_arg_1
[L184]             SORT_3 init_51_arg_1 = var_49;
[L185]             state_50 = init_51_arg_1
[L186]             SORT_3 init_53_arg_1 = var_49;
[L187]             state_52 = init_53_arg_1
[L188]             SORT_3 init_55_arg_1 = var_49;
[L189]             state_54 = init_55_arg_1
[L190]             SORT_3 init_59_arg_1 = var_49;
[L191]             state_58 = init_59_arg_1
[L192]             SORT_3 init_63_arg_1 = var_49;
[L193]             state_62 = init_63_arg_1
[L194]             SORT_3 init_67_arg_1 = var_49;
[L195]             state_66 = init_67_arg_1
[L196]             SORT_3 init_83_arg_1 = var_49;
[L197]             state_82 = init_83_arg_1
[L198]             SORT_3 init_100_arg_1 = var_49;
[L199]             state_99 = init_100_arg_1
[L200]             SORT_3 init_103_arg_1 = var_49;
[L201]             state_102 = init_103_arg_1
[L202]             SORT_3 init_105_arg_1 = var_49;
[L203]             state_104 = init_105_arg_1
[L204]             SORT_3 init_109_arg_1 = var_49;
[L205]             state_108 = init_109_arg_1
[L206]             SORT_3 init_113_arg_1 = var_49;
[L207]             state_112 = init_113_arg_1
[L208]             SORT_3 init_118_arg_1 = var_49;
[L209]             state_117 = init_118_arg_1
[L210]             SORT_3 init_121_arg_1 = var_49;
[L211]             state_120 = init_121_arg_1
[L212]             SORT_3 init_131_arg_1 = var_49;
[L213]             state_130 = init_131_arg_1
[L214]             SORT_3 init_138_arg_1 = var_49;
[L215]             state_137 = init_138_arg_1
[L216]             SORT_3 init_141_arg_1 = var_49;
[L217]             state_140 = init_141_arg_1
[L218]             SORT_3 init_150_arg_1 = var_49;
[L219]             state_149 = init_150_arg_1
[L220]             SORT_3 init_155_arg_1 = var_49;
[L221]             state_154 = init_155_arg_1
[L222]             SORT_3 init_158_arg_1 = var_49;
[L223]             state_157 = init_158_arg_1
[L224]             SORT_3 init_170_arg_1 = var_49;
[L225]             state_169 = init_170_arg_1
[L226]             SORT_3 init_180_arg_1 = var_49;
[L227]             state_179 = init_180_arg_1
[L228]             SORT_3 init_185_arg_1 = var_49;
[L229]             state_184 = init_185_arg_1
[L230]             SORT_3 init_188_arg_1 = var_49;
[L231]             state_187 = init_188_arg_1
[L232]             SORT_3 init_197_arg_1 = var_49;
[L233]             state_196 = init_197_arg_1
[L234]             SORT_3 init_210_arg_1 = var_49;
[L235]             state_209 = init_210_arg_1
[L236]             SORT_3 init_223_arg_1 = var_49;
[L237]             state_222 = init_223_arg_1
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L240]             input_2 = __VERIFIER_nondet_uchar()
[L241]             input_4 = __VERIFIER_nondet_uchar()
[L242]             input_5 = __VERIFIER_nondet_uchar()
[L243]             input_7 = __VERIFIER_nondet_uchar()
[L244]  EXPR       input_7 & mask_SORT_6
        VAL        [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L244]             input_7 = input_7 & mask_SORT_6
[L245]             input_8 = __VERIFIER_nondet_uchar()
[L246]             input_9 = __VERIFIER_nondet_uchar()
[L247]             input_10 = __VERIFIER_nondet_uchar()
[L248]             input_11 = __VERIFIER_nondet_uchar()
[L249]             input_13 = __VERIFIER_nondet_uchar()
[L250]             input_14 = __VERIFIER_nondet_uchar()
[L251]             input_15 = __VERIFIER_nondet_uchar()
[L252]             input_17 = __VERIFIER_nondet_uchar()
[L253]             input_18 = __VERIFIER_nondet_uchar()
[L254]             input_19 = __VERIFIER_nondet_uchar()
[L255]             input_20 = __VERIFIER_nondet_uchar()
[L256]             input_356 = __VERIFIER_nondet_uchar()
[L257]             input_378 = __VERIFIER_nondet_uchar()
[L258]             input_393 = __VERIFIER_nondet_uchar()
[L259]             input_408 = __VERIFIER_nondet_uchar()
[L260]             input_423 = __VERIFIER_nondet_uchar()
[L261]             input_438 = __VERIFIER_nondet_uchar()
[L262]             input_453 = __VERIFIER_nondet_uchar()
[L263]             input_468 = __VERIFIER_nondet_uchar()
[L264]             input_483 = __VERIFIER_nondet_uchar()
[L265]             input_498 = __VERIFIER_nondet_uchar()
[L266]             input_513 = __VERIFIER_nondet_uchar()
[L267]             input_528 = __VERIFIER_nondet_uchar()
[L268]             input_543 = __VERIFIER_nondet_uchar()
[L269]             input_558 = __VERIFIER_nondet_uchar()
[L270]             input_573 = __VERIFIER_nondet_uchar()
[L271]             input_588 = __VERIFIER_nondet_uchar()
[L272]             input_604 = __VERIFIER_nondet_uchar()
[L273]             input_606 = __VERIFIER_nondet_uchar()
[L274]             input_608 = __VERIFIER_nondet_uchar()
[L275]             input_610 = __VERIFIER_nondet_uchar()
[L276]             input_612 = __VERIFIER_nondet_uchar()
[L277]             input_614 = __VERIFIER_nondet_uchar()
[L278]             input_616 = __VERIFIER_nondet_uchar()
[L279]             input_618 = __VERIFIER_nondet_uchar()
[L280]             input_623 = __VERIFIER_nondet_uchar()
[L281]             input_664 = __VERIFIER_nondet_uchar()
[L282]             input_665 = __VERIFIER_nondet_uchar()
[L283]             input_666 = __VERIFIER_nondet_uchar()
[L284]             input_667 = __VERIFIER_nondet_uchar()
[L285]             input_670 = __VERIFIER_nondet_uchar()
[L286]             input_674 = __VERIFIER_nondet_uchar()
[L287]             input_678 = __VERIFIER_nondet_uchar()
[L288]             input_686 = __VERIFIER_nondet_uchar()
[L289]             input_690 = __VERIFIER_nondet_uchar()
[L290]             input_692 = __VERIFIER_nondet_uchar()
[L291]             input_696 = __VERIFIER_nondet_uchar()
[L292]             input_699 = __VERIFIER_nondet_uchar()
[L293]             input_703 = __VERIFIER_nondet_uchar()
[L294]             input_708 = __VERIFIER_nondet_uchar()
[L295]             input_712 = __VERIFIER_nondet_uchar()
[L296]             input_717 = __VERIFIER_nondet_uchar()
[L297]             input_719 = __VERIFIER_nondet_uchar()
[L298]             input_720 = __VERIFIER_nondet_uchar()
[L299]             input_722 = __VERIFIER_nondet_uchar()
[L300]             input_726 = __VERIFIER_nondet_uchar()
[L301]             input_732 = __VERIFIER_nondet_uchar()
[L302]             input_739 = __VERIFIER_nondet_uchar()
[L303]             input_740 = __VERIFIER_nondet_uchar()
[L304]             input_742 = __VERIFIER_nondet_uchar()
[L305]             input_746 = __VERIFIER_nondet_uchar()
[L306]             input_752 = __VERIFIER_nondet_uchar()
[L307]             input_754 = __VERIFIER_nondet_uchar()
[L308]             input_755 = __VERIFIER_nondet_uchar()
[L309]             input_757 = __VERIFIER_nondet_uchar()
[L310]             input_761 = __VERIFIER_nondet_uchar()
[L311]             input_767 = __VERIFIER_nondet_uchar()
[L312]             input_771 = __VERIFIER_nondet_uchar()
[L313]             input_776 = __VERIFIER_nondet_uchar()
[L314]             input_778 = __VERIFIER_nondet_uchar()
[L315]             input_784 = __VERIFIER_nondet_uchar()
[L316]             input_796 = __VERIFIER_nondet_uchar()
[L317]             input_801 = __VERIFIER_nondet_uchar()
[L318]             input_810 = __VERIFIER_nondet_uchar()
[L319]             input_829 = __VERIFIER_nondet_uchar()
[L320]             input_836 = __VERIFIER_nondet_uchar()
[L321]             input_847 = __VERIFIER_nondet_uchar()
[L322]             input_853 = __VERIFIER_nondet_uchar()
[L323]             input_859 = __VERIFIER_nondet_uchar()
[L324]             input_865 = __VERIFIER_nondet_uchar()
[L325]             input_871 = __VERIFIER_nondet_uchar()
[L326]             input_877 = __VERIFIER_nondet_uchar()
[L327]             input_883 = __VERIFIER_nondet_uchar()
[L328]             input_889 = __VERIFIER_nondet_uchar()
[L329]             input_895 = __VERIFIER_nondet_uchar()
[L330]             input_901 = __VERIFIER_nondet_uchar()
[L331]             input_907 = __VERIFIER_nondet_uchar()
[L332]             input_913 = __VERIFIER_nondet_uchar()
[L333]             input_919 = __VERIFIER_nondet_uchar()
[L336]             SORT_21 var_25_arg_0 = state_23;
[L337]             SORT_21 var_25_arg_1 = var_22;
[L338]             SORT_3 var_25 = var_25_arg_0 == var_25_arg_1;
[L339]             SORT_21 var_29_arg_0 = state_26;
[L340]             SORT_21 var_29_arg_1 = var_28;
[L341]             SORT_3 var_29 = var_29_arg_0 == var_29_arg_1;
[L342]             SORT_21 var_30_arg_0 = state_26;
[L343]             SORT_21 var_30_arg_1 = var_22;
[L344]             SORT_3 var_30 = var_30_arg_0 == var_30_arg_1;
[L345]             SORT_3 var_31_arg_0 = var_29;
[L346]             SORT_3 var_31_arg_1 = var_30;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_31_arg_0=0, var_31_arg_1=1, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L347]  EXPR       var_31_arg_0 | var_31_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L347]             SORT_3 var_31 = var_31_arg_0 | var_31_arg_1;
[L348]             SORT_21 var_33_arg_0 = state_26;
[L349]             SORT_21 var_33_arg_1 = var_32;
[L350]             SORT_3 var_33 = var_33_arg_0 == var_33_arg_1;
[L351]             SORT_3 var_34_arg_0 = var_31;
[L352]             SORT_3 var_34_arg_1 = var_33;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_34_arg_0=1, var_34_arg_1=0, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L353]  EXPR       var_34_arg_0 | var_34_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L353]             SORT_3 var_34 = var_34_arg_0 | var_34_arg_1;
[L354]             SORT_21 var_36_arg_0 = state_26;
[L355]             SORT_21 var_36_arg_1 = var_35;
[L356]             SORT_3 var_36 = var_36_arg_0 == var_36_arg_1;
[L357]             SORT_3 var_37_arg_0 = var_34;
[L358]             SORT_3 var_37_arg_1 = var_36;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_37_arg_0=1, var_37_arg_1=0, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L359]  EXPR       var_37_arg_0 | var_37_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L359]             SORT_3 var_37 = var_37_arg_0 | var_37_arg_1;
[L360]             SORT_21 var_39_arg_0 = state_26;
[L361]             SORT_21 var_39_arg_1 = var_38;
[L362]             SORT_3 var_39 = var_39_arg_0 == var_39_arg_1;
[L363]             SORT_3 var_40_arg_0 = var_37;
[L364]             SORT_3 var_40_arg_1 = var_39;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_40_arg_0=1, var_40_arg_1=0, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L365]  EXPR       var_40_arg_0 | var_40_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_25=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L365]             SORT_3 var_40 = var_40_arg_0 | var_40_arg_1;
[L366]             SORT_3 var_41_arg_0 = var_25;
[L367]             SORT_3 var_41_arg_1 = var_40;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_41_arg_0=1, var_41_arg_1=1, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L368]  EXPR       var_41_arg_0 & var_41_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_23=1, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L368]             SORT_3 var_41 = var_41_arg_0 & var_41_arg_1;
[L369]             SORT_21 var_42_arg_0 = state_23;
[L370]             SORT_21 var_42_arg_1 = var_22;
[L371]             SORT_3 var_42 = var_42_arg_0 == var_42_arg_1;
[L372]             SORT_3 var_43_arg_0 = var_42;
[L373]             SORT_3 var_43 = ~var_43_arg_0;
[L374]             SORT_3 var_44_arg_0 = var_41;
[L375]             SORT_3 var_44_arg_1 = var_43;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_44_arg_0=1, var_44_arg_1=-2, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L376]  EXPR       var_44_arg_0 | var_44_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L376]             SORT_3 var_44 = var_44_arg_0 | var_44_arg_1;
[L377]             SORT_3 var_46_arg_0 = var_44;
[L378]             SORT_3 var_46 = ~var_46_arg_0;
[L379]             SORT_3 var_47_arg_0 = var_45;
[L380]             SORT_3 var_47_arg_1 = var_46;
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_47_arg_0=1, var_47_arg_1=-255, var_49=0, var_728=8, var_748=16, var_763=32]
[L381]  EXPR       var_47_arg_0 & var_47_arg_1
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L381]             SORT_3 var_47 = var_47_arg_0 & var_47_arg_1;
[L382]  EXPR       var_47 & mask_SORT_3
        VAL        [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_102=0, state_104=0, state_108=0, state_112=0, state_117=0, state_120=0, state_130=0, state_137=0, state_140=0, state_149=0, state_154=0, state_157=0, state_169=0, state_179=0, state_184=0, state_187=0, state_196=0, state_209=0, state_222=0, state_26=1, state_50=0, state_52=0, state_54=0, state_58=0, state_62=0, state_66=0, state_82=0, state_99=0, var_134=0, var_22=1, var_28=0, var_32=2, var_35=4, var_38=64, var_45=1, var_49=0, var_728=8, var_748=16, var_763=32]
[L382]             var_47 = var_47 & mask_SORT_3
[L383]             SORT_3 bad_48_arg_0 = var_47;
[L384]  CALL       __VERIFIER_assert(!(bad_48_arg_0))
[L21]   COND TRUE  !(cond)
[L21]              reach_error()

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 1110 locations, 1661 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29912 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29912 mSDsluCounter, 75659 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59298 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16505 IncrementalHoareTripleChecker+Invalid, 16507 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 16361 mSDtfsCounter, 16505 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1143occurred in iteration=12, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 6120 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1108 NumberOfCodeBlocks, 1108 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1007 ConstructedInterpolants, 0 QuantifiedInterpolants, 4500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2025-03-08 09:39:34,522 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 09:39:36,603 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 09:39:36,693 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf
[2025-03-08 09:39:36,698 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 09:39:36,698 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 09:39:36,726 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 09:39:36,727 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 09:39:36,727 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 09:39:36,727 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 09:39:36,727 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 09:39:36,728 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 09:39:36,728 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 09:39:36,728 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 09:39:36,728 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 09:39:36,728 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 09:39:36,729 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 09:39:36,730 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 09:39:36,730 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 09:39:36,730 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 09:39:36,730 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 09:39:36,730 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 09:39:36,730 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-08 09:39:36,730 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-08 09:39:36,730 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-08 09:39:36,730 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 09:39:36,730 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 09:39:36,730 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 09:39:36,731 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 09:39:36,731 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 09:39:36,731 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 09:39:36,731 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 09:39:36,731 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 09:39:36,731 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 09:39:36,731 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 09:39:36,732 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 09:39:36,732 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 09:39:36,732 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-08 09:39:36,732 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt 
[2025-03-08 09:39:36,732 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 09:39:36,732 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 09:39:36,732 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 09:39:36,732 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 09:39:36,732 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 -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec4ad5c3087d33b41ea5a98e18a71d9d74f551b4f0d4a83a1cb74449f522f78e
[2025-03-08 09:39:37,016 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 09:39:37,026 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 09:39:37,027 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 09:39:37,029 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 09:39:37,029 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 09:39:37,030 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c
[2025-03-08 09:39:38,326 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070e263bd/91a1795c5791419da12e482ed604bf28/FLAG26136a603
[2025-03-08 09:39:38,635 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 09:39:38,636 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c
[2025-03-08 09:39:38,662 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070e263bd/91a1795c5791419da12e482ed604bf28/FLAG26136a603
[2025-03-08 09:39:38,881 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070e263bd/91a1795c5791419da12e482ed604bf28
[2025-03-08 09:39:38,883 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 09:39:38,884 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 09:39:38,885 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 09:39:38,885 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 09:39:38,889 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 09:39:38,889 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:39:38" (1/1) ...
[2025-03-08 09:39:38,890 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe47377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:38, skipping insertion in model container
[2025-03-08 09:39:38,890 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:39:38" (1/1) ...
[2025-03-08 09:39:38,946 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 09:39:39,116 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c[1268,1281]
[2025-03-08 09:39:39,368 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 09:39:39,378 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 09:39:39,385 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/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c[1268,1281]
[2025-03-08 09:39:39,541 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 09:39:39,556 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 09:39:39,557 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39 WrapperNode
[2025-03-08 09:39:39,557 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 09:39:39,558 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 09:39:39,558 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 09:39:39,558 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 09:39:39,563 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (1/1) ...
[2025-03-08 09:39:39,601 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (1/1) ...
[2025-03-08 09:39:39,678 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2612
[2025-03-08 09:39:39,678 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 09:39:39,679 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 09:39:39,679 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 09:39:39,679 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 09:39:39,686 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (1/1) ...
[2025-03-08 09:39:39,687 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (1/1) ...
[2025-03-08 09:39:39,700 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (1/1) ...
[2025-03-08 09:39:39,740 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 09:39:39,740 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (1/1) ...
[2025-03-08 09:39:39,740 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (1/1) ...
[2025-03-08 09:39:39,781 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (1/1) ...
[2025-03-08 09:39:39,789 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (1/1) ...
[2025-03-08 09:39:39,795 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (1/1) ...
[2025-03-08 09:39:39,834 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (1/1) ...
[2025-03-08 09:39:39,851 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 09:39:39,853 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 09:39:39,853 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 09:39:39,853 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 09:39:39,854 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (1/1) ...
[2025-03-08 09:39:39,858 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 09:39:39,868 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:39:39,881 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 09:39:39,887 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 09:39:39,908 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 09:39:39,908 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-08 09:39:39,908 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 09:39:39,908 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 09:39:40,330 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 09:39:40,332 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 09:39:42,469 INFO  L?                        ?]: Removed 155 outVars from TransFormulas that were not future-live.
[2025-03-08 09:39:42,470 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 09:39:42,477 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 09:39:42,477 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 09:39:42,478 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:39:42 BoogieIcfgContainer
[2025-03-08 09:39:42,478 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 09:39:42,480 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 09:39:42,480 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 09:39:42,483 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 09:39:42,484 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:39:38" (1/3) ...
[2025-03-08 09:39:42,485 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c884b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:39:42, skipping insertion in model container
[2025-03-08 09:39:42,485 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:39:39" (2/3) ...
[2025-03-08 09:39:42,485 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c884b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:39:42, skipping insertion in model container
[2025-03-08 09:39:42,485 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:39:42" (3/3) ...
[2025-03-08 09:39:42,487 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c
[2025-03-08 09:39:42,498 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 09:39:42,500 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p4.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 09:39:42,535 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 09:39:42,544 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;@558944f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 09:39:42,545 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 09:39:42,548 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:42,551 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2025-03-08 09:39:42,551 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:42,551 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2025-03-08 09:39:42,552 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:42,555 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:42,556 INFO  L85        PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times
[2025-03-08 09:39:42,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 09:39:42,564 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1729806749]
[2025-03-08 09:39:42,565 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:42,566 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:39:42,566 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:39:42,568 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 09:39:42,574 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 09:39:42,991 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-03-08 09:39:43,011 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-03-08 09:39:43,012 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:43,012 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:43,017 INFO  L256         TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 32 conjuncts are in the unsatisfiable core
[2025-03-08 09:39:43,028 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 09:39:43,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:39:43,170 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 09:39:43,171 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 09:39:43,171 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729806749]
[2025-03-08 09:39:43,172 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729806749] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:39:43,172 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:39:43,172 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:39:43,173 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109262038]
[2025-03-08 09:39:43,174 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:39:43,176 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:39:43,176 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 09:39:43,189 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:39:43,190 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:39:43,192 INFO  L87              Difference]: Start difference. First operand  has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:43,258 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:39:43,258 INFO  L93              Difference]: Finished difference Result 17 states and 22 transitions.
[2025-03-08 09:39:43,261 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:39:43,262 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5
[2025-03-08 09:39:43,262 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:39:43,266 INFO  L225             Difference]: With dead ends: 17
[2025-03-08 09:39:43,266 INFO  L226             Difference]: Without dead ends: 9
[2025-03-08 09:39:43,268 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:39:43,270 INFO  L435           NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-08 09:39:43,272 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-08 09:39:43,282 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2025-03-08 09:39:43,289 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2025-03-08 09:39:43,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:43,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2025-03-08 09:39:43,292 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5
[2025-03-08 09:39:43,292 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:39:43,292 INFO  L471      AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2025-03-08 09:39:43,292 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:39:43,292 INFO  L276                IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2025-03-08 09:39:43,293 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2025-03-08 09:39:43,293 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:39:43,293 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1]
[2025-03-08 09:39:43,303 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 09:39:43,502 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
[2025-03-08 09:39:43,503 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:39:43,503 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:39:43,504 INFO  L85        PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times
[2025-03-08 09:39:43,505 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 09:39:43,505 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732878442]
[2025-03-08 09:39:43,505 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:39:43,505 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:39:43,506 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:39:43,509 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-08 09:39:43,511 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-08 09:39:44,018 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-03-08 09:39:44,132 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-03-08 09:39:44,132 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:39:44,132 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:39:44,143 INFO  L256         TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 57 conjuncts are in the unsatisfiable core
[2025-03-08 09:39:44,160 INFO  L279         TraceCheckSpWp]: Computing forward predicates...