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


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


Checking for ERROR reachability
Using default analysis
Version 551b0097
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.reader_writer.3.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 dc21aecf5e7aa9d96660cf5846e9cc7bd2e23609bc3b71a2bdc1157bb83d2fe1
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-551b009-m
[2025-01-09 07:59:05,046 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-01-09 07:59:05,118 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-01-09 07:59:05,125 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-01-09 07:59:05,125 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-01-09 07:59:05,154 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-01-09 07:59:05,155 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-01-09 07:59:05,155 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-01-09 07:59:05,156 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-01-09 07:59:05,156 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-01-09 07:59:05,157 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-01-09 07:59:05,157 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-01-09 07:59:05,157 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-01-09 07:59:05,157 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-01-09 07:59:05,158 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-01-09 07:59:05,158 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-01-09 07:59:05,158 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-01-09 07:59:05,158 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-01-09 07:59:05,158 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-01-09 07:59:05,159 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-01-09 07:59:05,159 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-01-09 07:59:05,159 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-01-09 07:59:05,159 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-01-09 07:59:05,159 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-01-09 07:59:05,159 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-01-09 07:59:05,159 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-01-09 07:59:05,159 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-09 07:59:05,160 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-01-09 07:59:05,160 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-09 07:59:05,160 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 07:59:05,160 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-01-09 07:59:05,161 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-09 07:59:05,161 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-01-09 07:59:05,161 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-09 07:59:05,161 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 07:59:05,161 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-01-09 07:59:05,161 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-01-09 07:59:05,161 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-01-09 07:59:05,161 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-01-09 07:59:05,162 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-01-09 07:59:05,162 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-01-09 07:59:05,162 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-01-09 07:59:05,162 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-01-09 07:59:05,162 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-01-09 07:59:05,162 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-01-09 07:59:05,162 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 -> dc21aecf5e7aa9d96660cf5846e9cc7bd2e23609bc3b71a2bdc1157bb83d2fe1
[2025-01-09 07:59:05,424 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-01-09 07:59:05,433 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-01-09 07:59:05,435 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-01-09 07:59:05,436 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-01-09 07:59:05,437 INFO  L274        PluginConnector]: CDTParser initialized
[2025-01-09 07:59:05,439 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.reader_writer.3.prop1-func-interl.c
[2025-01-09 07:59:06,829 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6de47060/9914daacb0af45f98a17e4254c4a12bb/FLAGe0c0e8eee
[2025-01-09 07:59:07,325 INFO  L384              CDTParser]: Found 1 translation units.
[2025-01-09 07:59:07,326 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.reader_writer.3.prop1-func-interl.c
[2025-01-09 07:59:07,366 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6de47060/9914daacb0af45f98a17e4254c4a12bb/FLAGe0c0e8eee
[2025-01-09 07:59:07,384 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6de47060/9914daacb0af45f98a17e4254c4a12bb
[2025-01-09 07:59:07,387 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-01-09 07:59:07,389 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-01-09 07:59:07,391 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-01-09 07:59:07,391 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-01-09 07:59:07,396 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-01-09 07:59:07,397 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:59:07" (1/1) ...
[2025-01-09 07:59:07,399 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3c6702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:07, skipping insertion in model container
[2025-01-09 07:59:07,399 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:59:07" (1/1) ...
[2025-01-09 07:59:07,501 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-01-09 07:59:07,730 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.reader_writer.3.prop1-func-interl.c[1180,1193]
[2025-01-09 07:59:08,517 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 07:59:08,532 INFO  L200         MainTranslator]: Completed pre-run
[2025-01-09 07:59:08,542 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.reader_writer.3.prop1-func-interl.c[1180,1193]
[2025-01-09 07:59:08,955 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 07:59:08,986 INFO  L204         MainTranslator]: Completed translation
[2025-01-09 07:59:08,987 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08 WrapperNode
[2025-01-09 07:59:08,987 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-01-09 07:59:08,988 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-01-09 07:59:08,989 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-01-09 07:59:08,989 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-01-09 07:59:08,995 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:09,223 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:11,133 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22005
[2025-01-09 07:59:11,134 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-01-09 07:59:11,136 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-01-09 07:59:11,137 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-01-09 07:59:11,137 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-01-09 07:59:11,148 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:11,148 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:12,064 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:12,564 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-01-09 07:59:12,565 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:12,565 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:13,285 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:13,346 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:13,418 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:13,573 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:13,685 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:14,222 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-01-09 07:59:14,223 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-01-09 07:59:14,223 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-01-09 07:59:14,223 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-01-09 07:59:14,225 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (1/1) ...
[2025-01-09 07:59:14,230 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 07:59:14,242 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 07:59:14,261 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-01-09 07:59:14,268 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-01-09 07:59:14,287 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-01-09 07:59:14,288 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-01-09 07:59:14,288 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-01-09 07:59:14,288 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-01-09 07:59:15,388 INFO  L234             CfgBuilder]: Building ICFG
[2025-01-09 07:59:15,390 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-01-09 08:00:01,034 INFO  L?                        ?]: Removed 11973 outVars from TransFormulas that were not future-live.
[2025-01-09 08:00:01,035 INFO  L283             CfgBuilder]: Performing block encoding
[2025-01-09 08:00:01,236 INFO  L307             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-01-09 08:00:01,240 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-01-09 08:00:01,240 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:00:01 BoogieIcfgContainer
[2025-01-09 08:00:01,240 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-01-09 08:00:01,242 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-01-09 08:00:01,242 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-01-09 08:00:01,282 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-01-09 08:00:01,282 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:59:07" (1/3) ...
[2025-01-09 08:00:01,288 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75af347b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:00:01, skipping insertion in model container
[2025-01-09 08:00:01,288 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:59:08" (2/3) ...
[2025-01-09 08:00:01,288 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75af347b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:00:01, skipping insertion in model container
[2025-01-09 08:00:01,288 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:00:01" (3/3) ...
[2025-01-09 08:00:01,289 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.reader_writer.3.prop1-func-interl.c
[2025-01-09 08:00:01,382 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-01-09 08:00:01,385 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.reader_writer.3.prop1-func-interl.c that has 1 procedures, 8118 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-01-09 08:00:01,661 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-01-09 08:00:01,684 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;@1dca339e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-01-09 08:00:01,684 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-01-09 08:00:01,715 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 8118 states, 8116 states have (on average 1.4998767865943814) internal successors, (12173), 8117 states have internal predecessors, (12173), 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-01-09 08:00:01,745 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 248
[2025-01-09 08:00:01,745 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:00:01,746 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]
[2025-01-09 08:00:01,746 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:00:01,755 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:00:01,756 INFO  L85        PathProgramCache]: Analyzing trace with hash -1035694003, now seen corresponding path program 1 times
[2025-01-09 08:00:01,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:00:01,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369431675]
[2025-01-09 08:00:01,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:00:01,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:00:01,958 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes.
[2025-01-09 08:00:02,161 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements.
[2025-01-09 08:00:02,162 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:00:02,162 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:00:03,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:00:03,277 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:00:03,277 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369431675]
[2025-01-09 08:00:03,278 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369431675] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:00:03,278 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:00:03,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 08:00:03,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589769222]
[2025-01-09 08:00:03,280 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:00:03,283 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 08:00:03,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:00:03,306 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 08:00:03,307 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 08:00:03,328 INFO  L87              Difference]: Start difference. First operand  has 8118 states, 8116 states have (on average 1.4998767865943814) internal successors, (12173), 8117 states have internal predecessors, (12173), 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 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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-01-09 08:00:03,735 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:00:03,736 INFO  L93              Difference]: Finished difference Result 15985 states and 23973 transitions.
[2025-01-09 08:00:03,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 08:00:03,738 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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 247
[2025-01-09 08:00:03,739 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:00:03,797 INFO  L225             Difference]: With dead ends: 15985
[2025-01-09 08:00:03,797 INFO  L226             Difference]: Without dead ends: 8117
[2025-01-09 08:00:03,816 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-01-09 08:00:03,822 INFO  L435           NwaCegarLoop]: 12167 mSDtfsCounter, 0 mSDsluCounter, 24328 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36495 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 08:00:03,823 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36495 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 08:00:03,853 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8117 states.
[2025-01-09 08:00:04,055 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8117 to 8117.
[2025-01-09 08:00:04,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8117 states, 8116 states have (on average 1.4996303597831444) internal successors, (12171), 8116 states have internal predecessors, (12171), 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-01-09 08:00:04,112 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8117 states to 8117 states and 12171 transitions.
[2025-01-09 08:00:04,114 INFO  L78                 Accepts]: Start accepts. Automaton has 8117 states and 12171 transitions. Word has length 247
[2025-01-09 08:00:04,117 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:00:04,118 INFO  L471      AbstractCegarLoop]: Abstraction has 8117 states and 12171 transitions.
[2025-01-09 08:00:04,119 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 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-01-09 08:00:04,119 INFO  L276                IsEmpty]: Start isEmpty. Operand 8117 states and 12171 transitions.
[2025-01-09 08:00:04,126 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-01-09 08:00:04,130 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:00:04,131 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]
[2025-01-09 08:00:04,131 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-01-09 08:00:04,131 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:00:04,132 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:00:04,132 INFO  L85        PathProgramCache]: Analyzing trace with hash -2040046295, now seen corresponding path program 1 times
[2025-01-09 08:00:04,132 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:00:04,132 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196770499]
[2025-01-09 08:00:04,132 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:00:04,132 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:00:04,242 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-01-09 08:00:04,301 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-01-09 08:00:04,302 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:00:04,302 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:00:04,732 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:00:04,733 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:00:04,733 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196770499]
[2025-01-09 08:00:04,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196770499] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:00:04,734 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:00:04,734 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 08:00:04,734 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113968734]
[2025-01-09 08:00:04,734 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:00:04,735 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 08:00:04,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:00:04,737 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 08:00:04,737 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 08:00:04,738 INFO  L87              Difference]: Start difference. First operand 8117 states and 12171 transitions. Second operand  has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-01-09 08:00:05,070 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:00:05,071 INFO  L93              Difference]: Finished difference Result 15986 states and 23971 transitions.
[2025-01-09 08:00:05,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 08:00:05,072 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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 248
[2025-01-09 08:00:05,074 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:00:05,106 INFO  L225             Difference]: With dead ends: 15986
[2025-01-09 08:00:05,106 INFO  L226             Difference]: Without dead ends: 8119
[2025-01-09 08:00:05,117 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-01-09 08:00:05,119 INFO  L435           NwaCegarLoop]: 12167 mSDtfsCounter, 0 mSDsluCounter, 24324 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36491 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 08:00:05,120 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36491 Invalid, 15 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 08:00:05,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8119 states.
[2025-01-09 08:00:05,270 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8119 to 8119.
[2025-01-09 08:00:05,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8119 states, 8118 states have (on average 1.4995072677999508) internal successors, (12173), 8118 states have internal predecessors, (12173), 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-01-09 08:00:05,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8119 states to 8119 states and 12173 transitions.
[2025-01-09 08:00:05,316 INFO  L78                 Accepts]: Start accepts. Automaton has 8119 states and 12173 transitions. Word has length 248
[2025-01-09 08:00:05,318 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:00:05,318 INFO  L471      AbstractCegarLoop]: Abstraction has 8119 states and 12173 transitions.
[2025-01-09 08:00:05,318 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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-01-09 08:00:05,319 INFO  L276                IsEmpty]: Start isEmpty. Operand 8119 states and 12173 transitions.
[2025-01-09 08:00:05,322 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 250
[2025-01-09 08:00:05,323 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:00:05,323 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]
[2025-01-09 08:00:05,323 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-01-09 08:00:05,323 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:00:05,326 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:00:05,326 INFO  L85        PathProgramCache]: Analyzing trace with hash 85109926, now seen corresponding path program 1 times
[2025-01-09 08:00:05,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:00:05,326 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145596277]
[2025-01-09 08:00:05,327 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:00:05,327 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:00:05,436 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes.
[2025-01-09 08:00:05,465 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements.
[2025-01-09 08:00:05,465 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:00:05,465 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:00:05,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:00:05,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:00:05,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145596277]
[2025-01-09 08:00:05,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145596277] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:00:05,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:00:05,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 08:00:05,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333673725]
[2025-01-09 08:00:05,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:00:05,818 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 08:00:05,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:00:05,820 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 08:00:05,820 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 08:00:05,820 INFO  L87              Difference]: Start difference. First operand 8119 states and 12173 transitions. Second operand  has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 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-01-09 08:00:06,063 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:00:06,063 INFO  L93              Difference]: Finished difference Result 15990 states and 23975 transitions.
[2025-01-09 08:00:06,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 08:00:06,064 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 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 249
[2025-01-09 08:00:06,064 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:00:06,103 INFO  L225             Difference]: With dead ends: 15990
[2025-01-09 08:00:06,104 INFO  L226             Difference]: Without dead ends: 8121
[2025-01-09 08:00:06,114 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-01-09 08:00:06,115 INFO  L435           NwaCegarLoop]: 12167 mSDtfsCounter, 0 mSDsluCounter, 24318 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36485 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 08:00:06,115 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36485 Invalid, 21 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 08:00:06,129 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8121 states.
[2025-01-09 08:00:06,256 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8121 to 8121.
[2025-01-09 08:00:06,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8121 states, 8120 states have (on average 1.499384236453202) internal successors, (12175), 8120 states have internal predecessors, (12175), 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-01-09 08:00:06,293 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8121 states to 8121 states and 12175 transitions.
[2025-01-09 08:00:06,294 INFO  L78                 Accepts]: Start accepts. Automaton has 8121 states and 12175 transitions. Word has length 249
[2025-01-09 08:00:06,294 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:00:06,294 INFO  L471      AbstractCegarLoop]: Abstraction has 8121 states and 12175 transitions.
[2025-01-09 08:00:06,295 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 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-01-09 08:00:06,295 INFO  L276                IsEmpty]: Start isEmpty. Operand 8121 states and 12175 transitions.
[2025-01-09 08:00:06,297 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-01-09 08:00:06,297 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:00:06,298 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]
[2025-01-09 08:00:06,298 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-01-09 08:00:06,298 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:00:06,298 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:00:06,299 INFO  L85        PathProgramCache]: Analyzing trace with hash -747671216, now seen corresponding path program 1 times
[2025-01-09 08:00:06,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:00:06,299 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87988295]
[2025-01-09 08:00:06,299 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:00:06,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:00:06,389 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-01-09 08:00:06,418 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-01-09 08:00:06,419 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 08:00:06,419 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 08:00:06,880 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-01-09 08:00:06,880 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 08:00:06,880 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87988295]
[2025-01-09 08:00:06,880 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87988295] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 08:00:06,880 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 08:00:06,880 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-01-09 08:00:06,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103128645]
[2025-01-09 08:00:06,881 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 08:00:06,881 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-01-09 08:00:06,881 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 08:00:06,882 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-01-09 08:00:06,882 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-01-09 08:00:06,882 INFO  L87              Difference]: Start difference. First operand 8121 states and 12175 transitions. Second operand  has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-01-09 08:00:07,294 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 08:00:07,295 INFO  L93              Difference]: Finished difference Result 23225 states and 34822 transitions.
[2025-01-09 08:00:07,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-01-09 08:00:07,295 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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 250
[2025-01-09 08:00:07,296 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 08:00:07,332 INFO  L225             Difference]: With dead ends: 23225
[2025-01-09 08:00:07,332 INFO  L226             Difference]: Without dead ends: 15354
[2025-01-09 08:00:07,349 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-01-09 08:00:07,350 INFO  L435           NwaCegarLoop]: 12163 mSDtfsCounter, 10981 mSDsluCounter, 36110 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10981 SdHoareTripleChecker+Valid, 48273 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 08:00:07,350 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [10981 Valid, 48273 Invalid, 30 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 08:00:07,373 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15354 states.
[2025-01-09 08:00:07,561 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15354 to 8349.
[2025-01-09 08:00:07,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8349 states, 8348 states have (on average 1.4994010541447054) internal successors, (12517), 8348 states have internal predecessors, (12517), 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-01-09 08:00:07,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8349 states to 8349 states and 12517 transitions.
[2025-01-09 08:00:07,603 INFO  L78                 Accepts]: Start accepts. Automaton has 8349 states and 12517 transitions. Word has length 250
[2025-01-09 08:00:07,604 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 08:00:07,604 INFO  L471      AbstractCegarLoop]: Abstraction has 8349 states and 12517 transitions.
[2025-01-09 08:00:07,604 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-01-09 08:00:07,604 INFO  L276                IsEmpty]: Start isEmpty. Operand 8349 states and 12517 transitions.
[2025-01-09 08:00:07,884 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4184
[2025-01-09 08:00:07,884 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 08:00:07,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 08:00:07,887 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-01-09 08:00:07,887 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 08:00:07,889 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 08:00:07,891 INFO  L85        PathProgramCache]: Analyzing trace with hash 308149634, now seen corresponding path program 1 times
[2025-01-09 08:00:07,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 08:00:07,891 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699201741]
[2025-01-09 08:00:07,892 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 08:00:07,892 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 08:00:08,450 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4183 statements into 1 equivalence classes.