./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_TicTacToe.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.h_TicTacToe.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 7fa4445f7f6df017b0199ffaf6559603c8ce76efb577222a761af46b10a934f5
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-551b009-m
[2025-01-09 07:22:24,678 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-01-09 07:22:24,731 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:22:24,738 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-01-09 07:22:24,739 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-01-09 07:22:24,759 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-01-09 07:22:24,760 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-01-09 07:22:24,760 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-01-09 07:22:24,760 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-01-09 07:22:24,760 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-01-09 07:22:24,760 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-01-09 07:22:24,760 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-01-09 07:22:24,761 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-01-09 07:22:24,761 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-01-09 07:22:24,762 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-01-09 07:22:24,762 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-01-09 07:22:24,762 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-01-09 07:22:24,762 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-01-09 07:22:24,762 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-01-09 07:22:24,762 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-01-09 07:22:24,762 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-01-09 07:22:24,762 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-01-09 07:22:24,762 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-01-09 07:22:24,762 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-01-09 07:22:24,763 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 07:22:24,763 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 07:22:24,763 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-01-09 07:22:24,763 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-01-09 07:22:24,763 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 -> 7fa4445f7f6df017b0199ffaf6559603c8ce76efb577222a761af46b10a934f5
[2025-01-09 07:22:24,981 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-01-09 07:22:24,986 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-01-09 07:22:24,987 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-01-09 07:22:24,988 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-01-09 07:22:24,988 INFO  L274        PluginConnector]: CDTParser initialized
[2025-01-09 07:22:24,988 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.h_TicTacToe.c
[2025-01-09 07:22:26,212 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a8298515/aaab5af799de4371b7ab88dde6875840/FLAG3fea6a816
[2025-01-09 07:22:26,700 INFO  L384              CDTParser]: Found 1 translation units.
[2025-01-09 07:22:26,701 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_TicTacToe.c
[2025-01-09 07:22:26,731 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a8298515/aaab5af799de4371b7ab88dde6875840/FLAG3fea6a816
[2025-01-09 07:22:26,798 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a8298515/aaab5af799de4371b7ab88dde6875840
[2025-01-09 07:22:26,800 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-01-09 07:22:26,802 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-01-09 07:22:26,804 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-01-09 07:22:26,804 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-01-09 07:22:26,807 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-01-09 07:22:26,808 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:22:26" (1/1) ...
[2025-01-09 07:22:26,809 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf7dd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:26, skipping insertion in model container
[2025-01-09 07:22:26,810 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:22:26" (1/1) ...
[2025-01-09 07:22:26,889 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-01-09 07:22:27,054 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.h_TicTacToe.c[1251,1264]
[2025-01-09 07:22:27,496 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 07:22:27,504 INFO  L200         MainTranslator]: Completed pre-run
[2025-01-09 07:22:27,512 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.h_TicTacToe.c[1251,1264]
[2025-01-09 07:22:27,759 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-01-09 07:22:27,770 INFO  L204         MainTranslator]: Completed translation
[2025-01-09 07:22:27,772 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27 WrapperNode
[2025-01-09 07:22:27,772 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-01-09 07:22:27,773 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-01-09 07:22:27,773 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-01-09 07:22:27,773 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-01-09 07:22:27,777 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:22:27" (1/1) ...
[2025-01-09 07:22:27,849 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:22:27" (1/1) ...
[2025-01-09 07:22:28,384 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 8741
[2025-01-09 07:22:28,385 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-01-09 07:22:28,386 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-01-09 07:22:28,387 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-01-09 07:22:28,387 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-01-09 07:22:28,394 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27" (1/1) ...
[2025-01-09 07:22:28,395 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27" (1/1) ...
[2025-01-09 07:22:28,489 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27" (1/1) ...
[2025-01-09 07:22:28,858 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:22:28,858 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27" (1/1) ...
[2025-01-09 07:22:28,858 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27" (1/1) ...
[2025-01-09 07:22:29,020 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27" (1/1) ...
[2025-01-09 07:22:29,041 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27" (1/1) ...
[2025-01-09 07:22:29,054 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27" (1/1) ...
[2025-01-09 07:22:29,088 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27" (1/1) ...
[2025-01-09 07:22:29,117 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27" (1/1) ...
[2025-01-09 07:22:29,183 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-01-09 07:22:29,185 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-01-09 07:22:29,185 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-01-09 07:22:29,186 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-01-09 07:22:29,186 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27" (1/1) ...
[2025-01-09 07:22:29,190 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-01-09 07:22:29,200 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-01-09 07:22:29,214 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:22:29,220 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:22:29,235 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-01-09 07:22:29,235 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-01-09 07:22:29,236 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-01-09 07:22:29,236 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-01-09 07:22:29,995 INFO  L234             CfgBuilder]: Building ICFG
[2025-01-09 07:22:29,996 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-01-09 07:22:34,202 INFO  L?                        ?]: Removed 6091 outVars from TransFormulas that were not future-live.
[2025-01-09 07:22:34,203 INFO  L283             CfgBuilder]: Performing block encoding
[2025-01-09 07:22:34,238 INFO  L307             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-01-09 07:22:34,238 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-01-09 07:22:34,239 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:22:34 BoogieIcfgContainer
[2025-01-09 07:22:34,239 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-01-09 07:22:34,241 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-01-09 07:22:34,241 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-01-09 07:22:34,245 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-01-09 07:22:34,245 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:22:26" (1/3) ...
[2025-01-09 07:22:34,246 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f0ea2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:22:34, skipping insertion in model container
[2025-01-09 07:22:34,246 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:22:27" (2/3) ...
[2025-01-09 07:22:34,246 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f0ea2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:22:34, skipping insertion in model container
[2025-01-09 07:22:34,246 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:22:34" (3/3) ...
[2025-01-09 07:22:34,247 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_TicTacToe.c
[2025-01-09 07:22:34,259 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-01-09 07:22:34,261 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_TicTacToe.c that has 1 procedures, 962 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-01-09 07:22:34,331 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-01-09 07:22:34,340 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;@51d7f928, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-01-09 07:22:34,341 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-01-09 07:22:34,350 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 962 states, 960 states have (on average 1.4989583333333334) internal successors, (1439), 961 states have internal predecessors, (1439), 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 07:22:34,367 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 280
[2025-01-09 07:22:34,368 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 07:22:34,369 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, 1]
[2025-01-09 07:22:34,369 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 07:22:34,374 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 07:22:34,375 INFO  L85        PathProgramCache]: Analyzing trace with hash 638116370, now seen corresponding path program 1 times
[2025-01-09 07:22:34,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 07:22:34,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776408024]
[2025-01-09 07:22:34,380 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 07:22:34,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 07:22:34,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes.
[2025-01-09 07:22:35,826 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements.
[2025-01-09 07:22:35,826 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 07:22:35,827 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 07:22:39,450 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 07:22:39,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 07:22:39,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776408024]
[2025-01-09 07:22:39,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776408024] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 07:22:39,453 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 07:22:39,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 07:22:39,454 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458453787]
[2025-01-09 07:22:39,454 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 07:22:39,458 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 07:22:39,459 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 07:22:39,474 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 07:22:39,474 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 07:22:39,478 INFO  L87              Difference]: Start difference. First operand  has 962 states, 960 states have (on average 1.4989583333333334) internal successors, (1439), 961 states have internal predecessors, (1439), 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 69.75) internal successors, (279), 4 states have internal predecessors, (279), 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 07:22:39,605 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 07:22:39,605 INFO  L93              Difference]: Finished difference Result 1877 states and 2811 transitions.
[2025-01-09 07:22:39,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 07:22:39,610 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 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 279
[2025-01-09 07:22:39,611 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 07:22:39,628 INFO  L225             Difference]: With dead ends: 1877
[2025-01-09 07:22:39,628 INFO  L226             Difference]: Without dead ends: 961
[2025-01-09 07:22:39,637 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 07:22:39,640 INFO  L435           NwaCegarLoop]: 1433 mSDtfsCounter, 0 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4293 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 07:22:39,640 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4293 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 07:22:39,656 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 961 states.
[2025-01-09 07:22:39,708 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961.
[2025-01-09 07:22:39,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 961 states, 960 states have (on average 1.496875) internal successors, (1437), 960 states have internal predecessors, (1437), 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 07:22:39,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1437 transitions.
[2025-01-09 07:22:39,721 INFO  L78                 Accepts]: Start accepts. Automaton has 961 states and 1437 transitions. Word has length 279
[2025-01-09 07:22:39,723 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 07:22:39,723 INFO  L471      AbstractCegarLoop]: Abstraction has 961 states and 1437 transitions.
[2025-01-09 07:22:39,723 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 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 07:22:39,725 INFO  L276                IsEmpty]: Start isEmpty. Operand 961 states and 1437 transitions.
[2025-01-09 07:22:39,729 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 281
[2025-01-09 07:22:39,730 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 07:22:39,730 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, 1, 1]
[2025-01-09 07:22:39,731 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-01-09 07:22:39,731 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 07:22:39,732 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 07:22:39,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -1691532076, now seen corresponding path program 1 times
[2025-01-09 07:22:39,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 07:22:39,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383133934]
[2025-01-09 07:22:39,732 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 07:22:39,732 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 07:22:40,165 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes.
[2025-01-09 07:22:40,635 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements.
[2025-01-09 07:22:40,635 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 07:22:40,635 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 07:22:42,540 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 07:22:42,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 07:22:42,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383133934]
[2025-01-09 07:22:42,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383133934] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 07:22:42,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 07:22:42,541 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 07:22:42,541 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874151074]
[2025-01-09 07:22:42,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 07:22:42,546 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 07:22:42,546 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 07:22:42,547 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 07:22:42,547 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 07:22:42,547 INFO  L87              Difference]: Start difference. First operand 961 states and 1437 transitions. Second operand  has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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 07:22:42,666 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 07:22:42,667 INFO  L93              Difference]: Finished difference Result 1878 states and 2809 transitions.
[2025-01-09 07:22:42,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 07:22:42,667 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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 280
[2025-01-09 07:22:42,668 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 07:22:42,675 INFO  L225             Difference]: With dead ends: 1878
[2025-01-09 07:22:42,676 INFO  L226             Difference]: Without dead ends: 963
[2025-01-09 07:22:42,677 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 07:22:42,677 INFO  L435           NwaCegarLoop]: 1433 mSDtfsCounter, 0 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 07:22:42,678 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4289 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 07:22:42,683 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 963 states.
[2025-01-09 07:22:42,723 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963.
[2025-01-09 07:22:42,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 963 states, 962 states have (on average 1.495841995841996) internal successors, (1439), 962 states have internal predecessors, (1439), 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 07:22:42,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1439 transitions.
[2025-01-09 07:22:42,732 INFO  L78                 Accepts]: Start accepts. Automaton has 963 states and 1439 transitions. Word has length 280
[2025-01-09 07:22:42,732 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 07:22:42,735 INFO  L471      AbstractCegarLoop]: Abstraction has 963 states and 1439 transitions.
[2025-01-09 07:22:42,736 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 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 07:22:42,736 INFO  L276                IsEmpty]: Start isEmpty. Operand 963 states and 1439 transitions.
[2025-01-09 07:22:42,743 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 282
[2025-01-09 07:22:42,743 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 07:22:42,744 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, 1, 1, 1]
[2025-01-09 07:22:42,744 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-01-09 07:22:42,744 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 07:22:42,747 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 07:22:42,748 INFO  L85        PathProgramCache]: Analyzing trace with hash -1995850965, now seen corresponding path program 1 times
[2025-01-09 07:22:42,748 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 07:22:42,748 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634388258]
[2025-01-09 07:22:42,748 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 07:22:42,748 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 07:22:43,172 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes.
[2025-01-09 07:22:54,730 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements.
[2025-01-09 07:22:54,730 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 07:22:54,730 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 07:22:57,636 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 07:22:57,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 07:22:57,637 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634388258]
[2025-01-09 07:22:57,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634388258] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 07:22:57,637 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 07:22:57,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 07:22:57,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425395961]
[2025-01-09 07:22:57,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 07:22:57,638 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 07:22:57,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 07:22:57,639 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 07:22:57,640 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 07:22:57,640 INFO  L87              Difference]: Start difference. First operand 963 states and 1439 transitions. Second operand  has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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 07:22:57,714 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 07:22:57,714 INFO  L93              Difference]: Finished difference Result 1884 states and 2816 transitions.
[2025-01-09 07:22:57,715 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 07:22:57,715 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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 281
[2025-01-09 07:22:57,716 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 07:22:57,723 INFO  L225             Difference]: With dead ends: 1884
[2025-01-09 07:22:57,724 INFO  L226             Difference]: Without dead ends: 967
[2025-01-09 07:22:57,726 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 07:22:57,727 INFO  L435           NwaCegarLoop]: 1430 mSDtfsCounter, 2 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 07:22:57,728 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4283 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 07:22:57,730 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 967 states.
[2025-01-09 07:22:57,750 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 965.
[2025-01-09 07:22:57,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 965 states, 964 states have (on average 1.4948132780082988) internal successors, (1441), 964 states have internal predecessors, (1441), 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 07:22:57,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1441 transitions.
[2025-01-09 07:22:57,757 INFO  L78                 Accepts]: Start accepts. Automaton has 965 states and 1441 transitions. Word has length 281
[2025-01-09 07:22:57,757 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 07:22:57,757 INFO  L471      AbstractCegarLoop]: Abstraction has 965 states and 1441 transitions.
[2025-01-09 07:22:57,758 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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 07:22:57,758 INFO  L276                IsEmpty]: Start isEmpty. Operand 965 states and 1441 transitions.
[2025-01-09 07:22:57,760 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 283
[2025-01-09 07:22:57,760 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 07:22:57,760 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, 1, 1, 1, 1]
[2025-01-09 07:22:57,760 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-01-09 07:22:57,760 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 07:22:57,761 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 07:22:57,762 INFO  L85        PathProgramCache]: Analyzing trace with hash -547237306, now seen corresponding path program 1 times
[2025-01-09 07:22:57,762 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 07:22:57,762 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023303830]
[2025-01-09 07:22:57,762 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 07:22:57,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 07:22:58,081 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes.
[2025-01-09 07:23:09,232 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements.
[2025-01-09 07:23:09,232 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 07:23:09,232 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 07:23:11,968 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 07:23:11,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 07:23:11,968 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023303830]
[2025-01-09 07:23:11,968 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023303830] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 07:23:11,968 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 07:23:11,968 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 07:23:11,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635192339]
[2025-01-09 07:23:11,969 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 07:23:11,969 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 07:23:11,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 07:23:11,969 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 07:23:11,970 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 07:23:11,970 INFO  L87              Difference]: Start difference. First operand 965 states and 1441 transitions. Second operand  has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 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 07:23:12,021 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 07:23:12,021 INFO  L93              Difference]: Finished difference Result 1888 states and 2820 transitions.
[2025-01-09 07:23:12,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 07:23:12,022 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 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 282
[2025-01-09 07:23:12,022 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 07:23:12,025 INFO  L225             Difference]: With dead ends: 1888
[2025-01-09 07:23:12,025 INFO  L226             Difference]: Without dead ends: 969
[2025-01-09 07:23:12,026 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 07:23:12,026 INFO  L435           NwaCegarLoop]: 1430 mSDtfsCounter, 2 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 07:23:12,026 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4283 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 07:23:12,028 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 969 states.
[2025-01-09 07:23:12,037 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 967.
[2025-01-09 07:23:12,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 967 states, 966 states have (on average 1.4937888198757765) internal successors, (1443), 966 states have internal predecessors, (1443), 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 07:23:12,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1443 transitions.
[2025-01-09 07:23:12,040 INFO  L78                 Accepts]: Start accepts. Automaton has 967 states and 1443 transitions. Word has length 282
[2025-01-09 07:23:12,040 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 07:23:12,040 INFO  L471      AbstractCegarLoop]: Abstraction has 967 states and 1443 transitions.
[2025-01-09 07:23:12,041 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 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 07:23:12,041 INFO  L276                IsEmpty]: Start isEmpty. Operand 967 states and 1443 transitions.
[2025-01-09 07:23:12,043 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 284
[2025-01-09 07:23:12,043 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 07:23:12,043 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, 1, 1, 1, 1, 1]
[2025-01-09 07:23:12,043 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-01-09 07:23:12,043 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 07:23:12,043 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 07:23:12,044 INFO  L85        PathProgramCache]: Analyzing trace with hash -19227334, now seen corresponding path program 1 times
[2025-01-09 07:23:12,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 07:23:12,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324257691]
[2025-01-09 07:23:12,044 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 07:23:12,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 07:23:12,317 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes.
[2025-01-09 07:23:25,304 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements.
[2025-01-09 07:23:25,305 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 07:23:25,305 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 07:23:27,943 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 07:23:27,944 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 07:23:27,944 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324257691]
[2025-01-09 07:23:27,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324257691] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 07:23:27,944 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 07:23:27,944 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 07:23:27,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676587233]
[2025-01-09 07:23:27,944 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 07:23:27,944 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 07:23:27,945 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 07:23:27,945 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 07:23:27,945 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 07:23:27,945 INFO  L87              Difference]: Start difference. First operand 967 states and 1443 transitions. Second operand  has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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 07:23:27,996 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 07:23:27,997 INFO  L93              Difference]: Finished difference Result 1892 states and 2824 transitions.
[2025-01-09 07:23:27,997 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 07:23:27,997 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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 283
[2025-01-09 07:23:27,998 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 07:23:28,000 INFO  L225             Difference]: With dead ends: 1892
[2025-01-09 07:23:28,001 INFO  L226             Difference]: Without dead ends: 971
[2025-01-09 07:23:28,002 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 07:23:28,002 INFO  L435           NwaCegarLoop]: 1430 mSDtfsCounter, 2 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-01-09 07:23:28,002 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4283 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-01-09 07:23:28,004 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 971 states.
[2025-01-09 07:23:28,014 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969.
[2025-01-09 07:23:28,015 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 969 states, 968 states have (on average 1.4927685950413223) internal successors, (1445), 968 states have internal predecessors, (1445), 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 07:23:28,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1445 transitions.
[2025-01-09 07:23:28,017 INFO  L78                 Accepts]: Start accepts. Automaton has 969 states and 1445 transitions. Word has length 283
[2025-01-09 07:23:28,018 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 07:23:28,018 INFO  L471      AbstractCegarLoop]: Abstraction has 969 states and 1445 transitions.
[2025-01-09 07:23:28,018 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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 07:23:28,018 INFO  L276                IsEmpty]: Start isEmpty. Operand 969 states and 1445 transitions.
[2025-01-09 07:23:28,020 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 285
[2025-01-09 07:23:28,020 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 07:23:28,020 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, 1, 1, 1, 1, 1, 1]
[2025-01-09 07:23:28,020 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-01-09 07:23:28,020 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 07:23:28,021 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 07:23:28,021 INFO  L85        PathProgramCache]: Analyzing trace with hash 165938677, now seen corresponding path program 1 times
[2025-01-09 07:23:28,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 07:23:28,021 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668444299]
[2025-01-09 07:23:28,021 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 07:23:28,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 07:23:28,303 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes.
[2025-01-09 07:23:37,639 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements.
[2025-01-09 07:23:37,640 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-01-09 07:23:37,640 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-01-09 07:23:40,484 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 07:23:40,488 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-01-09 07:23:40,488 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668444299]
[2025-01-09 07:23:40,488 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668444299] provided 1 perfect and 0 imperfect interpolant sequences
[2025-01-09 07:23:40,488 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-01-09 07:23:40,488 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-01-09 07:23:40,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149421210]
[2025-01-09 07:23:40,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-01-09 07:23:40,489 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-01-09 07:23:40,489 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-01-09 07:23:40,489 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-01-09 07:23:40,489 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-01-09 07:23:40,489 INFO  L87              Difference]: Start difference. First operand 969 states and 1445 transitions. Second operand  has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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 07:23:40,585 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-01-09 07:23:40,585 INFO  L93              Difference]: Finished difference Result 1896 states and 2828 transitions.
[2025-01-09 07:23:40,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-01-09 07:23:40,586 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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 284
[2025-01-09 07:23:40,586 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-01-09 07:23:40,589 INFO  L225             Difference]: With dead ends: 1896
[2025-01-09 07:23:40,589 INFO  L226             Difference]: Without dead ends: 973
[2025-01-09 07:23:40,594 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 07:23:40,599 INFO  L435           NwaCegarLoop]: 1430 mSDtfsCounter, 2 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-01-09 07:23:40,599 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4283 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-01-09 07:23:40,600 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 973 states.
[2025-01-09 07:23:40,619 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 971.
[2025-01-09 07:23:40,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 971 states, 970 states have (on average 1.4917525773195877) internal successors, (1447), 970 states have internal predecessors, (1447), 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 07:23:40,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1447 transitions.
[2025-01-09 07:23:40,634 INFO  L78                 Accepts]: Start accepts. Automaton has 971 states and 1447 transitions. Word has length 284
[2025-01-09 07:23:40,634 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-01-09 07:23:40,635 INFO  L471      AbstractCegarLoop]: Abstraction has 971 states and 1447 transitions.
[2025-01-09 07:23:40,635 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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 07:23:40,635 INFO  L276                IsEmpty]: Start isEmpty. Operand 971 states and 1447 transitions.
[2025-01-09 07:23:40,637 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 286
[2025-01-09 07:23:40,638 INFO  L210           NwaCegarLoop]: Found error trace
[2025-01-09 07:23:40,638 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, 1, 1, 1, 1, 1, 1, 1]
[2025-01-09 07:23:40,638 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-01-09 07:23:40,642 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-01-09 07:23:40,642 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-01-09 07:23:40,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 664354761, now seen corresponding path program 1 times
[2025-01-09 07:23:40,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-01-09 07:23:40,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966802905]
[2025-01-09 07:23:40,642 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-01-09 07:23:40,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-01-09 07:23:40,980 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes.