./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 6497de01
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 01:56:07,627 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-24 01:56:07,738 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-24 01:56:07,748 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 01:56:07,748 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 01:56:07,788 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 01:56:07,790 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 01:56:07,790 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 01:56:07,790 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 01:56:07,791 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-24 01:56:07,792 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 01:56:07,792 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 01:56:07,792 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 01:56:07,792 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-24 01:56:07,793 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-24 01:56:07,794 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 01:56:07,794 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-24 01:56:07,794 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-24 01:56:07,794 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-24 01:56:07,794 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-24 01:56:07,794 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-24 01:56:07,794 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-24 01:56:07,794 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 01:56:07,794 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-24 01:56:07,795 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-24 01:56:07,795 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-24 01:56:07,795 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 01:56:07,795 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-24 01:56:07,795 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 01:56:07,795 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-24 01:56:07,796 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 01:56:07,796 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-24 01:56:07,796 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:56:07,796 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 01:56:07,796 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-24 01:56:07,796 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 01:56:07,796 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-24 01:56:07,797 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:56:07,797 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 01:56:07,797 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 01:56:07,797 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2024-11-24 01:56:07,797 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-24 01:56:07,797 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-24 01:56:07,797 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-24 01:56:07,797 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 01:56:07,798 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 01:56:07,798 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 01:56:07,798 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 01:56:07,798 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0
[2024-11-24 01:56:08,196 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 01:56:08,211 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 01:56:08,214 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 01:56:08,216 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-24 01:56:08,216 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-24 01:56:08,217 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/locks/test_locks_11.c
[2024-11-24 01:56:11,404 INFO  L533              CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/data/ac87844f3/401ba13ca8014d17bae2a03475236f46/FLAG9f64d5866
[2024-11-24 01:56:11,748 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-24 01:56:11,749 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/sv-benchmarks/c/locks/test_locks_11.c
[2024-11-24 01:56:11,798 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/data/ac87844f3/401ba13ca8014d17bae2a03475236f46/FLAG9f64d5866
[2024-11-24 01:56:11,982 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/data/ac87844f3/401ba13ca8014d17bae2a03475236f46
[2024-11-24 01:56:11,985 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 01:56:11,986 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 01:56:11,987 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 01:56:11,987 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 01:56:11,991 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 01:56:11,992 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:56:11" (1/1) ...
[2024-11-24 01:56:11,993 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fdf5ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:11, skipping insertion in model container
[2024-11-24 01:56:11,993 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:56:11" (1/1) ...
[2024-11-24 01:56:12,013 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-24 01:56:12,214 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/sv-benchmarks/c/locks/test_locks_11.c[4246,4259]
[2024-11-24 01:56:12,220 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:56:12,236 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-24 01:56:12,262 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/sv-benchmarks/c/locks/test_locks_11.c[4246,4259]
[2024-11-24 01:56:12,263 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:56:12,275 INFO  L204         MainTranslator]: Completed translation
[2024-11-24 01:56:12,276 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12 WrapperNode
[2024-11-24 01:56:12,276 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 01:56:12,277 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 01:56:12,277 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 01:56:12,278 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 01:56:12,285 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,292 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,313 INFO  L138                Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 159
[2024-11-24 01:56:12,313 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 01:56:12,314 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 01:56:12,314 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 01:56:12,314 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 01:56:12,323 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,323 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,325 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,345 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].
[2024-11-24 01:56:12,345 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,345 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,349 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,350 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,360 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,361 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,362 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,367 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 01:56:12,367 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 01:56:12,368 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 01:56:12,368 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-24 01:56:12,369 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (1/1) ...
[2024-11-24 01:56:12,375 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:56:12,391 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:56:12,407 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 01:56:12,415 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 01:56:12,442 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 01:56:12,442 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 01:56:12,442 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 01:56:12,442 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-24 01:56:12,524 INFO  L234             CfgBuilder]: Building ICFG
[2024-11-24 01:56:12,526 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 01:56:12,784 INFO  L?                        ?]: Removed 26 outVars from TransFormulas that were not future-live.
[2024-11-24 01:56:12,785 INFO  L283             CfgBuilder]: Performing block encoding
[2024-11-24 01:56:12,796 INFO  L307             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 01:56:12,796 INFO  L312             CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-24 01:56:12,797 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:56:12 BoogieIcfgContainer
[2024-11-24 01:56:12,797 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 01:56:12,799 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 01:56:12,799 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 01:56:12,804 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-24 01:56:12,805 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:56:11" (1/3) ...
[2024-11-24 01:56:12,805 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4dd061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:56:12, skipping insertion in model container
[2024-11-24 01:56:12,805 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:56:12" (2/3) ...
[2024-11-24 01:56:12,806 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4dd061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:56:12, skipping insertion in model container
[2024-11-24 01:56:12,806 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:56:12" (3/3) ...
[2024-11-24 01:56:12,807 INFO  L128   eAbstractionObserver]: Analyzing ICFG test_locks_11.c
[2024-11-24 01:56:12,823 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 01:56:12,824 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_11.c that has 1 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2024-11-24 01:56:12,874 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 01:56:12,887 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;@482fe50e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 01:56:12,888 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-24 01:56:12,892 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 43 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 42 states have internal predecessors, (78), 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)
[2024-11-24 01:56:12,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-11-24 01:56:12,898 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:12,898 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:56:12,899 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:12,904 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:12,904 INFO  L85        PathProgramCache]: Analyzing trace with hash 458919617, now seen corresponding path program 1 times
[2024-11-24 01:56:12,912 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:12,913 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834608148]
[2024-11-24 01:56:12,913 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:12,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:13,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:13,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:13,112 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:13,112 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834608148]
[2024-11-24 01:56:13,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834608148] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:13,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:13,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:13,114 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118534173]
[2024-11-24 01:56:13,115 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:13,120 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:13,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:13,147 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:13,148 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:13,150 INFO  L87              Difference]: Start difference. First operand  has 43 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 42 states have internal predecessors, (78), 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 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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)
[2024-11-24 01:56:13,232 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:13,232 INFO  L93              Difference]: Finished difference Result 87 states and 156 transitions.
[2024-11-24 01:56:13,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:13,236 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18
[2024-11-24 01:56:13,236 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:13,247 INFO  L225             Difference]: With dead ends: 87
[2024-11-24 01:56:13,247 INFO  L226             Difference]: Without dead ends: 75
[2024-11-24 01:56:13,251 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:13,257 INFO  L435           NwaCegarLoop]: 80 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:13,258 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:13,275 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2024-11-24 01:56:13,294 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51.
[2024-11-24 01:56:13,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 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)
[2024-11-24 01:56:13,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 94 transitions.
[2024-11-24 01:56:13,308 INFO  L78                 Accepts]: Start accepts. Automaton has 51 states and 94 transitions. Word has length 18
[2024-11-24 01:56:13,309 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:13,310 INFO  L471      AbstractCegarLoop]: Abstraction has 51 states and 94 transitions.
[2024-11-24 01:56:13,310 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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)
[2024-11-24 01:56:13,310 INFO  L276                IsEmpty]: Start isEmpty. Operand 51 states and 94 transitions.
[2024-11-24 01:56:13,311 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-11-24 01:56:13,311 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:13,311 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:56:13,311 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-24 01:56:13,311 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:13,312 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:13,312 INFO  L85        PathProgramCache]: Analyzing trace with hash -552197633, now seen corresponding path program 1 times
[2024-11-24 01:56:13,313 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:13,313 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069168098]
[2024-11-24 01:56:13,313 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:13,313 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:13,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:13,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:13,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:13,477 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069168098]
[2024-11-24 01:56:13,477 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069168098] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:13,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:13,477 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:13,478 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416639807]
[2024-11-24 01:56:13,478 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:13,479 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:13,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:13,480 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:13,480 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:13,480 INFO  L87              Difference]: Start difference. First operand 51 states and 94 transitions. Second operand  has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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)
[2024-11-24 01:56:13,516 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:13,516 INFO  L93              Difference]: Finished difference Result 124 states and 229 transitions.
[2024-11-24 01:56:13,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:13,518 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18
[2024-11-24 01:56:13,518 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:13,519 INFO  L225             Difference]: With dead ends: 124
[2024-11-24 01:56:13,519 INFO  L226             Difference]: Without dead ends: 75
[2024-11-24 01:56:13,519 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:13,520 INFO  L435           NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:13,522 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:13,523 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2024-11-24 01:56:13,531 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73.
[2024-11-24 01:56:13,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 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)
[2024-11-24 01:56:13,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 134 transitions.
[2024-11-24 01:56:13,536 INFO  L78                 Accepts]: Start accepts. Automaton has 73 states and 134 transitions. Word has length 18
[2024-11-24 01:56:13,536 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:13,536 INFO  L471      AbstractCegarLoop]: Abstraction has 73 states and 134 transitions.
[2024-11-24 01:56:13,536 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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)
[2024-11-24 01:56:13,536 INFO  L276                IsEmpty]: Start isEmpty. Operand 73 states and 134 transitions.
[2024-11-24 01:56:13,537 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-11-24 01:56:13,537 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:13,537 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:56:13,538 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-24 01:56:13,538 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:13,538 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:13,538 INFO  L85        PathProgramCache]: Analyzing trace with hash 1341819263, now seen corresponding path program 1 times
[2024-11-24 01:56:13,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:13,540 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639671569]
[2024-11-24 01:56:13,540 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:13,540 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:13,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:13,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:13,649 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:13,649 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639671569]
[2024-11-24 01:56:13,649 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639671569] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:13,649 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:13,650 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:13,650 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606129171]
[2024-11-24 01:56:13,650 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:13,650 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:13,650 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:13,651 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:13,651 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:13,651 INFO  L87              Difference]: Start difference. First operand 73 states and 134 transitions. Second operand  has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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)
[2024-11-24 01:56:13,687 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:13,687 INFO  L93              Difference]: Finished difference Result 114 states and 204 transitions.
[2024-11-24 01:56:13,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:13,688 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19
[2024-11-24 01:56:13,688 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:13,689 INFO  L225             Difference]: With dead ends: 114
[2024-11-24 01:56:13,689 INFO  L226             Difference]: Without dead ends: 78
[2024-11-24 01:56:13,689 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:13,690 INFO  L435           NwaCegarLoop]: 112 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:13,691 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:13,692 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2024-11-24 01:56:13,697 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76.
[2024-11-24 01:56:13,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 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)
[2024-11-24 01:56:13,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 136 transitions.
[2024-11-24 01:56:13,699 INFO  L78                 Accepts]: Start accepts. Automaton has 76 states and 136 transitions. Word has length 19
[2024-11-24 01:56:13,699 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:13,700 INFO  L471      AbstractCegarLoop]: Abstraction has 76 states and 136 transitions.
[2024-11-24 01:56:13,700 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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)
[2024-11-24 01:56:13,700 INFO  L276                IsEmpty]: Start isEmpty. Operand 76 states and 136 transitions.
[2024-11-24 01:56:13,704 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-11-24 01:56:13,704 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:13,704 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:56:13,704 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-24 01:56:13,704 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:13,705 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:13,705 INFO  L85        PathProgramCache]: Analyzing trace with hash 61955585, now seen corresponding path program 1 times
[2024-11-24 01:56:13,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:13,705 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630425003]
[2024-11-24 01:56:13,705 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:13,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:13,732 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:13,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:13,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:13,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630425003]
[2024-11-24 01:56:13,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630425003] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:13,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:13,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:13,802 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696574544]
[2024-11-24 01:56:13,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:13,802 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:13,803 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:13,803 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:13,806 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:13,806 INFO  L87              Difference]: Start difference. First operand 76 states and 136 transitions. Second operand  has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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)
[2024-11-24 01:56:13,842 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:13,843 INFO  L93              Difference]: Finished difference Result 145 states and 261 transitions.
[2024-11-24 01:56:13,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:13,843 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19
[2024-11-24 01:56:13,844 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:13,845 INFO  L225             Difference]: With dead ends: 145
[2024-11-24 01:56:13,845 INFO  L226             Difference]: Without dead ends: 143
[2024-11-24 01:56:13,845 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:13,846 INFO  L435           NwaCegarLoop]: 72 mSDtfsCounter, 50 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:13,851 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:13,852 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 143 states.
[2024-11-24 01:56:13,873 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101.
[2024-11-24 01:56:13,874 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 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)
[2024-11-24 01:56:13,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 181 transitions.
[2024-11-24 01:56:13,879 INFO  L78                 Accepts]: Start accepts. Automaton has 101 states and 181 transitions. Word has length 19
[2024-11-24 01:56:13,879 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:13,879 INFO  L471      AbstractCegarLoop]: Abstraction has 101 states and 181 transitions.
[2024-11-24 01:56:13,879 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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)
[2024-11-24 01:56:13,879 INFO  L276                IsEmpty]: Start isEmpty. Operand 101 states and 181 transitions.
[2024-11-24 01:56:13,880 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-11-24 01:56:13,880 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:13,880 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:56:13,880 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-24 01:56:13,880 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:13,881 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:13,881 INFO  L85        PathProgramCache]: Analyzing trace with hash -949161665, now seen corresponding path program 1 times
[2024-11-24 01:56:13,881 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:13,881 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509845255]
[2024-11-24 01:56:13,881 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:13,881 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:13,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:13,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:13,960 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:13,960 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509845255]
[2024-11-24 01:56:13,960 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509845255] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:13,960 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:13,960 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:13,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970196642]
[2024-11-24 01:56:13,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:13,961 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:13,961 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:13,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:13,962 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:13,963 INFO  L87              Difference]: Start difference. First operand 101 states and 181 transitions. Second operand  has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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)
[2024-11-24 01:56:13,990 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:13,991 INFO  L93              Difference]: Finished difference Result 241 states and 435 transitions.
[2024-11-24 01:56:13,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:13,992 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19
[2024-11-24 01:56:13,992 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:13,993 INFO  L225             Difference]: With dead ends: 241
[2024-11-24 01:56:13,993 INFO  L226             Difference]: Without dead ends: 145
[2024-11-24 01:56:13,994 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:13,995 INFO  L435           NwaCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:13,998 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:13,999 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2024-11-24 01:56:14,013 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143.
[2024-11-24 01:56:14,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 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)
[2024-11-24 01:56:14,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 255 transitions.
[2024-11-24 01:56:14,016 INFO  L78                 Accepts]: Start accepts. Automaton has 143 states and 255 transitions. Word has length 19
[2024-11-24 01:56:14,016 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:14,016 INFO  L471      AbstractCegarLoop]: Abstraction has 143 states and 255 transitions.
[2024-11-24 01:56:14,016 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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)
[2024-11-24 01:56:14,017 INFO  L276                IsEmpty]: Start isEmpty. Operand 143 states and 255 transitions.
[2024-11-24 01:56:14,017 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2024-11-24 01:56:14,018 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:14,018 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]
[2024-11-24 01:56:14,018 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-24 01:56:14,018 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:14,019 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:14,019 INFO  L85        PathProgramCache]: Analyzing trace with hash 1920836500, now seen corresponding path program 1 times
[2024-11-24 01:56:14,019 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:14,019 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399799084]
[2024-11-24 01:56:14,019 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:14,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:14,046 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:14,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:14,095 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:14,095 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399799084]
[2024-11-24 01:56:14,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399799084] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:14,095 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:14,095 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:14,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757301546]
[2024-11-24 01:56:14,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:14,096 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:14,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:14,096 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:14,096 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:14,097 INFO  L87              Difference]: Start difference. First operand 143 states and 255 transitions. Second operand  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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)
[2024-11-24 01:56:14,139 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:14,139 INFO  L93              Difference]: Finished difference Result 216 states and 382 transitions.
[2024-11-24 01:56:14,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:14,141 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20
[2024-11-24 01:56:14,141 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:14,142 INFO  L225             Difference]: With dead ends: 216
[2024-11-24 01:56:14,142 INFO  L226             Difference]: Without dead ends: 147
[2024-11-24 01:56:14,143 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:14,144 INFO  L435           NwaCegarLoop]: 109 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:14,144 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:14,149 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2024-11-24 01:56:14,165 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145.
[2024-11-24 01:56:14,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 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)
[2024-11-24 01:56:14,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 255 transitions.
[2024-11-24 01:56:14,171 INFO  L78                 Accepts]: Start accepts. Automaton has 145 states and 255 transitions. Word has length 20
[2024-11-24 01:56:14,171 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:14,172 INFO  L471      AbstractCegarLoop]: Abstraction has 145 states and 255 transitions.
[2024-11-24 01:56:14,172 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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)
[2024-11-24 01:56:14,172 INFO  L276                IsEmpty]: Start isEmpty. Operand 145 states and 255 transitions.
[2024-11-24 01:56:14,173 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2024-11-24 01:56:14,173 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:14,173 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]
[2024-11-24 01:56:14,173 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-24 01:56:14,173 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:14,174 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:14,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 640972822, now seen corresponding path program 1 times
[2024-11-24 01:56:14,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:14,174 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311310062]
[2024-11-24 01:56:14,174 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:14,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:14,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:14,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:14,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:14,260 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311310062]
[2024-11-24 01:56:14,260 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311310062] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:14,260 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:14,260 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:14,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163871059]
[2024-11-24 01:56:14,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:14,261 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:14,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:14,261 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:14,262 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:14,262 INFO  L87              Difference]: Start difference. First operand 145 states and 255 transitions. Second operand  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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)
[2024-11-24 01:56:14,298 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:14,298 INFO  L93              Difference]: Finished difference Result 417 states and 737 transitions.
[2024-11-24 01:56:14,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:14,300 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20
[2024-11-24 01:56:14,300 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:14,301 INFO  L225             Difference]: With dead ends: 417
[2024-11-24 01:56:14,301 INFO  L226             Difference]: Without dead ends: 279
[2024-11-24 01:56:14,302 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:14,306 INFO  L435           NwaCegarLoop]: 75 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:14,307 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 139 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:14,308 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 279 states.
[2024-11-24 01:56:14,332 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277.
[2024-11-24 01:56:14,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 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)
[2024-11-24 01:56:14,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 483 transitions.
[2024-11-24 01:56:14,344 INFO  L78                 Accepts]: Start accepts. Automaton has 277 states and 483 transitions. Word has length 20
[2024-11-24 01:56:14,344 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:14,344 INFO  L471      AbstractCegarLoop]: Abstraction has 277 states and 483 transitions.
[2024-11-24 01:56:14,345 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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)
[2024-11-24 01:56:14,345 INFO  L276                IsEmpty]: Start isEmpty. Operand 277 states and 483 transitions.
[2024-11-24 01:56:14,345 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2024-11-24 01:56:14,346 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:14,346 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]
[2024-11-24 01:56:14,346 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-24 01:56:14,346 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:14,346 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:14,346 INFO  L85        PathProgramCache]: Analyzing trace with hash 1652090072, now seen corresponding path program 1 times
[2024-11-24 01:56:14,347 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:14,347 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851482123]
[2024-11-24 01:56:14,347 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:14,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:14,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:14,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:14,408 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:14,409 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851482123]
[2024-11-24 01:56:14,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851482123] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:14,409 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:14,410 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:14,410 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136764410]
[2024-11-24 01:56:14,410 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:14,410 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:14,410 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:14,411 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:14,411 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:14,411 INFO  L87              Difference]: Start difference. First operand 277 states and 483 transitions. Second operand  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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)
[2024-11-24 01:56:14,443 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:14,443 INFO  L93              Difference]: Finished difference Result 353 states and 621 transitions.
[2024-11-24 01:56:14,443 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:14,444 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20
[2024-11-24 01:56:14,444 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:14,445 INFO  L225             Difference]: With dead ends: 353
[2024-11-24 01:56:14,449 INFO  L226             Difference]: Without dead ends: 351
[2024-11-24 01:56:14,450 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:14,451 INFO  L435           NwaCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:14,451 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 188 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:14,452 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 351 states.
[2024-11-24 01:56:14,485 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 277.
[2024-11-24 01:56:14,486 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 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)
[2024-11-24 01:56:14,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 479 transitions.
[2024-11-24 01:56:14,494 INFO  L78                 Accepts]: Start accepts. Automaton has 277 states and 479 transitions. Word has length 20
[2024-11-24 01:56:14,494 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:14,494 INFO  L471      AbstractCegarLoop]: Abstraction has 277 states and 479 transitions.
[2024-11-24 01:56:14,494 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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)
[2024-11-24 01:56:14,495 INFO  L276                IsEmpty]: Start isEmpty. Operand 277 states and 479 transitions.
[2024-11-24 01:56:14,496 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2024-11-24 01:56:14,496 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:14,497 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]
[2024-11-24 01:56:14,498 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-24 01:56:14,498 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:14,498 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:14,498 INFO  L85        PathProgramCache]: Analyzing trace with hash -1604465292, now seen corresponding path program 1 times
[2024-11-24 01:56:14,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:14,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452536528]
[2024-11-24 01:56:14,502 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:14,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:14,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:14,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:14,562 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:14,562 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452536528]
[2024-11-24 01:56:14,562 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452536528] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:14,562 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:14,562 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:14,562 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877650148]
[2024-11-24 01:56:14,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:14,567 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:14,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:14,568 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:14,568 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:14,568 INFO  L87              Difference]: Start difference. First operand 277 states and 479 transitions. Second operand  has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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)
[2024-11-24 01:56:14,597 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:14,598 INFO  L93              Difference]: Finished difference Result 517 states and 905 transitions.
[2024-11-24 01:56:14,598 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:14,599 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21
[2024-11-24 01:56:14,599 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:14,602 INFO  L225             Difference]: With dead ends: 517
[2024-11-24 01:56:14,602 INFO  L226             Difference]: Without dead ends: 515
[2024-11-24 01:56:14,603 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:14,603 INFO  L435           NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:14,604 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:14,605 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 515 states.
[2024-11-24 01:56:14,625 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 385.
[2024-11-24 01:56:14,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 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)
[2024-11-24 01:56:14,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 655 transitions.
[2024-11-24 01:56:14,629 INFO  L78                 Accepts]: Start accepts. Automaton has 385 states and 655 transitions. Word has length 21
[2024-11-24 01:56:14,629 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:14,630 INFO  L471      AbstractCegarLoop]: Abstraction has 385 states and 655 transitions.
[2024-11-24 01:56:14,630 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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)
[2024-11-24 01:56:14,630 INFO  L276                IsEmpty]: Start isEmpty. Operand 385 states and 655 transitions.
[2024-11-24 01:56:14,632 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2024-11-24 01:56:14,632 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:14,632 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]
[2024-11-24 01:56:14,632 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-24 01:56:14,633 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:14,633 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:14,633 INFO  L85        PathProgramCache]: Analyzing trace with hash 1679384754, now seen corresponding path program 1 times
[2024-11-24 01:56:14,634 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:14,634 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774812096]
[2024-11-24 01:56:14,634 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:14,634 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:14,646 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:14,682 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:14,682 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:14,682 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774812096]
[2024-11-24 01:56:14,682 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774812096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:14,682 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:14,683 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:14,683 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053549682]
[2024-11-24 01:56:14,683 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:14,683 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:14,683 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:14,684 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:14,684 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:14,684 INFO  L87              Difference]: Start difference. First operand 385 states and 655 transitions. Second operand  has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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)
[2024-11-24 01:56:14,742 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:14,742 INFO  L93              Difference]: Finished difference Result 917 states and 1569 transitions.
[2024-11-24 01:56:14,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:14,743 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21
[2024-11-24 01:56:14,743 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:14,745 INFO  L225             Difference]: With dead ends: 917
[2024-11-24 01:56:14,746 INFO  L226             Difference]: Without dead ends: 539
[2024-11-24 01:56:14,747 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:14,748 INFO  L435           NwaCegarLoop]: 98 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:14,750 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:14,752 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 539 states.
[2024-11-24 01:56:14,785 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537.
[2024-11-24 01:56:14,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 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)
[2024-11-24 01:56:14,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 907 transitions.
[2024-11-24 01:56:14,790 INFO  L78                 Accepts]: Start accepts. Automaton has 537 states and 907 transitions. Word has length 21
[2024-11-24 01:56:14,791 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:14,791 INFO  L471      AbstractCegarLoop]: Abstraction has 537 states and 907 transitions.
[2024-11-24 01:56:14,792 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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)
[2024-11-24 01:56:14,792 INFO  L276                IsEmpty]: Start isEmpty. Operand 537 states and 907 transitions.
[2024-11-24 01:56:14,794 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2024-11-24 01:56:14,795 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:14,795 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]
[2024-11-24 01:56:14,795 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-24 01:56:14,795 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:14,797 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:14,798 INFO  L85        PathProgramCache]: Analyzing trace with hash 1801397547, now seen corresponding path program 1 times
[2024-11-24 01:56:14,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:14,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902635223]
[2024-11-24 01:56:14,798 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:14,798 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:14,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:14,868 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:14,872 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:14,872 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902635223]
[2024-11-24 01:56:14,872 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902635223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:14,872 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:14,872 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:14,872 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439321900]
[2024-11-24 01:56:14,872 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:14,872 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:14,873 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:14,873 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:14,873 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:14,873 INFO  L87              Difference]: Start difference. First operand 537 states and 907 transitions. Second operand  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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)
[2024-11-24 01:56:14,921 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:14,921 INFO  L93              Difference]: Finished difference Result 813 states and 1369 transitions.
[2024-11-24 01:56:14,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:14,923 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22
[2024-11-24 01:56:14,923 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:14,925 INFO  L225             Difference]: With dead ends: 813
[2024-11-24 01:56:14,927 INFO  L226             Difference]: Without dead ends: 551
[2024-11-24 01:56:14,929 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:14,930 INFO  L435           NwaCegarLoop]: 103 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:14,931 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:14,932 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 551 states.
[2024-11-24 01:56:14,968 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549.
[2024-11-24 01:56:14,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 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)
[2024-11-24 01:56:14,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 915 transitions.
[2024-11-24 01:56:14,976 INFO  L78                 Accepts]: Start accepts. Automaton has 549 states and 915 transitions. Word has length 22
[2024-11-24 01:56:14,976 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:14,976 INFO  L471      AbstractCegarLoop]: Abstraction has 549 states and 915 transitions.
[2024-11-24 01:56:14,977 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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)
[2024-11-24 01:56:14,977 INFO  L276                IsEmpty]: Start isEmpty. Operand 549 states and 915 transitions.
[2024-11-24 01:56:14,978 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2024-11-24 01:56:14,978 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:14,978 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]
[2024-11-24 01:56:14,978 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-24 01:56:14,979 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:14,979 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:14,979 INFO  L85        PathProgramCache]: Analyzing trace with hash 521533869, now seen corresponding path program 1 times
[2024-11-24 01:56:14,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:14,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378775361]
[2024-11-24 01:56:14,979 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:14,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:14,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:15,049 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:15,050 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:15,050 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378775361]
[2024-11-24 01:56:15,050 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378775361] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:15,050 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:15,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:15,051 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339567312]
[2024-11-24 01:56:15,051 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:15,051 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:15,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:15,052 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:15,052 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:15,053 INFO  L87              Difference]: Start difference. First operand 549 states and 915 transitions. Second operand  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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)
[2024-11-24 01:56:15,098 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:15,098 INFO  L93              Difference]: Finished difference Result 1001 states and 1693 transitions.
[2024-11-24 01:56:15,099 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:15,099 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22
[2024-11-24 01:56:15,099 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:15,104 INFO  L225             Difference]: With dead ends: 1001
[2024-11-24 01:56:15,104 INFO  L226             Difference]: Without dead ends: 999
[2024-11-24 01:56:15,105 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:15,106 INFO  L435           NwaCegarLoop]: 69 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:15,106 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:15,108 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 999 states.
[2024-11-24 01:56:15,146 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 773.
[2024-11-24 01:56:15,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 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)
[2024-11-24 01:56:15,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1259 transitions.
[2024-11-24 01:56:15,153 INFO  L78                 Accepts]: Start accepts. Automaton has 773 states and 1259 transitions. Word has length 22
[2024-11-24 01:56:15,154 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:15,154 INFO  L471      AbstractCegarLoop]: Abstraction has 773 states and 1259 transitions.
[2024-11-24 01:56:15,154 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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)
[2024-11-24 01:56:15,154 INFO  L276                IsEmpty]: Start isEmpty. Operand 773 states and 1259 transitions.
[2024-11-24 01:56:15,156 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2024-11-24 01:56:15,156 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:15,156 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]
[2024-11-24 01:56:15,156 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-24 01:56:15,157 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:15,157 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:15,157 INFO  L85        PathProgramCache]: Analyzing trace with hash -489583381, now seen corresponding path program 1 times
[2024-11-24 01:56:15,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:15,158 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545362538]
[2024-11-24 01:56:15,158 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:15,158 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:15,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:15,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:15,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:15,197 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545362538]
[2024-11-24 01:56:15,197 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545362538] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:15,197 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:15,197 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:15,197 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587815115]
[2024-11-24 01:56:15,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:15,198 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:15,198 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:15,198 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:15,198 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:15,199 INFO  L87              Difference]: Start difference. First operand 773 states and 1259 transitions. Second operand  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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)
[2024-11-24 01:56:15,259 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:15,260 INFO  L93              Difference]: Finished difference Result 1817 states and 2973 transitions.
[2024-11-24 01:56:15,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:15,260 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22
[2024-11-24 01:56:15,261 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:15,266 INFO  L225             Difference]: With dead ends: 1817
[2024-11-24 01:56:15,267 INFO  L226             Difference]: Without dead ends: 1063
[2024-11-24 01:56:15,268 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:15,270 INFO  L435           NwaCegarLoop]: 100 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:15,271 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:15,273 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1063 states.
[2024-11-24 01:56:15,335 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061.
[2024-11-24 01:56:15,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 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)
[2024-11-24 01:56:15,346 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1715 transitions.
[2024-11-24 01:56:15,347 INFO  L78                 Accepts]: Start accepts. Automaton has 1061 states and 1715 transitions. Word has length 22
[2024-11-24 01:56:15,347 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:15,347 INFO  L471      AbstractCegarLoop]: Abstraction has 1061 states and 1715 transitions.
[2024-11-24 01:56:15,348 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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)
[2024-11-24 01:56:15,348 INFO  L276                IsEmpty]: Start isEmpty. Operand 1061 states and 1715 transitions.
[2024-11-24 01:56:15,351 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2024-11-24 01:56:15,355 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:15,355 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]
[2024-11-24 01:56:15,355 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-24 01:56:15,355 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:15,356 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:15,356 INFO  L85        PathProgramCache]: Analyzing trace with hash -1012104857, now seen corresponding path program 1 times
[2024-11-24 01:56:15,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:15,356 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643495620]
[2024-11-24 01:56:15,356 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:15,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:15,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:15,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:15,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:15,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643495620]
[2024-11-24 01:56:15,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643495620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:15,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:15,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:15,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416728838]
[2024-11-24 01:56:15,397 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:15,397 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:15,397 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:15,397 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:15,398 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:15,398 INFO  L87              Difference]: Start difference. First operand 1061 states and 1715 transitions. Second operand  has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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)
[2024-11-24 01:56:15,458 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:15,458 INFO  L93              Difference]: Finished difference Result 1593 states and 2565 transitions.
[2024-11-24 01:56:15,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:15,459 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23
[2024-11-24 01:56:15,461 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:15,467 INFO  L225             Difference]: With dead ends: 1593
[2024-11-24 01:56:15,467 INFO  L226             Difference]: Without dead ends: 1079
[2024-11-24 01:56:15,469 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:15,470 INFO  L435           NwaCegarLoop]: 100 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:15,470 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:15,473 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1079 states.
[2024-11-24 01:56:15,535 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077.
[2024-11-24 01:56:15,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 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)
[2024-11-24 01:56:15,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1715 transitions.
[2024-11-24 01:56:15,546 INFO  L78                 Accepts]: Start accepts. Automaton has 1077 states and 1715 transitions. Word has length 23
[2024-11-24 01:56:15,548 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:15,548 INFO  L471      AbstractCegarLoop]: Abstraction has 1077 states and 1715 transitions.
[2024-11-24 01:56:15,548 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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)
[2024-11-24 01:56:15,548 INFO  L276                IsEmpty]: Start isEmpty. Operand 1077 states and 1715 transitions.
[2024-11-24 01:56:15,550 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2024-11-24 01:56:15,551 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:15,551 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]
[2024-11-24 01:56:15,551 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-24 01:56:15,551 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:15,551 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:15,551 INFO  L85        PathProgramCache]: Analyzing trace with hash 2002998761, now seen corresponding path program 1 times
[2024-11-24 01:56:15,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:15,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394626093]
[2024-11-24 01:56:15,552 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:15,552 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:15,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:15,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:15,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:15,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394626093]
[2024-11-24 01:56:15,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394626093] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:15,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:15,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:15,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701679297]
[2024-11-24 01:56:15,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:15,599 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:15,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:15,600 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:15,600 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:15,600 INFO  L87              Difference]: Start difference. First operand 1077 states and 1715 transitions. Second operand  has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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)
[2024-11-24 01:56:15,673 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:15,673 INFO  L93              Difference]: Finished difference Result 1929 states and 3125 transitions.
[2024-11-24 01:56:15,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:15,674 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23
[2024-11-24 01:56:15,674 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:15,682 INFO  L225             Difference]: With dead ends: 1929
[2024-11-24 01:56:15,682 INFO  L226             Difference]: Without dead ends: 1927
[2024-11-24 01:56:15,684 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:15,686 INFO  L435           NwaCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:15,688 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 129 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:15,690 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1927 states.
[2024-11-24 01:56:15,760 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1541.
[2024-11-24 01:56:15,763 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 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)
[2024-11-24 01:56:15,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2387 transitions.
[2024-11-24 01:56:15,773 INFO  L78                 Accepts]: Start accepts. Automaton has 1541 states and 2387 transitions. Word has length 23
[2024-11-24 01:56:15,773 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:15,773 INFO  L471      AbstractCegarLoop]: Abstraction has 1541 states and 2387 transitions.
[2024-11-24 01:56:15,773 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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)
[2024-11-24 01:56:15,774 INFO  L276                IsEmpty]: Start isEmpty. Operand 1541 states and 2387 transitions.
[2024-11-24 01:56:15,777 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2024-11-24 01:56:15,777 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:15,777 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]
[2024-11-24 01:56:15,778 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-24 01:56:15,778 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:15,778 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:15,778 INFO  L85        PathProgramCache]: Analyzing trace with hash 991881511, now seen corresponding path program 1 times
[2024-11-24 01:56:15,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:15,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838808383]
[2024-11-24 01:56:15,779 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:15,779 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:15,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:15,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:15,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:15,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838808383]
[2024-11-24 01:56:15,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838808383] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:15,823 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:15,823 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:15,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697340780]
[2024-11-24 01:56:15,825 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:15,825 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:15,825 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:15,826 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:15,826 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:15,826 INFO  L87              Difference]: Start difference. First operand 1541 states and 2387 transitions. Second operand  has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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)
[2024-11-24 01:56:15,925 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:15,925 INFO  L93              Difference]: Finished difference Result 3593 states and 5589 transitions.
[2024-11-24 01:56:15,926 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:15,926 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23
[2024-11-24 01:56:15,926 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:15,935 INFO  L225             Difference]: With dead ends: 3593
[2024-11-24 01:56:15,935 INFO  L226             Difference]: Without dead ends: 2087
[2024-11-24 01:56:15,940 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:15,942 INFO  L435           NwaCegarLoop]: 102 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:15,942 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:15,945 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2087 states.
[2024-11-24 01:56:16,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2085.
[2024-11-24 01:56:16,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 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)
[2024-11-24 01:56:16,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3203 transitions.
[2024-11-24 01:56:16,066 INFO  L78                 Accepts]: Start accepts. Automaton has 2085 states and 3203 transitions. Word has length 23
[2024-11-24 01:56:16,067 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:16,067 INFO  L471      AbstractCegarLoop]: Abstraction has 2085 states and 3203 transitions.
[2024-11-24 01:56:16,067 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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)
[2024-11-24 01:56:16,067 INFO  L276                IsEmpty]: Start isEmpty. Operand 2085 states and 3203 transitions.
[2024-11-24 01:56:16,071 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2024-11-24 01:56:16,071 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:16,071 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]
[2024-11-24 01:56:16,071 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-24 01:56:16,071 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:16,072 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:16,073 INFO  L85        PathProgramCache]: Analyzing trace with hash 1963634176, now seen corresponding path program 1 times
[2024-11-24 01:56:16,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:16,074 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946844946]
[2024-11-24 01:56:16,074 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:16,074 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:16,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:16,129 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:16,130 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:16,130 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946844946]
[2024-11-24 01:56:16,130 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946844946] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:16,130 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:16,130 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:16,130 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818891159]
[2024-11-24 01:56:16,131 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:16,132 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:16,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:16,132 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:16,132 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:16,132 INFO  L87              Difference]: Start difference. First operand 2085 states and 3203 transitions. Second operand  has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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)
[2024-11-24 01:56:16,204 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:16,205 INFO  L93              Difference]: Finished difference Result 3129 states and 4789 transitions.
[2024-11-24 01:56:16,205 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:16,205 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24
[2024-11-24 01:56:16,206 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:16,213 INFO  L225             Difference]: With dead ends: 3129
[2024-11-24 01:56:16,214 INFO  L226             Difference]: Without dead ends: 2119
[2024-11-24 01:56:16,215 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:16,216 INFO  L435           NwaCegarLoop]: 97 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:16,216 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:16,220 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2119 states.
[2024-11-24 01:56:16,306 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2117.
[2024-11-24 01:56:16,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 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)
[2024-11-24 01:56:16,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3203 transitions.
[2024-11-24 01:56:16,321 INFO  L78                 Accepts]: Start accepts. Automaton has 2117 states and 3203 transitions. Word has length 24
[2024-11-24 01:56:16,321 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:16,321 INFO  L471      AbstractCegarLoop]: Abstraction has 2117 states and 3203 transitions.
[2024-11-24 01:56:16,321 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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)
[2024-11-24 01:56:16,321 INFO  L276                IsEmpty]: Start isEmpty. Operand 2117 states and 3203 transitions.
[2024-11-24 01:56:16,324 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2024-11-24 01:56:16,324 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:16,324 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]
[2024-11-24 01:56:16,325 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-24 01:56:16,325 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:16,325 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:16,325 INFO  L85        PathProgramCache]: Analyzing trace with hash 683770498, now seen corresponding path program 1 times
[2024-11-24 01:56:16,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:16,326 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661450061]
[2024-11-24 01:56:16,326 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:16,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:16,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:16,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:16,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:16,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661450061]
[2024-11-24 01:56:16,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661450061] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:16,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:16,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:16,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984663570]
[2024-11-24 01:56:16,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:16,363 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:16,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:16,363 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:16,363 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:16,363 INFO  L87              Difference]: Start difference. First operand 2117 states and 3203 transitions. Second operand  has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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)
[2024-11-24 01:56:16,476 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:16,477 INFO  L93              Difference]: Finished difference Result 3721 states and 5733 transitions.
[2024-11-24 01:56:16,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:16,477 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24
[2024-11-24 01:56:16,478 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:16,491 INFO  L225             Difference]: With dead ends: 3721
[2024-11-24 01:56:16,492 INFO  L226             Difference]: Without dead ends: 3719
[2024-11-24 01:56:16,493 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:16,494 INFO  L435           NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:16,494 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:16,498 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3719 states.
[2024-11-24 01:56:16,605 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3077.
[2024-11-24 01:56:16,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 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)
[2024-11-24 01:56:16,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4515 transitions.
[2024-11-24 01:56:16,624 INFO  L78                 Accepts]: Start accepts. Automaton has 3077 states and 4515 transitions. Word has length 24
[2024-11-24 01:56:16,624 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:16,624 INFO  L471      AbstractCegarLoop]: Abstraction has 3077 states and 4515 transitions.
[2024-11-24 01:56:16,624 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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)
[2024-11-24 01:56:16,624 INFO  L276                IsEmpty]: Start isEmpty. Operand 3077 states and 4515 transitions.
[2024-11-24 01:56:16,629 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2024-11-24 01:56:16,629 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:16,630 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]
[2024-11-24 01:56:16,630 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-24 01:56:16,630 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:16,630 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:16,631 INFO  L85        PathProgramCache]: Analyzing trace with hash -327346752, now seen corresponding path program 1 times
[2024-11-24 01:56:16,631 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:16,631 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275542202]
[2024-11-24 01:56:16,631 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:16,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:16,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:16,663 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:16,664 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:16,664 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275542202]
[2024-11-24 01:56:16,664 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275542202] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:16,664 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:16,664 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:16,664 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619003904]
[2024-11-24 01:56:16,664 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:16,664 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:16,664 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:16,665 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:16,665 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:16,665 INFO  L87              Difference]: Start difference. First operand 3077 states and 4515 transitions. Second operand  has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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)
[2024-11-24 01:56:16,800 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:16,800 INFO  L93              Difference]: Finished difference Result 7113 states and 10469 transitions.
[2024-11-24 01:56:16,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:16,801 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24
[2024-11-24 01:56:16,801 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:16,815 INFO  L225             Difference]: With dead ends: 7113
[2024-11-24 01:56:16,816 INFO  L226             Difference]: Without dead ends: 4103
[2024-11-24 01:56:16,819 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:16,820 INFO  L435           NwaCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:16,820 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:16,825 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4103 states.
[2024-11-24 01:56:17,023 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4101.
[2024-11-24 01:56:17,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 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)
[2024-11-24 01:56:17,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5955 transitions.
[2024-11-24 01:56:17,052 INFO  L78                 Accepts]: Start accepts. Automaton has 4101 states and 5955 transitions. Word has length 24
[2024-11-24 01:56:17,052 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:17,052 INFO  L471      AbstractCegarLoop]: Abstraction has 4101 states and 5955 transitions.
[2024-11-24 01:56:17,052 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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)
[2024-11-24 01:56:17,053 INFO  L276                IsEmpty]: Start isEmpty. Operand 4101 states and 5955 transitions.
[2024-11-24 01:56:17,057 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-11-24 01:56:17,058 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:17,058 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]
[2024-11-24 01:56:17,058 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-24 01:56:17,058 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:17,059 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:17,059 INFO  L85        PathProgramCache]: Analyzing trace with hash -277735972, now seen corresponding path program 1 times
[2024-11-24 01:56:17,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:17,059 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556646110]
[2024-11-24 01:56:17,059 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:17,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:17,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:17,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:17,104 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:17,104 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556646110]
[2024-11-24 01:56:17,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556646110] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:17,105 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:17,105 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:17,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056586023]
[2024-11-24 01:56:17,105 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:17,106 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:17,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:17,106 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:17,106 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:17,107 INFO  L87              Difference]: Start difference. First operand 4101 states and 5955 transitions. Second operand  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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)
[2024-11-24 01:56:17,226 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:17,226 INFO  L93              Difference]: Finished difference Result 6153 states and 8901 transitions.
[2024-11-24 01:56:17,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:17,227 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25
[2024-11-24 01:56:17,227 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:17,253 INFO  L225             Difference]: With dead ends: 6153
[2024-11-24 01:56:17,254 INFO  L226             Difference]: Without dead ends: 4167
[2024-11-24 01:56:17,257 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:17,257 INFO  L435           NwaCegarLoop]: 94 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:17,258 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:17,264 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4167 states.
[2024-11-24 01:56:17,436 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 4165.
[2024-11-24 01:56:17,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 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)
[2024-11-24 01:56:17,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5955 transitions.
[2024-11-24 01:56:17,466 INFO  L78                 Accepts]: Start accepts. Automaton has 4165 states and 5955 transitions. Word has length 25
[2024-11-24 01:56:17,466 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:17,466 INFO  L471      AbstractCegarLoop]: Abstraction has 4165 states and 5955 transitions.
[2024-11-24 01:56:17,466 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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)
[2024-11-24 01:56:17,467 INFO  L276                IsEmpty]: Start isEmpty. Operand 4165 states and 5955 transitions.
[2024-11-24 01:56:17,471 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-11-24 01:56:17,471 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:17,472 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]
[2024-11-24 01:56:17,472 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-11-24 01:56:17,472 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:17,473 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:17,473 INFO  L85        PathProgramCache]: Analyzing trace with hash -1557599650, now seen corresponding path program 1 times
[2024-11-24 01:56:17,473 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:17,473 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184526321]
[2024-11-24 01:56:17,473 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:17,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:17,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:17,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:17,512 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:17,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184526321]
[2024-11-24 01:56:17,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184526321] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:17,512 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:17,512 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:17,512 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111018177]
[2024-11-24 01:56:17,512 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:17,513 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:17,513 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:17,513 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:17,513 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:17,513 INFO  L87              Difference]: Start difference. First operand 4165 states and 5955 transitions. Second operand  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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)
[2024-11-24 01:56:17,714 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:17,714 INFO  L93              Difference]: Finished difference Result 7177 states and 10437 transitions.
[2024-11-24 01:56:17,715 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:17,715 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25
[2024-11-24 01:56:17,715 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:17,752 INFO  L225             Difference]: With dead ends: 7177
[2024-11-24 01:56:17,752 INFO  L226             Difference]: Without dead ends: 7175
[2024-11-24 01:56:17,754 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:17,756 INFO  L435           NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:17,757 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 125 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:17,766 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7175 states.
[2024-11-24 01:56:18,019 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7175 to 6149.
[2024-11-24 01:56:18,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 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)
[2024-11-24 01:56:18,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 8515 transitions.
[2024-11-24 01:56:18,065 INFO  L78                 Accepts]: Start accepts. Automaton has 6149 states and 8515 transitions. Word has length 25
[2024-11-24 01:56:18,066 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:18,066 INFO  L471      AbstractCegarLoop]: Abstraction has 6149 states and 8515 transitions.
[2024-11-24 01:56:18,066 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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)
[2024-11-24 01:56:18,066 INFO  L276                IsEmpty]: Start isEmpty. Operand 6149 states and 8515 transitions.
[2024-11-24 01:56:18,074 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-11-24 01:56:18,075 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:18,075 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]
[2024-11-24 01:56:18,075 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-11-24 01:56:18,075 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:18,075 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:18,076 INFO  L85        PathProgramCache]: Analyzing trace with hash 1726250396, now seen corresponding path program 1 times
[2024-11-24 01:56:18,076 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:18,076 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684442233]
[2024-11-24 01:56:18,076 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:18,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:18,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:18,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:18,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:18,114 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684442233]
[2024-11-24 01:56:18,114 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684442233] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:18,114 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:18,115 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:18,115 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666980895]
[2024-11-24 01:56:18,115 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:18,116 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:18,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:18,116 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:18,117 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:18,117 INFO  L87              Difference]: Start difference. First operand 6149 states and 8515 transitions. Second operand  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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)
[2024-11-24 01:56:18,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:18,348 INFO  L93              Difference]: Finished difference Result 14089 states and 19525 transitions.
[2024-11-24 01:56:18,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:18,352 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25
[2024-11-24 01:56:18,352 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:18,374 INFO  L225             Difference]: With dead ends: 14089
[2024-11-24 01:56:18,374 INFO  L226             Difference]: Without dead ends: 8071
[2024-11-24 01:56:18,382 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:18,384 INFO  L435           NwaCegarLoop]: 106 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:18,384 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:18,394 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8071 states.
[2024-11-24 01:56:18,757 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8071 to 8069.
[2024-11-24 01:56:18,774 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 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)
[2024-11-24 01:56:18,811 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 11011 transitions.
[2024-11-24 01:56:18,812 INFO  L78                 Accepts]: Start accepts. Automaton has 8069 states and 11011 transitions. Word has length 25
[2024-11-24 01:56:18,812 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:18,812 INFO  L471      AbstractCegarLoop]: Abstraction has 8069 states and 11011 transitions.
[2024-11-24 01:56:18,813 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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)
[2024-11-24 01:56:18,813 INFO  L276                IsEmpty]: Start isEmpty. Operand 8069 states and 11011 transitions.
[2024-11-24 01:56:18,822 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-24 01:56:18,822 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:18,822 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]
[2024-11-24 01:56:18,822 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-11-24 01:56:18,823 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:18,824 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:18,824 INFO  L85        PathProgramCache]: Analyzing trace with hash -1040733483, now seen corresponding path program 1 times
[2024-11-24 01:56:18,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:18,825 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955469624]
[2024-11-24 01:56:18,825 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:18,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:18,835 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:18,862 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:18,862 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:18,862 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955469624]
[2024-11-24 01:56:18,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955469624] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:18,863 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:18,863 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:18,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962570888]
[2024-11-24 01:56:18,863 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:18,863 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:18,863 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:18,864 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:18,864 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:18,864 INFO  L87              Difference]: Start difference. First operand 8069 states and 11011 transitions. Second operand  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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)
[2024-11-24 01:56:19,039 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:19,040 INFO  L93              Difference]: Finished difference Result 12105 states and 16453 transitions.
[2024-11-24 01:56:19,040 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:19,040 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26
[2024-11-24 01:56:19,041 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:19,061 INFO  L225             Difference]: With dead ends: 12105
[2024-11-24 01:56:19,061 INFO  L226             Difference]: Without dead ends: 8199
[2024-11-24 01:56:19,067 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:19,068 INFO  L435           NwaCegarLoop]: 91 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:19,068 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:19,077 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8199 states.
[2024-11-24 01:56:19,492 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8197.
[2024-11-24 01:56:19,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 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)
[2024-11-24 01:56:19,546 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 11011 transitions.
[2024-11-24 01:56:19,548 INFO  L78                 Accepts]: Start accepts. Automaton has 8197 states and 11011 transitions. Word has length 26
[2024-11-24 01:56:19,548 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:19,548 INFO  L471      AbstractCegarLoop]: Abstraction has 8197 states and 11011 transitions.
[2024-11-24 01:56:19,548 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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)
[2024-11-24 01:56:19,548 INFO  L276                IsEmpty]: Start isEmpty. Operand 8197 states and 11011 transitions.
[2024-11-24 01:56:19,561 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-24 01:56:19,561 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:19,561 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]
[2024-11-24 01:56:19,561 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-11-24 01:56:19,562 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:19,562 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:19,562 INFO  L85        PathProgramCache]: Analyzing trace with hash 1974370135, now seen corresponding path program 1 times
[2024-11-24 01:56:19,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:19,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648984104]
[2024-11-24 01:56:19,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:19,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:19,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:19,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:19,615 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:19,615 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648984104]
[2024-11-24 01:56:19,615 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648984104] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:19,615 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:19,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:19,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553529627]
[2024-11-24 01:56:19,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:19,616 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:19,617 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:19,617 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:19,617 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:19,618 INFO  L87              Difference]: Start difference. First operand 8197 states and 11011 transitions. Second operand  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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)
[2024-11-24 01:56:20,014 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:20,015 INFO  L93              Difference]: Finished difference Result 13833 states and 18821 transitions.
[2024-11-24 01:56:20,015 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:20,015 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26
[2024-11-24 01:56:20,016 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:20,062 INFO  L225             Difference]: With dead ends: 13833
[2024-11-24 01:56:20,062 INFO  L226             Difference]: Without dead ends: 13831
[2024-11-24 01:56:20,068 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:20,070 INFO  L435           NwaCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:20,070 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:20,093 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13831 states.
[2024-11-24 01:56:20,550 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13831 to 12293.
[2024-11-24 01:56:20,574 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 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)
[2024-11-24 01:56:20,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12293 states to 12293 states and 16003 transitions.
[2024-11-24 01:56:20,622 INFO  L78                 Accepts]: Start accepts. Automaton has 12293 states and 16003 transitions. Word has length 26
[2024-11-24 01:56:20,622 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:20,622 INFO  L471      AbstractCegarLoop]: Abstraction has 12293 states and 16003 transitions.
[2024-11-24 01:56:20,622 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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)
[2024-11-24 01:56:20,623 INFO  L276                IsEmpty]: Start isEmpty. Operand 12293 states and 16003 transitions.
[2024-11-24 01:56:20,640 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-24 01:56:20,640 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:20,640 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]
[2024-11-24 01:56:20,640 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-11-24 01:56:20,641 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:20,642 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:20,642 INFO  L85        PathProgramCache]: Analyzing trace with hash 963252885, now seen corresponding path program 1 times
[2024-11-24 01:56:20,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:20,642 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606469808]
[2024-11-24 01:56:20,642 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:20,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:20,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:20,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:20,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:20,689 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606469808]
[2024-11-24 01:56:20,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606469808] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:20,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:20,689 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:20,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612895726]
[2024-11-24 01:56:20,690 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:20,691 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:20,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:20,691 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:20,692 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:20,692 INFO  L87              Difference]: Start difference. First operand 12293 states and 16003 transitions. Second operand  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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)
[2024-11-24 01:56:21,051 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:21,051 INFO  L93              Difference]: Finished difference Result 27913 states and 36229 transitions.
[2024-11-24 01:56:21,052 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:21,052 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26
[2024-11-24 01:56:21,052 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:21,091 INFO  L225             Difference]: With dead ends: 27913
[2024-11-24 01:56:21,091 INFO  L226             Difference]: Without dead ends: 15879
[2024-11-24 01:56:21,104 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:21,105 INFO  L435           NwaCegarLoop]: 108 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:21,106 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:21,122 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15879 states.
[2024-11-24 01:56:21,567 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15879 to 15877.
[2024-11-24 01:56:21,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15877 states, 15876 states have (on average 1.2740614764424287) internal successors, (20227), 15876 states have internal predecessors, (20227), 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)
[2024-11-24 01:56:21,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 20227 transitions.
[2024-11-24 01:56:21,770 INFO  L78                 Accepts]: Start accepts. Automaton has 15877 states and 20227 transitions. Word has length 26
[2024-11-24 01:56:21,770 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:21,770 INFO  L471      AbstractCegarLoop]: Abstraction has 15877 states and 20227 transitions.
[2024-11-24 01:56:21,770 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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)
[2024-11-24 01:56:21,770 INFO  L276                IsEmpty]: Start isEmpty. Operand 15877 states and 20227 transitions.
[2024-11-24 01:56:21,785 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2024-11-24 01:56:21,785 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:21,785 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]
[2024-11-24 01:56:21,785 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-11-24 01:56:21,786 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:21,786 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:21,786 INFO  L85        PathProgramCache]: Analyzing trace with hash 1076147793, now seen corresponding path program 1 times
[2024-11-24 01:56:21,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:21,787 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689905308]
[2024-11-24 01:56:21,787 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:21,787 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:21,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:21,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:21,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:21,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689905308]
[2024-11-24 01:56:21,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689905308] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:21,823 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:21,823 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:21,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007057734]
[2024-11-24 01:56:21,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:21,824 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:21,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:21,824 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:21,825 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:21,825 INFO  L87              Difference]: Start difference. First operand 15877 states and 20227 transitions. Second operand  has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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)
[2024-11-24 01:56:22,065 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:22,066 INFO  L93              Difference]: Finished difference Result 23817 states and 30213 transitions.
[2024-11-24 01:56:22,066 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:22,066 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27
[2024-11-24 01:56:22,066 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:22,102 INFO  L225             Difference]: With dead ends: 23817
[2024-11-24 01:56:22,102 INFO  L226             Difference]: Without dead ends: 16135
[2024-11-24 01:56:22,112 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:22,113 INFO  L435           NwaCegarLoop]: 88 mSDtfsCounter, 47 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:22,113 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:22,122 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16135 states.
[2024-11-24 01:56:22,756 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 16133.
[2024-11-24 01:56:22,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16133 states, 16132 states have (on average 1.2538432928341186) internal successors, (20227), 16132 states have internal predecessors, (20227), 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)
[2024-11-24 01:56:22,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 20227 transitions.
[2024-11-24 01:56:22,840 INFO  L78                 Accepts]: Start accepts. Automaton has 16133 states and 20227 transitions. Word has length 27
[2024-11-24 01:56:22,840 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:22,840 INFO  L471      AbstractCegarLoop]: Abstraction has 16133 states and 20227 transitions.
[2024-11-24 01:56:22,840 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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)
[2024-11-24 01:56:22,841 INFO  L276                IsEmpty]: Start isEmpty. Operand 16133 states and 20227 transitions.
[2024-11-24 01:56:22,864 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2024-11-24 01:56:22,864 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:22,864 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]
[2024-11-24 01:56:22,864 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-11-24 01:56:22,866 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:22,867 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:22,867 INFO  L85        PathProgramCache]: Analyzing trace with hash -203715885, now seen corresponding path program 1 times
[2024-11-24 01:56:22,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:22,867 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259475825]
[2024-11-24 01:56:22,868 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:22,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:22,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:22,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:22,905 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:22,905 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259475825]
[2024-11-24 01:56:22,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259475825] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:22,906 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:22,906 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:22,906 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412737661]
[2024-11-24 01:56:22,906 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:22,906 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:22,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:22,908 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:22,908 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:22,908 INFO  L87              Difference]: Start difference. First operand 16133 states and 20227 transitions. Second operand  has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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)
[2024-11-24 01:56:23,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:23,705 INFO  L93              Difference]: Finished difference Result 26633 states and 33541 transitions.
[2024-11-24 01:56:23,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:23,706 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27
[2024-11-24 01:56:23,706 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:23,780 INFO  L225             Difference]: With dead ends: 26633
[2024-11-24 01:56:23,781 INFO  L226             Difference]: Without dead ends: 26631
[2024-11-24 01:56:23,790 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:23,790 INFO  L435           NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:23,792 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:23,809 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26631 states.
[2024-11-24 01:56:24,351 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26631 to 24581.
[2024-11-24 01:56:24,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24581 states, 24580 states have (on average 1.2186737184703011) internal successors, (29955), 24580 states have internal predecessors, (29955), 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)
[2024-11-24 01:56:24,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24581 states to 24581 states and 29955 transitions.
[2024-11-24 01:56:24,423 INFO  L78                 Accepts]: Start accepts. Automaton has 24581 states and 29955 transitions. Word has length 27
[2024-11-24 01:56:24,423 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:24,423 INFO  L471      AbstractCegarLoop]: Abstraction has 24581 states and 29955 transitions.
[2024-11-24 01:56:24,424 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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)
[2024-11-24 01:56:24,424 INFO  L276                IsEmpty]: Start isEmpty. Operand 24581 states and 29955 transitions.
[2024-11-24 01:56:24,459 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2024-11-24 01:56:24,459 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:24,459 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]
[2024-11-24 01:56:24,459 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-11-24 01:56:24,460 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:24,460 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:24,460 INFO  L85        PathProgramCache]: Analyzing trace with hash -1214833135, now seen corresponding path program 1 times
[2024-11-24 01:56:24,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:24,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375486301]
[2024-11-24 01:56:24,461 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:24,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:24,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:24,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:24,497 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:24,497 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375486301]
[2024-11-24 01:56:24,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375486301] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:24,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:24,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:24,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627771834]
[2024-11-24 01:56:24,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:24,498 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:24,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:24,499 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:24,499 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:24,499 INFO  L87              Difference]: Start difference. First operand 24581 states and 29955 transitions. Second operand  has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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)
[2024-11-24 01:56:25,229 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:25,229 INFO  L93              Difference]: Finished difference Result 55305 states and 66821 transitions.
[2024-11-24 01:56:25,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:25,230 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27
[2024-11-24 01:56:25,230 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:25,291 INFO  L225             Difference]: With dead ends: 55305
[2024-11-24 01:56:25,291 INFO  L226             Difference]: Without dead ends: 31239
[2024-11-24 01:56:25,313 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:25,314 INFO  L435           NwaCegarLoop]: 110 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:25,315 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:25,333 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31239 states.
[2024-11-24 01:56:26,157 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31239 to 31237.
[2024-11-24 01:56:26,188 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31237 states, 31236 states have (on average 1.1802727621974645) internal successors, (36867), 31236 states have internal predecessors, (36867), 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)
[2024-11-24 01:56:26,253 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31237 states to 31237 states and 36867 transitions.
[2024-11-24 01:56:26,256 INFO  L78                 Accepts]: Start accepts. Automaton has 31237 states and 36867 transitions. Word has length 27
[2024-11-24 01:56:26,256 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:26,257 INFO  L471      AbstractCegarLoop]: Abstraction has 31237 states and 36867 transitions.
[2024-11-24 01:56:26,257 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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)
[2024-11-24 01:56:26,257 INFO  L276                IsEmpty]: Start isEmpty. Operand 31237 states and 36867 transitions.
[2024-11-24 01:56:26,279 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2024-11-24 01:56:26,280 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:26,280 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]
[2024-11-24 01:56:26,280 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-11-24 01:56:26,280 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:26,281 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:26,281 INFO  L85        PathProgramCache]: Analyzing trace with hash -2020009046, now seen corresponding path program 1 times
[2024-11-24 01:56:26,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:26,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685741241]
[2024-11-24 01:56:26,282 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:26,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:26,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:26,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:26,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:26,311 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685741241]
[2024-11-24 01:56:26,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685741241] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:26,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:26,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:26,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004687724]
[2024-11-24 01:56:26,312 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:26,312 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:26,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:26,313 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:26,313 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:26,313 INFO  L87              Difference]: Start difference. First operand 31237 states and 36867 transitions. Second operand  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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)
[2024-11-24 01:56:27,334 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:27,335 INFO  L93              Difference]: Finished difference Result 46857 states and 55045 transitions.
[2024-11-24 01:56:27,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:27,336 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28
[2024-11-24 01:56:27,336 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:27,409 INFO  L225             Difference]: With dead ends: 46857
[2024-11-24 01:56:27,409 INFO  L226             Difference]: Without dead ends: 31751
[2024-11-24 01:56:27,426 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:27,427 INFO  L435           NwaCegarLoop]: 85 mSDtfsCounter, 46 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:27,427 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:27,449 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31751 states.
[2024-11-24 01:56:28,374 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31751 to 31749.
[2024-11-24 01:56:28,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31749 states, 31748 states have (on average 1.1612385032128008) internal successors, (36867), 31748 states have internal predecessors, (36867), 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)
[2024-11-24 01:56:28,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 36867 transitions.
[2024-11-24 01:56:28,469 INFO  L78                 Accepts]: Start accepts. Automaton has 31749 states and 36867 transitions. Word has length 28
[2024-11-24 01:56:28,469 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:28,470 INFO  L471      AbstractCegarLoop]: Abstraction has 31749 states and 36867 transitions.
[2024-11-24 01:56:28,470 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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)
[2024-11-24 01:56:28,470 INFO  L276                IsEmpty]: Start isEmpty. Operand 31749 states and 36867 transitions.
[2024-11-24 01:56:28,491 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2024-11-24 01:56:28,491 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:28,492 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]
[2024-11-24 01:56:28,492 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-11-24 01:56:28,492 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:28,492 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:28,493 INFO  L85        PathProgramCache]: Analyzing trace with hash 995094572, now seen corresponding path program 1 times
[2024-11-24 01:56:28,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:28,493 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618669046]
[2024-11-24 01:56:28,493 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:28,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:28,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:28,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:28,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:28,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618669046]
[2024-11-24 01:56:28,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618669046] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:28,523 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:28,523 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:28,523 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574526432]
[2024-11-24 01:56:28,523 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:28,523 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:28,524 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:28,524 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:28,524 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:28,524 INFO  L87              Difference]: Start difference. First operand 31749 states and 36867 transitions. Second operand  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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)
[2024-11-24 01:56:29,799 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:29,799 INFO  L93              Difference]: Finished difference Result 92167 states and 104452 transitions.
[2024-11-24 01:56:29,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:29,800 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28
[2024-11-24 01:56:29,800 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:29,855 INFO  L225             Difference]: With dead ends: 92167
[2024-11-24 01:56:29,855 INFO  L226             Difference]: Without dead ends: 31749
[2024-11-24 01:56:29,884 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:29,885 INFO  L435           NwaCegarLoop]: 82 mSDtfsCounter, 43 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:29,885 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:29,906 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31749 states.
[2024-11-24 01:56:30,843 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31749 to 31749.
[2024-11-24 01:56:30,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31749 states, 31748 states have (on average 1.096730502708832) internal successors, (34819), 31748 states have internal predecessors, (34819), 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)
[2024-11-24 01:56:30,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 34819 transitions.
[2024-11-24 01:56:30,943 INFO  L78                 Accepts]: Start accepts. Automaton has 31749 states and 34819 transitions. Word has length 28
[2024-11-24 01:56:30,943 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:30,943 INFO  L471      AbstractCegarLoop]: Abstraction has 31749 states and 34819 transitions.
[2024-11-24 01:56:30,943 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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)
[2024-11-24 01:56:30,944 INFO  L276                IsEmpty]: Start isEmpty. Operand 31749 states and 34819 transitions.
[2024-11-24 01:56:30,974 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2024-11-24 01:56:30,974 INFO  L210           NwaCegarLoop]: Found error trace
[2024-11-24 01:56:30,974 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]
[2024-11-24 01:56:30,975 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-11-24 01:56:30,975 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 01:56:30,975 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:56:30,976 INFO  L85        PathProgramCache]: Analyzing trace with hash 2006211822, now seen corresponding path program 1 times
[2024-11-24 01:56:30,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:56:30,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722454401]
[2024-11-24 01:56:30,976 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:56:30,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:56:30,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:56:31,008 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:56:31,009 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:56:31,009 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722454401]
[2024-11-24 01:56:31,009 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722454401] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:56:31,009 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:56:31,009 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:56:31,009 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272324667]
[2024-11-24 01:56:31,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:56:31,010 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:56:31,010 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:56:31,010 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:56:31,011 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:31,011 INFO  L87              Difference]: Start difference. First operand 31749 states and 34819 transitions. Second operand  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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)
[2024-11-24 01:56:31,802 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 01:56:31,803 INFO  L93              Difference]: Finished difference Result 31749 states and 34819 transitions.
[2024-11-24 01:56:31,803 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-24 01:56:31,804 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28
[2024-11-24 01:56:31,804 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 01:56:31,807 INFO  L225             Difference]: With dead ends: 31749
[2024-11-24 01:56:31,807 INFO  L226             Difference]: Without dead ends: 0
[2024-11-24 01:56:31,820 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:56:31,821 INFO  L435           NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-24 01:56:31,822 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-24 01:56:31,822 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-24 01:56:31,822 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-24 01:56:31,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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)
[2024-11-24 01:56:31,822 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-24 01:56:31,826 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28
[2024-11-24 01:56:31,826 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-24 01:56:31,827 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-24 01:56:31,827 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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)
[2024-11-24 01:56:31,827 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-24 01:56:31,827 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-24 01:56:31,831 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-24 01:56:31,832 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-11-24 01:56:31,844 INFO  L422         BasicCegarLoop]: Path program 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]
[2024-11-24 01:56:31,849 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-24 01:56:31,866 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-24 01:56:31,878 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:56:31 BoogieIcfgContainer
[2024-11-24 01:56:31,879 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-24 01:56:31,880 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-24 01:56:31,880 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-24 01:56:31,880 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-24 01:56:31,881 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:56:12" (3/4) ...
[2024-11-24 01:56:31,884 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2024-11-24 01:56:31,895 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges
[2024-11-24 01:56:31,896 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-24 01:56:31,896 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-24 01:56:31,897 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-24 01:56:32,000 INFO  L149         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/witness.graphml
[2024-11-24 01:56:32,000 INFO  L149         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/witness.yml
[2024-11-24 01:56:32,001 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-24 01:56:32,001 INFO  L158              Benchmark]: Toolchain (without parser) took 20015.60ms. Allocated memory was 117.4MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 93.6MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 618.5MB. Max. memory is 16.1GB.
[2024-11-24 01:56:32,002 INFO  L158              Benchmark]: CDTParser took 0.31ms. Allocated memory is still 167.8MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:56:32,002 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 289.51ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 81.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:56:32,002 INFO  L158              Benchmark]: Boogie Procedure Inliner took 35.86ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 80.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:56:32,003 INFO  L158              Benchmark]: Boogie Preprocessor took 53.09ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:56:32,003 INFO  L158              Benchmark]: RCFGBuilder took 429.46ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 63.2MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:56:32,003 INFO  L158              Benchmark]: TraceAbstraction took 19079.61ms. Allocated memory was 117.4MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 62.9MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 585.0MB. Max. memory is 16.1GB.
[2024-11-24 01:56:32,003 INFO  L158              Benchmark]: Witness Printer took 121.11ms. Allocated memory is still 5.0GB. Free memory was 4.4GB in the beginning and 4.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:56:32,005 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.31ms. Allocated memory is still 167.8MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 289.51ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 81.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 35.86ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 80.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 53.09ms. Allocated memory is still 117.4MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * RCFGBuilder took 429.46ms. Allocated memory is still 117.4MB. Free memory was 78.7MB in the beginning and 63.2MB in the end (delta: 15.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * TraceAbstraction took 19079.61ms. Allocated memory was 117.4MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 62.9MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 585.0MB. Max. memory is 16.1GB.
 * Witness Printer took 121.11ms. Allocated memory is still 5.0GB. Free memory was 4.4GB in the beginning and 4.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 177]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1398 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1398 mSDsluCounter, 4586 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1834 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 165 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2752 mSDtfsCounter, 165 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31749occurred in iteration=29, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 689 ConstructedInterpolants, 0 QuantifiedInterpolants, 1492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2024-11-24 01:56:32,033 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f768a6c1-5fc7-49f5-af4a-4c944e9e04be/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE