./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0515a0092ae60bee69c0826328a56fce70547e074096ceb561e2dff3da2ff25f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:23:28,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:23:28,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:23:28,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:23:28,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:23:28,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:23:28,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:23:28,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:23:28,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:23:28,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:23:28,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:23:28,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:23:28,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:23:28,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:23:28,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:23:28,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:23:28,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:23:28,680 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:23:28,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:23:28,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:23:28,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:23:28,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:23:28,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:23:28,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:23:28,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:23:28,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:23:28,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:23:28,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:23:28,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:23:28,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:23:28,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:23:28,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:23:28,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:23:28,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:23:28,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:23:28,682 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:23:28,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:23:28,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:23:28,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:23:28,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:23:28,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:23:28,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:23:28,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:23:28,682 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0515a0092ae60bee69c0826328a56fce70547e074096ceb561e2dff3da2ff25f [2025-03-03 16:23:28,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:23:28,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:23:28,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:23:28,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:23:28,929 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:23:28,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c [2025-03-03 16:23:30,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda1cd2f4/28bbd9cf901d4e90942895c760c2522c/FLAG41ce45731 [2025-03-03 16:23:30,408 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:23:30,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c [2025-03-03 16:23:30,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda1cd2f4/28bbd9cf901d4e90942895c760c2522c/FLAG41ce45731 [2025-03-03 16:23:30,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda1cd2f4/28bbd9cf901d4e90942895c760c2522c [2025-03-03 16:23:30,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:23:30,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:23:30,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:23:30,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:23:30,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:23:30,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:23:30" (1/1) ... [2025-03-03 16:23:30,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5895e379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:30, skipping insertion in model container [2025-03-03 16:23:30,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:23:30" (1/1) ... [2025-03-03 16:23:30,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:23:30,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[911,924] [2025-03-03 16:23:30,931 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[8416,8429] [2025-03-03 16:23:30,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:23:30,993 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:23:31,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[911,924] [2025-03-03 16:23:31,019 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[8416,8429] [2025-03-03 16:23:31,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:23:31,074 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:23:31,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31 WrapperNode [2025-03-03 16:23:31,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:23:31,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:23:31,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:23:31,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:23:31,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (1/1) ... [2025-03-03 16:23:31,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (1/1) ... [2025-03-03 16:23:31,117 INFO L138 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 707 [2025-03-03 16:23:31,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:23:31,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:23:31,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:23:31,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:23:31,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (1/1) ... [2025-03-03 16:23:31,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (1/1) ... [2025-03-03 16:23:31,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (1/1) ... [2025-03-03 16:23:31,143 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:23:31,143 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (1/1) ... [2025-03-03 16:23:31,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (1/1) ... [2025-03-03 16:23:31,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (1/1) ... [2025-03-03 16:23:31,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (1/1) ... [2025-03-03 16:23:31,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (1/1) ... [2025-03-03 16:23:31,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (1/1) ... [2025-03-03 16:23:31,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:23:31,157 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:23:31,157 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:23:31,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:23:31,157 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (1/1) ... [2025-03-03 16:23:31,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:23:31,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:23:31,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:23:31,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:23:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:23:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:23:31,213 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:23:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:23:31,213 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:23:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:23:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:23:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:23:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:23:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:23:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:23:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:23:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:23:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:23:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:23:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:23:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:23:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:23:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:23:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:23:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:23:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:23:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:23:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:23:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:23:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:23:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:23:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:23:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:23:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:23:31,215 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:23:31,215 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:23:31,296 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:23:31,297 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:23:31,777 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-03 16:23:31,781 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-03 16:23:31,782 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-03 16:23:31,894 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-03 16:23:31,894 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:23:31,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:23:31,909 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:23:31,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:23:31 BoogieIcfgContainer [2025-03-03 16:23:31,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:23:31,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:23:31,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:23:31,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:23:31,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:23:30" (1/3) ... [2025-03-03 16:23:31,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55df3abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:23:31, skipping insertion in model container [2025-03-03 16:23:31,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:23:31" (2/3) ... [2025-03-03 16:23:31,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55df3abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:23:31, skipping insertion in model container [2025-03-03 16:23:31,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:23:31" (3/3) ... [2025-03-03 16:23:31,915 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.06.cil-2.c [2025-03-03 16:23:31,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:23:31,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.06.cil-2.c that has 15 procedures, 365 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-03-03 16:23:31,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:23:31,994 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;@13b8fb12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:23:31,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:23:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 365 states, 312 states have (on average 1.5320512820512822) internal successors, (478), 318 states have internal predecessors, (478), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 16:23:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:23:32,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:32,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:32,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:32,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1448088744, now seen corresponding path program 1 times [2025-03-03 16:23:32,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:32,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908058809] [2025-03-03 16:23:32,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:32,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:32,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:23:32,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:23:32,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:32,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:32,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:32,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908058809] [2025-03-03 16:23:32,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908058809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:32,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:32,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:23:32,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329175303] [2025-03-03 16:23:32,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:32,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:23:32,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:32,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:23:32,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:23:32,438 INFO L87 Difference]: Start difference. First operand has 365 states, 312 states have (on average 1.5320512820512822) internal successors, (478), 318 states have internal predecessors, (478), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:33,157 INFO L93 Difference]: Finished difference Result 829 states and 1249 transitions. [2025-03-03 16:23:33,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:33,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:23:33,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:33,167 INFO L225 Difference]: With dead ends: 829 [2025-03-03 16:23:33,167 INFO L226 Difference]: Without dead ends: 476 [2025-03-03 16:23:33,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:33,172 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 402 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:33,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1186 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:23:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-03 16:23:33,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 469. [2025-03-03 16:23:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 396 states have (on average 1.4696969696969697) internal successors, (582), 402 states have internal predecessors, (582), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2025-03-03 16:23:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 683 transitions. [2025-03-03 16:23:33,227 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 683 transitions. Word has length 65 [2025-03-03 16:23:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:33,227 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 683 transitions. [2025-03-03 16:23:33,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 683 transitions. [2025-03-03 16:23:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:23:33,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:33,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:33,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:23:33,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:33,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:33,232 INFO L85 PathProgramCache]: Analyzing trace with hash 140049416, now seen corresponding path program 1 times [2025-03-03 16:23:33,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:33,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424079264] [2025-03-03 16:23:33,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:33,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:23:33,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:23:33,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:33,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:33,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:33,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424079264] [2025-03-03 16:23:33,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424079264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:33,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:33,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:33,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405008355] [2025-03-03 16:23:33,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:33,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:33,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:33,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:33,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:33,420 INFO L87 Difference]: Start difference. First operand 469 states and 683 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:34,061 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2025-03-03 16:23:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:34,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:23:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:34,065 INFO L225 Difference]: With dead ends: 842 [2025-03-03 16:23:34,065 INFO L226 Difference]: Without dead ends: 629 [2025-03-03 16:23:34,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:34,067 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 748 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:34,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1475 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:23:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-03-03 16:23:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 583. [2025-03-03 16:23:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 488 states have (on average 1.4549180327868851) internal successors, (710), 496 states have internal predecessors, (710), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2025-03-03 16:23:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 845 transitions. [2025-03-03 16:23:34,147 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 845 transitions. Word has length 65 [2025-03-03 16:23:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:34,148 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 845 transitions. [2025-03-03 16:23:34,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:23:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 845 transitions. [2025-03-03 16:23:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:23:34,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:34,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:34,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:23:34,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:34,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1273240009, now seen corresponding path program 1 times [2025-03-03 16:23:34,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:34,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199783034] [2025-03-03 16:23:34,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:34,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:34,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:23:34,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:23:34,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:34,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:34,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:34,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199783034] [2025-03-03 16:23:34,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199783034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:34,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:34,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:23:34,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003480231] [2025-03-03 16:23:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:34,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:23:34,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:34,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:23:34,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:23:34,228 INFO L87 Difference]: Start difference. First operand 583 states and 845 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:23:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:34,433 INFO L93 Difference]: Finished difference Result 1504 states and 2142 transitions. [2025-03-03 16:23:34,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:23:34,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-03-03 16:23:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:34,441 INFO L225 Difference]: With dead ends: 1504 [2025-03-03 16:23:34,443 INFO L226 Difference]: Without dead ends: 1183 [2025-03-03 16:23:34,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:23:34,445 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 620 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:34,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1217 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:23:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-03 16:23:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1157. [2025-03-03 16:23:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 952 states have (on average 1.4096638655462186) internal successors, (1342), 968 states have internal predecessors, (1342), 122 states have call successors, (122), 70 states have call predecessors, (122), 81 states have return successors, (158), 122 states have call predecessors, (158), 120 states have call successors, (158) [2025-03-03 16:23:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1622 transitions. [2025-03-03 16:23:34,520 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1622 transitions. Word has length 65 [2025-03-03 16:23:34,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:34,520 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1622 transitions. [2025-03-03 16:23:34,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:23:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1622 transitions. [2025-03-03 16:23:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:23:34,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:34,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:34,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:23:34,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:34,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:34,525 INFO L85 PathProgramCache]: Analyzing trace with hash -348581136, now seen corresponding path program 1 times [2025-03-03 16:23:34,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:34,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584184210] [2025-03-03 16:23:34,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:34,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:23:34,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:23:34,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:34,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:34,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:34,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584184210] [2025-03-03 16:23:34,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584184210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:34,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:34,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:34,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070750946] [2025-03-03 16:23:34,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:34,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:34,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:34,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:34,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:34,622 INFO L87 Difference]: Start difference. First operand 1157 states and 1622 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:34,695 INFO L93 Difference]: Finished difference Result 2072 states and 2898 transitions. [2025-03-03 16:23:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:34,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-03 16:23:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:34,701 INFO L225 Difference]: With dead ends: 2072 [2025-03-03 16:23:34,701 INFO L226 Difference]: Without dead ends: 1177 [2025-03-03 16:23:34,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:34,704 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 0 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:34,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2594 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-03-03 16:23:34,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1177. [2025-03-03 16:23:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 968 states have (on average 1.3977272727272727) internal successors, (1353), 984 states have internal predecessors, (1353), 122 states have call successors, (122), 70 states have call predecessors, (122), 85 states have return successors, (165), 126 states have call predecessors, (165), 120 states have call successors, (165) [2025-03-03 16:23:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1640 transitions. [2025-03-03 16:23:34,774 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1640 transitions. Word has length 66 [2025-03-03 16:23:34,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:34,774 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1640 transitions. [2025-03-03 16:23:34,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:23:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1640 transitions. [2025-03-03 16:23:34,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:23:34,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:34,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:34,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:23:34,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:34,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:34,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1284222863, now seen corresponding path program 1 times [2025-03-03 16:23:34,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:34,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196016336] [2025-03-03 16:23:34,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:34,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:34,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:23:34,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:23:34,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:34,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:34,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:34,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196016336] [2025-03-03 16:23:34,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196016336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:34,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:34,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366999414] [2025-03-03 16:23:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:34,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:34,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:34,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:34,867 INFO L87 Difference]: Start difference. First operand 1177 states and 1640 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:23:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:35,349 INFO L93 Difference]: Finished difference Result 3774 states and 5212 transitions. [2025-03-03 16:23:35,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:23:35,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2025-03-03 16:23:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:35,357 INFO L225 Difference]: With dead ends: 3774 [2025-03-03 16:23:35,357 INFO L226 Difference]: Without dead ends: 1467 [2025-03-03 16:23:35,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:35,364 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 1534 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 2332 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:35,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 2332 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:23:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2025-03-03 16:23:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1084. [2025-03-03 16:23:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 875 states have (on average 1.3725714285714286) internal successors, (1201), 891 states have internal predecessors, (1201), 122 states have call successors, (122), 70 states have call predecessors, (122), 85 states have return successors, (153), 126 states have call predecessors, (153), 120 states have call successors, (153) [2025-03-03 16:23:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1476 transitions. [2025-03-03 16:23:35,426 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1476 transitions. Word has length 66 [2025-03-03 16:23:35,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:35,426 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1476 transitions. [2025-03-03 16:23:35,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:23:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1476 transitions. [2025-03-03 16:23:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:23:35,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:35,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:35,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:23:35,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:35,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash -871041062, now seen corresponding path program 1 times [2025-03-03 16:23:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:35,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219593185] [2025-03-03 16:23:35,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:35,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:35,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:23:35,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:23:35,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:35,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:35,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:35,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219593185] [2025-03-03 16:23:35,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219593185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:35,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:35,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:23:35,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400513448] [2025-03-03 16:23:35,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:35,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:23:35,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:35,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:23:35,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:23:35,547 INFO L87 Difference]: Start difference. First operand 1084 states and 1476 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:23:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:36,171 INFO L93 Difference]: Finished difference Result 2195 states and 2954 transitions. [2025-03-03 16:23:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:23:36,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2025-03-03 16:23:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:36,174 INFO L225 Difference]: With dead ends: 2195 [2025-03-03 16:23:36,174 INFO L226 Difference]: Without dead ends: 242 [2025-03-03 16:23:36,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:23:36,178 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 886 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:36,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1379 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:23:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-03 16:23:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-03-03 16:23:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.5069767441860464) internal successors, (324), 216 states have internal predecessors, (324), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 16:23:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 364 transitions. [2025-03-03 16:23:36,186 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 364 transitions. Word has length 67 [2025-03-03 16:23:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:36,186 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 364 transitions. [2025-03-03 16:23:36,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:23:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 364 transitions. [2025-03-03 16:23:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:36,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:36,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:36,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:23:36,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:36,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1995847001, now seen corresponding path program 1 times [2025-03-03 16:23:36,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:36,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690469546] [2025-03-03 16:23:36,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:36,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:36,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:36,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:36,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:36,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:36,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:36,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690469546] [2025-03-03 16:23:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690469546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:23:36,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034949528] [2025-03-03 16:23:36,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:36,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:23:36,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:36,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:23:36,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:23:36,223 INFO L87 Difference]: Start difference. First operand 242 states and 364 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:36,235 INFO L93 Difference]: Finished difference Result 474 states and 713 transitions. [2025-03-03 16:23:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:23:36,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-03 16:23:36,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:36,238 INFO L225 Difference]: With dead ends: 474 [2025-03-03 16:23:36,238 INFO L226 Difference]: Without dead ends: 242 [2025-03-03 16:23:36,239 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 [2025-03-03 16:23:36,240 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 354 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:36,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 363 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:23:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-03 16:23:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-03-03 16:23:36,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.5023255813953489) internal successors, (323), 216 states have internal predecessors, (323), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 16:23:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 363 transitions. [2025-03-03 16:23:36,249 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 363 transitions. Word has length 112 [2025-03-03 16:23:36,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:36,249 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 363 transitions. [2025-03-03 16:23:36,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 363 transitions. [2025-03-03 16:23:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:36,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:36,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:36,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:23:36,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:36,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:36,251 INFO L85 PathProgramCache]: Analyzing trace with hash 501934552, now seen corresponding path program 1 times [2025-03-03 16:23:36,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:36,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861859973] [2025-03-03 16:23:36,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:36,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:36,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:36,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:36,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:36,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:36,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861859973] [2025-03-03 16:23:36,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861859973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:36,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:36,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:23:36,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383562354] [2025-03-03 16:23:36,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:36,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:23:36,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:36,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:23:36,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:23:36,329 INFO L87 Difference]: Start difference. First operand 242 states and 363 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:36,611 INFO L93 Difference]: Finished difference Result 720 states and 1093 transitions. [2025-03-03 16:23:36,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:23:36,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-03 16:23:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:36,615 INFO L225 Difference]: With dead ends: 720 [2025-03-03 16:23:36,615 INFO L226 Difference]: Without dead ends: 493 [2025-03-03 16:23:36,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:36,616 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 655 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:36,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1002 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:23:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-03 16:23:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 476. [2025-03-03 16:23:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 427 states have (on average 1.515222482435597) internal successors, (647), 429 states have internal predecessors, (647), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-03 16:23:36,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 718 transitions. [2025-03-03 16:23:36,632 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 718 transitions. Word has length 112 [2025-03-03 16:23:36,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:36,632 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 718 transitions. [2025-03-03 16:23:36,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 718 transitions. [2025-03-03 16:23:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:36,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:36,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:36,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:23:36,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:36,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:36,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1006049766, now seen corresponding path program 1 times [2025-03-03 16:23:36,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:36,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978274883] [2025-03-03 16:23:36,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:36,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:36,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:36,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:36,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:36,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:36,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:36,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978274883] [2025-03-03 16:23:36,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978274883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:36,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:36,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:36,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3960613] [2025-03-03 16:23:36,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:36,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:36,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:36,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:36,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:36,731 INFO L87 Difference]: Start difference. First operand 476 states and 718 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:37,153 INFO L93 Difference]: Finished difference Result 1229 states and 1876 transitions. [2025-03-03 16:23:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:37,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-03 16:23:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:37,157 INFO L225 Difference]: With dead ends: 1229 [2025-03-03 16:23:37,157 INFO L226 Difference]: Without dead ends: 768 [2025-03-03 16:23:37,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:37,159 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 653 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:37,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1924 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-03-03 16:23:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 695. [2025-03-03 16:23:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 624 states have (on average 1.5080128205128205) internal successors, (941), 627 states have internal predecessors, (941), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-03-03 16:23:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1045 transitions. [2025-03-03 16:23:37,201 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1045 transitions. Word has length 112 [2025-03-03 16:23:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:37,201 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1045 transitions. [2025-03-03 16:23:37,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1045 transitions. [2025-03-03 16:23:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:37,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:37,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:37,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:23:37,203 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:37,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:37,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1815537223, now seen corresponding path program 1 times [2025-03-03 16:23:37,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:37,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501306119] [2025-03-03 16:23:37,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:37,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:37,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:37,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:37,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:37,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:37,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:37,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501306119] [2025-03-03 16:23:37,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501306119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:37,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:37,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:37,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310301475] [2025-03-03 16:23:37,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:37,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:37,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:37,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:37,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:37,300 INFO L87 Difference]: Start difference. First operand 695 states and 1045 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:37,728 INFO L93 Difference]: Finished difference Result 1920 states and 2924 transitions. [2025-03-03 16:23:37,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:37,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-03 16:23:37,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:37,736 INFO L225 Difference]: With dead ends: 1920 [2025-03-03 16:23:37,736 INFO L226 Difference]: Without dead ends: 1240 [2025-03-03 16:23:37,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:37,739 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 648 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:37,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1908 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:37,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2025-03-03 16:23:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1158. [2025-03-03 16:23:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1041 states have (on average 1.5100864553314122) internal successors, (1572), 1048 states have internal predecessors, (1572), 80 states have call successors, (80), 30 states have call predecessors, (80), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-03-03 16:23:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1748 transitions. [2025-03-03 16:23:37,784 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1748 transitions. Word has length 112 [2025-03-03 16:23:37,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:37,785 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1748 transitions. [2025-03-03 16:23:37,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1748 transitions. [2025-03-03 16:23:37,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:37,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:37,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:37,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:23:37,787 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:37,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:37,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2037675578, now seen corresponding path program 1 times [2025-03-03 16:23:37,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:37,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517367905] [2025-03-03 16:23:37,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:37,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:37,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:37,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:37,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:37,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:37,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:37,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517367905] [2025-03-03 16:23:37,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517367905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:37,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:37,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:23:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63983479] [2025-03-03 16:23:37,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:37,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:23:37,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:37,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:23:37,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:23:37,911 INFO L87 Difference]: Start difference. First operand 1158 states and 1748 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:38,170 INFO L93 Difference]: Finished difference Result 2433 states and 3732 transitions. [2025-03-03 16:23:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:23:38,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-03 16:23:38,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:38,177 INFO L225 Difference]: With dead ends: 2433 [2025-03-03 16:23:38,178 INFO L226 Difference]: Without dead ends: 1290 [2025-03-03 16:23:38,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:38,181 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 471 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:38,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 712 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:23:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-03-03 16:23:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1158. [2025-03-03 16:23:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1041 states have (on average 1.505283381364073) internal successors, (1567), 1048 states have internal predecessors, (1567), 80 states have call successors, (80), 30 states have call predecessors, (80), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-03-03 16:23:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1743 transitions. [2025-03-03 16:23:38,229 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1743 transitions. Word has length 112 [2025-03-03 16:23:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:38,230 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1743 transitions. [2025-03-03 16:23:38,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1743 transitions. [2025-03-03 16:23:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:38,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:38,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:38,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:23:38,232 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:38,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2023425433, now seen corresponding path program 1 times [2025-03-03 16:23:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:38,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669847180] [2025-03-03 16:23:38,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:38,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:38,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:38,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:38,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:38,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:38,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:38,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669847180] [2025-03-03 16:23:38,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669847180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:38,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:38,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:38,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667855465] [2025-03-03 16:23:38,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:38,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:38,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:38,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:38,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:38,332 INFO L87 Difference]: Start difference. First operand 1158 states and 1743 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:38,806 INFO L93 Difference]: Finished difference Result 3381 states and 5166 transitions. [2025-03-03 16:23:38,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:38,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-03 16:23:38,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:38,816 INFO L225 Difference]: With dead ends: 3381 [2025-03-03 16:23:38,816 INFO L226 Difference]: Without dead ends: 2238 [2025-03-03 16:23:38,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:38,820 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 635 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:38,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1877 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:38,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2025-03-03 16:23:38,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2144. [2025-03-03 16:23:38,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 1929 states have (on average 1.516329704510109) internal successors, (2925), 1950 states have internal predecessors, (2925), 140 states have call successors, (140), 54 states have call predecessors, (140), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-03-03 16:23:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 3269 transitions. [2025-03-03 16:23:38,908 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 3269 transitions. Word has length 112 [2025-03-03 16:23:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:38,909 INFO L471 AbstractCegarLoop]: Abstraction has 2144 states and 3269 transitions. [2025-03-03 16:23:38,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:38,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 3269 transitions. [2025-03-03 16:23:38,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:38,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:38,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:38,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:23:38,911 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:38,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:38,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1053134426, now seen corresponding path program 1 times [2025-03-03 16:23:38,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:38,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011717393] [2025-03-03 16:23:38,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:38,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:38,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:38,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:38,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:38,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:39,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:39,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011717393] [2025-03-03 16:23:39,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011717393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:39,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:39,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:39,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596245718] [2025-03-03 16:23:39,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:39,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:39,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:39,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:39,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:39,023 INFO L87 Difference]: Start difference. First operand 2144 states and 3269 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:39,561 INFO L93 Difference]: Finished difference Result 6543 states and 10190 transitions. [2025-03-03 16:23:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:39,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-03 16:23:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:39,576 INFO L225 Difference]: With dead ends: 6543 [2025-03-03 16:23:39,577 INFO L226 Difference]: Without dead ends: 4414 [2025-03-03 16:23:39,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:39,581 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 630 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:39,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1865 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2025-03-03 16:23:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 4287. [2025-03-03 16:23:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4287 states, 3858 states have (on average 1.535769828926905) internal successors, (5925), 3925 states have internal predecessors, (5925), 260 states have call successors, (260), 102 states have call predecessors, (260), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-03-03 16:23:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6701 transitions. [2025-03-03 16:23:39,744 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6701 transitions. Word has length 112 [2025-03-03 16:23:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:39,744 INFO L471 AbstractCegarLoop]: Abstraction has 4287 states and 6701 transitions. [2025-03-03 16:23:39,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6701 transitions. [2025-03-03 16:23:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:39,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:39,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:39,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:23:39,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:39,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:39,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1991666041, now seen corresponding path program 1 times [2025-03-03 16:23:39,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:39,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547959725] [2025-03-03 16:23:39,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:39,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:39,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:39,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:39,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:39,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:39,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:39,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547959725] [2025-03-03 16:23:39,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547959725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:39,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:39,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:39,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138250611] [2025-03-03 16:23:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:39,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:39,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:39,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:39,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:39,877 INFO L87 Difference]: Start difference. First operand 4287 states and 6701 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:40,556 INFO L93 Difference]: Finished difference Result 13492 states and 21740 transitions. [2025-03-03 16:23:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:40,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-03 16:23:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:40,607 INFO L225 Difference]: With dead ends: 13492 [2025-03-03 16:23:40,607 INFO L226 Difference]: Without dead ends: 9220 [2025-03-03 16:23:40,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:40,621 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 625 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:40,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1853 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9220 states. [2025-03-03 16:23:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9220 to 9032. [2025-03-03 16:23:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9032 states, 8121 states have (on average 1.5605221031892624) internal successors, (12673), 8334 states have internal predecessors, (12673), 500 states have call successors, (500), 198 states have call predecessors, (500), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-03-03 16:23:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9032 states to 9032 states and 14697 transitions. [2025-03-03 16:23:41,052 INFO L78 Accepts]: Start accepts. Automaton has 9032 states and 14697 transitions. Word has length 112 [2025-03-03 16:23:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:41,053 INFO L471 AbstractCegarLoop]: Abstraction has 9032 states and 14697 transitions. [2025-03-03 16:23:41,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 9032 states and 14697 transitions. [2025-03-03 16:23:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:41,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:41,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:41,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:23:41,060 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:41,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1606299258, now seen corresponding path program 1 times [2025-03-03 16:23:41,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:41,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677080128] [2025-03-03 16:23:41,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:41,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:41,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:41,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:41,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:41,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:41,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677080128] [2025-03-03 16:23:41,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677080128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:41,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:41,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080735486] [2025-03-03 16:23:41,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:41,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:41,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:41,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:41,155 INFO L87 Difference]: Start difference. First operand 9032 states and 14697 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:42,409 INFO L93 Difference]: Finished difference Result 30555 states and 51683 transitions. [2025-03-03 16:23:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:42,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-03 16:23:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:42,504 INFO L225 Difference]: With dead ends: 30555 [2025-03-03 16:23:42,505 INFO L226 Difference]: Without dead ends: 21538 [2025-03-03 16:23:42,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:42,533 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 814 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:42,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1828 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:23:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21538 states. [2025-03-03 16:23:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21538 to 19641. [2025-03-03 16:23:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19641 states, 17636 states have (on average 1.5895327738716263) internal successors, (28033), 18303 states have internal predecessors, (28033), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-03 16:23:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19641 states to 19641 states and 34025 transitions. [2025-03-03 16:23:43,527 INFO L78 Accepts]: Start accepts. Automaton has 19641 states and 34025 transitions. Word has length 112 [2025-03-03 16:23:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:43,528 INFO L471 AbstractCegarLoop]: Abstraction has 19641 states and 34025 transitions. [2025-03-03 16:23:43,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 19641 states and 34025 transitions. [2025-03-03 16:23:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:43,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:43,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:43,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:23:43,539 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:43,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:43,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1038531239, now seen corresponding path program 1 times [2025-03-03 16:23:43,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:43,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917715040] [2025-03-03 16:23:43,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:43,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:43,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:43,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:43,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:43,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:43,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:43,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917715040] [2025-03-03 16:23:43,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917715040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:43,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:43,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:43,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224865068] [2025-03-03 16:23:43,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:43,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:43,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:43,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:43,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:43,657 INFO L87 Difference]: Start difference. First operand 19641 states and 34025 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:45,884 INFO L93 Difference]: Finished difference Result 66722 states and 122553 transitions. [2025-03-03 16:23:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:45,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-03 16:23:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:46,093 INFO L225 Difference]: With dead ends: 66722 [2025-03-03 16:23:46,093 INFO L226 Difference]: Without dead ends: 47096 [2025-03-03 16:23:46,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:46,159 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 778 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:46,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1812 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47096 states. [2025-03-03 16:23:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47096 to 43538. [2025-03-03 16:23:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43538 states, 38891 states have (on average 1.618395001414209) internal successors, (62941), 40952 states have internal predecessors, (62941), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-03 16:23:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43538 states to 43538 states and 82949 transitions. [2025-03-03 16:23:48,751 INFO L78 Accepts]: Start accepts. Automaton has 43538 states and 82949 transitions. Word has length 112 [2025-03-03 16:23:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:23:48,752 INFO L471 AbstractCegarLoop]: Abstraction has 43538 states and 82949 transitions. [2025-03-03 16:23:48,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 43538 states and 82949 transitions. [2025-03-03 16:23:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:23:48,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:23:48,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:23:48,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:23:48,772 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:23:48,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:23:48,773 INFO L85 PathProgramCache]: Analyzing trace with hash 815814298, now seen corresponding path program 1 times [2025-03-03 16:23:48,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:23:48,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549484682] [2025-03-03 16:23:48,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:23:48,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:23:48,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:23:48,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:23:48,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:23:48,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:23:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:23:48,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:23:48,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549484682] [2025-03-03 16:23:48,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549484682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:23:48,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:23:48,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:23:48,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298199625] [2025-03-03 16:23:48,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:23:48,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:23:48,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:23:48,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:23:48,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:23:48,883 INFO L87 Difference]: Start difference. First operand 43538 states and 82949 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:23:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:23:53,343 INFO L93 Difference]: Finished difference Result 148477 states and 308727 transitions. [2025-03-03 16:23:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:23:53,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-03 16:23:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:23:53,924 INFO L225 Difference]: With dead ends: 148477 [2025-03-03 16:23:53,924 INFO L226 Difference]: Without dead ends: 104954 [2025-03-03 16:23:54,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:23:54,077 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 744 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:23:54,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1804 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:23:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104954 states. [2025-03-03 16:24:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104954 to 99543. [2025-03-03 16:24:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99543 states, 88218 states have (on average 1.6414450565644199) internal successors, (144805), 94525 states have internal predecessors, (144805), 3476 states have call successors, (3476), 1542 states have call predecessors, (3476), 7848 states have return successors, (69012), 3731 states have call predecessors, (69012), 3476 states have call successors, (69012) [2025-03-03 16:24:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99543 states to 99543 states and 217293 transitions. [2025-03-03 16:24:01,857 INFO L78 Accepts]: Start accepts. Automaton has 99543 states and 217293 transitions. Word has length 112 [2025-03-03 16:24:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:01,857 INFO L471 AbstractCegarLoop]: Abstraction has 99543 states and 217293 transitions. [2025-03-03 16:24:01,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 99543 states and 217293 transitions. [2025-03-03 16:24:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 16:24:01,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:01,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:01,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:24:01,887 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:01,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:01,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1984010553, now seen corresponding path program 1 times [2025-03-03 16:24:01,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:01,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268411015] [2025-03-03 16:24:01,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:01,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:01,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 16:24:01,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 16:24:01,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:01,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:01,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268411015] [2025-03-03 16:24:01,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268411015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:01,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:01,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:01,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11625047] [2025-03-03 16:24:01,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:01,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:01,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:01,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:01,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:01,967 INFO L87 Difference]: Start difference. First operand 99543 states and 217293 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)