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


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


Checking for ERROR reachability
Using default analysis
Version 48c9605d
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.needham.2.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85ec56baa2b17a6e40a879704c8e2ea99a008799770092f5387a9f2ee7accb2a
[2025-02-07 23:33:24,010 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-07 23:33:24,018 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-07 23:33:24,020 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-07 23:33:24,021 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-07 23:33:24,022 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-07 23:33:24,023 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.needham.2.prop1-func-interl.c
[2025-02-07 23:33:25,306 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcb5d27e7/8f32eaa673bd4df1a8e15c0acbf0d3f5/FLAGf6060ff03
[2025-02-07 23:33:25,851 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-07 23:33:25,852 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.needham.2.prop1-func-interl.c
[2025-02-07 23:33:25,888 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcb5d27e7/8f32eaa673bd4df1a8e15c0acbf0d3f5/FLAGf6060ff03
[2025-02-07 23:33:25,911 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcb5d27e7/8f32eaa673bd4df1a8e15c0acbf0d3f5
[2025-02-07 23:33:25,914 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-07 23:33:25,915 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-07 23:33:25,916 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-07 23:33:25,916 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-07 23:33:25,922 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-07 23:33:25,922 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:33:25" (1/1) ...
[2025-02-07 23:33:25,925 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52dab864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:25, skipping insertion in model container
[2025-02-07 23:33:25,925 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:33:25" (1/1) ...
[2025-02-07 23:33:26,016 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-07 23:33:26,236 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.needham.2.prop1-func-interl.c[1174,1187]
[2025-02-07 23:33:26,927 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 23:33:26,937 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-07 23:33:26,949 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.needham.2.prop1-func-interl.c[1174,1187]
[2025-02-07 23:33:27,504 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 23:33:27,518 INFO  L204         MainTranslator]: Completed translation
[2025-02-07 23:33:27,519 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27 WrapperNode
[2025-02-07 23:33:27,519 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-07 23:33:27,520 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-07 23:33:27,520 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-07 23:33:27,520 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-07 23:33:27,525 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (1/1) ...
[2025-02-07 23:33:27,621 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (1/1) ...
[2025-02-07 23:33:29,272 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 18234
[2025-02-07 23:33:29,273 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-07 23:33:29,274 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-07 23:33:29,274 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-07 23:33:29,274 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-07 23:33:29,280 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (1/1) ...
[2025-02-07 23:33:29,280 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (1/1) ...
[2025-02-07 23:33:29,631 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (1/1) ...
[2025-02-07 23:33:29,879 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-07 23:33:29,880 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (1/1) ...
[2025-02-07 23:33:29,880 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (1/1) ...
[2025-02-07 23:33:30,361 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (1/1) ...
[2025-02-07 23:33:30,408 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (1/1) ...
[2025-02-07 23:33:30,490 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (1/1) ...
[2025-02-07 23:33:30,564 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (1/1) ...
[2025-02-07 23:33:30,898 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-07 23:33:30,899 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-07 23:33:30,899 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-07 23:33:30,899 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-07 23:33:30,900 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (1/1) ...
[2025-02-07 23:33:30,904 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 23:33:30,915 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 23:33:30,927 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-07 23:33:30,933 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-07 23:33:30,950 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-07 23:33:30,950 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-07 23:33:30,951 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-07 23:33:30,951 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-07 23:33:31,776 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-07 23:33:31,777 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-07 23:34:10,540 INFO  L?                        ?]: Removed 9832 outVars from TransFormulas that were not future-live.
[2025-02-07 23:34:10,541 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-07 23:34:11,131 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-07 23:34:11,132 INFO  L337             CfgBuilder]: Removed 11 assume(true) statements.
[2025-02-07 23:34:11,133 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:34:11 BoogieIcfgContainer
[2025-02-07 23:34:11,133 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-07 23:34:11,135 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-07 23:34:11,136 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-07 23:34:11,140 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-07 23:34:11,141 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:33:25" (1/3) ...
[2025-02-07 23:34:11,141 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1ac896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:34:11, skipping insertion in model container
[2025-02-07 23:34:11,141 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:33:27" (2/3) ...
[2025-02-07 23:34:11,142 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1ac896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:34:11, skipping insertion in model container
[2025-02-07 23:34:11,142 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:34:11" (3/3) ...
[2025-02-07 23:34:11,144 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.needham.2.prop1-func-interl.c
[2025-02-07 23:34:11,163 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-07 23:34:11,165 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.needham.2.prop1-func-interl.c that has 1 procedures, 6633 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-07 23:34:11,343 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-07 23:34:11,355 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;@2c4c7b1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-07 23:34:11,355 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-07 23:34:11,379 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 6633 states, 6631 states have (on average 1.5038455738199366) internal successors, (9972), 6632 states have internal predecessors, (9972), 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-02-07 23:34:11,403 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 275
[2025-02-07 23:34:11,403 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:34:11,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 23:34:11,404 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:34:11,409 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:34:11,409 INFO  L85        PathProgramCache]: Analyzing trace with hash -938782247, now seen corresponding path program 1 times
[2025-02-07 23:34:11,414 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:34:11,415 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30012964]
[2025-02-07 23:34:11,415 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:34:11,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:34:11,589 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes.
[2025-02-07 23:34:11,803 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements.
[2025-02-07 23:34:11,803 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:34:11,804 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:34:13,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:34:13,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:34:13,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30012964]
[2025-02-07 23:34:13,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30012964] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:34:13,131 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:34:13,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:34:13,133 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54018676]
[2025-02-07 23:34:13,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:34:13,139 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:34:13,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:34:13,163 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:34:13,163 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:34:13,181 INFO  L87              Difference]: Start difference. First operand  has 6633 states, 6631 states have (on average 1.5038455738199366) internal successors, (9972), 6632 states have internal predecessors, (9972), 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 68.5) internal successors, (274), 4 states have internal predecessors, (274), 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-02-07 23:34:16,720 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:34:16,720 INFO  L93              Difference]: Finished difference Result 13061 states and 19639 transitions.
[2025-02-07 23:34:16,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:34:16,722 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 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 274
[2025-02-07 23:34:16,723 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:34:16,771 INFO  L225             Difference]: With dead ends: 13061
[2025-02-07 23:34:16,771 INFO  L226             Difference]: Without dead ends: 6633
[2025-02-07 23:34:16,790 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-02-07 23:34:16,793 INFO  L435           NwaCegarLoop]: 8318 mSDtfsCounter, 0 mSDsluCounter, 16631 mSDsCounter, 0 mSdLazyCounter, 4957 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24949 SdHoareTripleChecker+Invalid, 4957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:34:16,793 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24949 Invalid, 4957 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 4957 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time]
[2025-02-07 23:34:16,824 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6633 states.
[2025-02-07 23:34:17,026 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6633 to 6633.
[2025-02-07 23:34:17,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6633 states, 6632 states have (on average 1.5034680337756332) internal successors, (9971), 6632 states have internal predecessors, (9971), 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-02-07 23:34:17,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6633 states to 6633 states and 9971 transitions.
[2025-02-07 23:34:17,068 INFO  L78                 Accepts]: Start accepts. Automaton has 6633 states and 9971 transitions. Word has length 274
[2025-02-07 23:34:17,070 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:34:17,072 INFO  L471      AbstractCegarLoop]: Abstraction has 6633 states and 9971 transitions.
[2025-02-07 23:34:17,072 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 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-02-07 23:34:17,072 INFO  L276                IsEmpty]: Start isEmpty. Operand 6633 states and 9971 transitions.
[2025-02-07 23:34:17,076 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 276
[2025-02-07 23:34:17,076 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:34:17,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 23:34:17,077 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-07 23:34:17,077 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:34:17,078 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:34:17,078 INFO  L85        PathProgramCache]: Analyzing trace with hash 967211225, now seen corresponding path program 1 times
[2025-02-07 23:34:17,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:34:17,078 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451390364]
[2025-02-07 23:34:17,079 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:34:17,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:34:17,179 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes.
[2025-02-07 23:34:17,240 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements.
[2025-02-07 23:34:17,241 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:34:17,241 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:34:17,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:34:17,731 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:34:17,731 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451390364]
[2025-02-07 23:34:17,731 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451390364] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:34:17,731 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:34:17,731 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:34:17,731 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271322026]
[2025-02-07 23:34:17,731 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:34:17,733 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:34:17,733 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:34:17,733 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:34:17,733 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:34:17,735 INFO  L87              Difference]: Start difference. First operand 6633 states and 9971 transitions. Second operand  has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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-02-07 23:34:20,855 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:34:20,856 INFO  L93              Difference]: Finished difference Result 13063 states and 19638 transitions.
[2025-02-07 23:34:20,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:34:20,856 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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 275
[2025-02-07 23:34:20,857 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:34:20,883 INFO  L225             Difference]: With dead ends: 13063
[2025-02-07 23:34:20,884 INFO  L226             Difference]: Without dead ends: 6635
[2025-02-07 23:34:20,894 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-02-07 23:34:20,896 INFO  L435           NwaCegarLoop]: 8318 mSDtfsCounter, 0 mSDsluCounter, 16628 mSDsCounter, 0 mSdLazyCounter, 4960 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24946 SdHoareTripleChecker+Invalid, 4960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time
[2025-02-07 23:34:20,896 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24946 Invalid, 4960 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 4960 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time]
[2025-02-07 23:34:20,909 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6635 states.
[2025-02-07 23:34:21,011 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6635 to 6635.
[2025-02-07 23:34:21,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6635 states, 6634 states have (on average 1.5033162496231534) internal successors, (9973), 6634 states have internal predecessors, (9973), 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-02-07 23:34:21,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 9973 transitions.
[2025-02-07 23:34:21,048 INFO  L78                 Accepts]: Start accepts. Automaton has 6635 states and 9973 transitions. Word has length 275
[2025-02-07 23:34:21,049 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:34:21,049 INFO  L471      AbstractCegarLoop]: Abstraction has 6635 states and 9973 transitions.
[2025-02-07 23:34:21,049 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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-02-07 23:34:21,049 INFO  L276                IsEmpty]: Start isEmpty. Operand 6635 states and 9973 transitions.
[2025-02-07 23:34:21,053 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 277
[2025-02-07 23:34:21,053 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:34:21,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 23:34:21,054 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-07 23:34:21,054 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:34:21,057 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:34:21,058 INFO  L85        PathProgramCache]: Analyzing trace with hash 1850296788, now seen corresponding path program 1 times
[2025-02-07 23:34:21,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:34:21,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994649339]
[2025-02-07 23:34:21,058 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:34:21,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:34:21,143 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes.
[2025-02-07 23:34:21,178 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements.
[2025-02-07 23:34:21,178 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:34:21,179 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:34:21,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:34:21,558 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:34:21,559 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994649339]
[2025-02-07 23:34:21,559 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994649339] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:34:21,559 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:34:21,559 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:34:21,559 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055468834]
[2025-02-07 23:34:21,559 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:34:21,560 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:34:21,560 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:34:21,560 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:34:21,561 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:34:21,561 INFO  L87              Difference]: Start difference. First operand 6635 states and 9973 transitions. Second operand  has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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-02-07 23:34:24,203 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:34:24,203 INFO  L93              Difference]: Finished difference Result 13067 states and 19642 transitions.
[2025-02-07 23:34:24,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:34:24,204 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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 276
[2025-02-07 23:34:24,205 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:34:24,223 INFO  L225             Difference]: With dead ends: 13067
[2025-02-07 23:34:24,223 INFO  L226             Difference]: Without dead ends: 6637
[2025-02-07 23:34:24,232 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-02-07 23:34:24,233 INFO  L435           NwaCegarLoop]: 8318 mSDtfsCounter, 0 mSDsluCounter, 16623 mSDsCounter, 0 mSdLazyCounter, 4965 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24941 SdHoareTripleChecker+Invalid, 4965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-07 23:34:24,233 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24941 Invalid, 4965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4965 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-07 23:34:24,244 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6637 states.
[2025-02-07 23:34:24,329 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 6637.
[2025-02-07 23:34:24,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6637 states, 6636 states have (on average 1.5031645569620253) internal successors, (9975), 6636 states have internal predecessors, (9975), 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-02-07 23:34:24,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6637 states to 6637 states and 9975 transitions.
[2025-02-07 23:34:24,358 INFO  L78                 Accepts]: Start accepts. Automaton has 6637 states and 9975 transitions. Word has length 276
[2025-02-07 23:34:24,358 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:34:24,358 INFO  L471      AbstractCegarLoop]: Abstraction has 6637 states and 9975 transitions.
[2025-02-07 23:34:24,359 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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-02-07 23:34:24,359 INFO  L276                IsEmpty]: Start isEmpty. Operand 6637 states and 9975 transitions.
[2025-02-07 23:34:24,362 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 278
[2025-02-07 23:34:24,362 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:34:24,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 23:34:24,363 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-07 23:34:24,363 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:34:24,364 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:34:24,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -881968546, now seen corresponding path program 1 times
[2025-02-07 23:34:24,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:34:24,365 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027977467]
[2025-02-07 23:34:24,365 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:34:24,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:34:24,435 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes.
[2025-02-07 23:34:24,469 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements.
[2025-02-07 23:34:24,469 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:34:24,470 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:34:24,931 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:34:24,931 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:34:24,931 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027977467]
[2025-02-07 23:34:24,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027977467] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:34:24,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:34:24,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-07 23:34:24,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283882402]
[2025-02-07 23:34:24,932 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:34:24,932 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-07 23:34:24,932 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:34:24,932 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-07 23:34:24,933 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-07 23:34:24,933 INFO  L87              Difference]: Start difference. First operand 6637 states and 9975 transitions. Second operand  has 6 states, 6 states have (on average 46.166666666666664) internal successors, (277), 6 states have internal predecessors, (277), 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-02-07 23:34:28,101 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:34:28,101 INFO  L93              Difference]: Finished difference Result 13077 states and 19654 transitions.
[2025-02-07 23:34:28,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 23:34:28,102 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 46.166666666666664) internal successors, (277), 6 states have internal predecessors, (277), 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 277
[2025-02-07 23:34:28,102 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:34:28,120 INFO  L225             Difference]: With dead ends: 13077
[2025-02-07 23:34:28,120 INFO  L226             Difference]: Without dead ends: 6645
[2025-02-07 23:34:28,127 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-07 23:34:28,128 INFO  L435           NwaCegarLoop]: 8317 mSDtfsCounter, 3 mSDsluCounter, 24941 mSDsCounter, 0 mSdLazyCounter, 6618 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33258 SdHoareTripleChecker+Invalid, 6619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2025-02-07 23:34:28,128 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33258 Invalid, 6619 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 6618 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time]
[2025-02-07 23:34:28,138 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6645 states.
[2025-02-07 23:34:28,232 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6645 to 6641.
[2025-02-07 23:34:28,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6641 states, 6640 states have (on average 1.5031626506024096) internal successors, (9981), 6640 states have internal predecessors, (9981), 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-02-07 23:34:28,251 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6641 states to 6641 states and 9981 transitions.
[2025-02-07 23:34:28,251 INFO  L78                 Accepts]: Start accepts. Automaton has 6641 states and 9981 transitions. Word has length 277
[2025-02-07 23:34:28,253 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:34:28,254 INFO  L471      AbstractCegarLoop]: Abstraction has 6641 states and 9981 transitions.
[2025-02-07 23:34:28,255 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 46.166666666666664) internal successors, (277), 6 states have internal predecessors, (277), 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-02-07 23:34:28,255 INFO  L276                IsEmpty]: Start isEmpty. Operand 6641 states and 9981 transitions.
[2025-02-07 23:34:28,258 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 279
[2025-02-07 23:34:28,258 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:34:28,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 23:34:28,259 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-07 23:34:28,259 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:34:28,259 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:34:28,259 INFO  L85        PathProgramCache]: Analyzing trace with hash -871413041, now seen corresponding path program 1 times
[2025-02-07 23:34:28,259 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:34:28,260 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697924896]
[2025-02-07 23:34:28,260 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:34:28,260 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:34:28,332 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes.
[2025-02-07 23:34:28,369 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements.
[2025-02-07 23:34:28,369 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:34:28,369 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:34:28,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:34:28,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:34:28,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697924896]
[2025-02-07 23:34:28,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697924896] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:34:28,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:34:28,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:34:28,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385184338]
[2025-02-07 23:34:28,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:34:28,830 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 23:34:28,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:34:28,830 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 23:34:28,830 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:34:28,831 INFO  L87              Difference]: Start difference. First operand 6641 states and 9981 transitions. Second operand  has 5 states, 5 states have (on average 55.6) internal successors, (278), 4 states have internal predecessors, (278), 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-02-07 23:34:32,631 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:34:32,632 INFO  L93              Difference]: Finished difference Result 18715 states and 28134 transitions.
[2025-02-07 23:34:32,632 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 23:34:32,632 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 55.6) internal successors, (278), 4 states have internal predecessors, (278), 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 278
[2025-02-07 23:34:32,633 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:34:32,657 INFO  L225             Difference]: With dead ends: 18715
[2025-02-07 23:34:32,657 INFO  L226             Difference]: Without dead ends: 12279
[2025-02-07 23:34:32,668 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-07 23:34:32,669 INFO  L435           NwaCegarLoop]: 8314 mSDtfsCounter, 8521 mSDsluCounter, 24681 mSDsCounter, 0 mSdLazyCounter, 6574 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8521 SdHoareTripleChecker+Valid, 32995 SdHoareTripleChecker+Invalid, 6574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time
[2025-02-07 23:34:32,669 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [8521 Valid, 32995 Invalid, 6574 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 6574 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time]
[2025-02-07 23:34:32,687 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12279 states.
[2025-02-07 23:34:32,802 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12279 to 6963.
[2025-02-07 23:34:32,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6963 states, 6962 states have (on average 1.5028727377190463) internal successors, (10463), 6962 states have internal predecessors, (10463), 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-02-07 23:34:32,822 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6963 states to 6963 states and 10463 transitions.
[2025-02-07 23:34:32,823 INFO  L78                 Accepts]: Start accepts. Automaton has 6963 states and 10463 transitions. Word has length 278
[2025-02-07 23:34:32,823 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:34:32,823 INFO  L471      AbstractCegarLoop]: Abstraction has 6963 states and 10463 transitions.
[2025-02-07 23:34:32,823 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 55.6) internal successors, (278), 4 states have internal predecessors, (278), 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-02-07 23:34:32,824 INFO  L276                IsEmpty]: Start isEmpty. Operand 6963 states and 10463 transitions.
[2025-02-07 23:34:32,930 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 3394
[2025-02-07 23:34:32,930 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:34:32,932 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 23:34:32,932 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-07 23:34:32,932 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:34:32,934 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:34:32,935 INFO  L85        PathProgramCache]: Analyzing trace with hash 1251662123, now seen corresponding path program 1 times
[2025-02-07 23:34:32,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:34:32,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084374935]
[2025-02-07 23:34:32,936 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:34:32,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:34:33,331 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3393 statements into 1 equivalence classes.